./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d16_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d16_e0.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 740169cb7aec884028548f875dd7710b7e8c54465b62519efb8743dcffb7d119 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:55:39,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:55:39,177 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 01:55:39,182 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:55:39,183 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:55:39,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:55:39,202 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:55:39,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:55:39,203 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:55:39,206 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:55:39,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:55:39,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:55:39,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:55:39,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:55:39,209 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:55:39,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:55:39,209 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:55:39,210 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 01:55:39,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:55:39,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:55:39,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:55:39,212 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:55:39,213 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:55:39,213 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:55:39,213 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:55:39,213 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:55:39,213 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:55:39,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:55:39,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:55:39,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:55:39,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:55:39,214 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:55:39,215 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:55:39,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 01:55:39,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 01:55:39,215 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:55:39,215 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:55:39,215 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:55:39,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:55:39,216 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 740169cb7aec884028548f875dd7710b7e8c54465b62519efb8743dcffb7d119 [2024-11-10 01:55:39,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:55:39,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:55:39,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:55:39,464 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:55:39,465 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:55:39,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d16_e0.c [2024-11-10 01:55:40,647 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:55:40,898 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:55:40,900 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d16_e0.c [2024-11-10 01:55:40,910 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1ba58b62/3a11e47f9f18412fafb35f1bbff10f91/FLAG5a8b46bb4 [2024-11-10 01:55:40,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1ba58b62/3a11e47f9f18412fafb35f1bbff10f91 [2024-11-10 01:55:40,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:55:40,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:55:40,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:55:40,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:55:40,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:55:40,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:55:40" (1/1) ... [2024-11-10 01:55:40,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d361127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:40, skipping insertion in model container [2024-11-10 01:55:40,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:55:40" (1/1) ... [2024-11-10 01:55:40,972 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:55:41,104 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d16_e0.c[1280,1293] [2024-11-10 01:55:41,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:55:41,325 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:55:41,335 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d16_e0.c[1280,1293] [2024-11-10 01:55:41,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:55:41,423 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:55:41,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:41 WrapperNode [2024-11-10 01:55:41,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:55:41,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:55:41,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:55:41,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:55:41,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:41" (1/1) ... [2024-11-10 01:55:41,468 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:41" (1/1) ... [2024-11-10 01:55:41,609 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1976 [2024-11-10 01:55:41,609 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:55:41,610 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:55:41,610 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:55:41,610 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:55:41,619 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:41" (1/1) ... [2024-11-10 01:55:41,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:41" (1/1) ... [2024-11-10 01:55:41,641 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:41" (1/1) ... [2024-11-10 01:55:41,692 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 01:55:41,692 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:41" (1/1) ... [2024-11-10 01:55:41,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:41" (1/1) ... [2024-11-10 01:55:41,743 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:41" (1/1) ... [2024-11-10 01:55:41,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:41" (1/1) ... [2024-11-10 01:55:41,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:41" (1/1) ... [2024-11-10 01:55:41,797 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:41" (1/1) ... [2024-11-10 01:55:41,825 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:55:41,827 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:55:41,827 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:55:41,827 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:55:41,828 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:41" (1/1) ... [2024-11-10 01:55:41,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:55:41,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:55:41,858 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 01:55:41,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 01:55:41,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:55:41,899 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 01:55:41,899 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 01:55:41,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 01:55:41,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:55:41,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:55:42,090 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:55:42,092 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:55:43,732 INFO L? ?]: Removed 1091 outVars from TransFormulas that were not future-live. [2024-11-10 01:55:43,732 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:55:43,836 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:55:43,837 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 01:55:43,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:55:43 BoogieIcfgContainer [2024-11-10 01:55:43,838 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:55:43,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:55:43,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:55:43,843 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:55:43,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:55:40" (1/3) ... [2024-11-10 01:55:43,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5abb6ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:55:43, skipping insertion in model container [2024-11-10 01:55:43,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:41" (2/3) ... [2024-11-10 01:55:43,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5abb6ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:55:43, skipping insertion in model container [2024-11-10 01:55:43,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:55:43" (3/3) ... [2024-11-10 01:55:43,847 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w64_d16_e0.c [2024-11-10 01:55:43,863 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:55:43,863 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 01:55:43,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:55:43,953 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;@7c3f7df0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:55:43,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 01:55:43,960 INFO L276 IsEmpty]: Start isEmpty. Operand has 555 states, 549 states have (on average 1.4918032786885247) internal successors, (819), 550 states have internal predecessors, (819), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:43,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-10 01:55:43,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:43,983 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:43,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:43,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:43,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1625409850, now seen corresponding path program 1 times [2024-11-10 01:55:43,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:43,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224718158] [2024-11-10 01:55:43,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:43,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:44,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:44,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 01:55:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:44,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 01:55:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:44,360 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:44,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:44,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224718158] [2024-11-10 01:55:44,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224718158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:44,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:44,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 01:55:44,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889138088] [2024-11-10 01:55:44,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:44,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 01:55:44,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:44,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 01:55:44,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 01:55:44,390 INFO L87 Difference]: Start difference. First operand has 555 states, 549 states have (on average 1.4918032786885247) internal successors, (819), 550 states have internal predecessors, (819), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 69.0) internal successors, (138), 2 states have internal predecessors, (138), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 01:55:44,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:44,587 INFO L93 Difference]: Finished difference Result 1003 states and 1497 transitions. [2024-11-10 01:55:44,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 01:55:44,589 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 69.0) internal successors, (138), 2 states have internal predecessors, (138), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 150 [2024-11-10 01:55:44,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:44,602 INFO L225 Difference]: With dead ends: 1003 [2024-11-10 01:55:44,603 INFO L226 Difference]: Without dead ends: 550 [2024-11-10 01:55:44,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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-11-10 01:55:44,611 INFO L432 NwaCegarLoop]: 685 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:44,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 685 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:44,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-10 01:55:44,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2024-11-10 01:55:44,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 545 states have (on average 1.489908256880734) internal successors, (812), 545 states have internal predecessors, (812), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:44,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 818 transitions. [2024-11-10 01:55:44,670 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 818 transitions. Word has length 150 [2024-11-10 01:55:44,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:44,671 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 818 transitions. [2024-11-10 01:55:44,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 69.0) internal successors, (138), 2 states have internal predecessors, (138), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 01:55:44,671 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 818 transitions. [2024-11-10 01:55:44,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-10 01:55:44,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:44,673 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:44,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 01:55:44,674 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:44,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:44,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1352422711, now seen corresponding path program 1 times [2024-11-10 01:55:44,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:44,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267626194] [2024-11-10 01:55:44,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:44,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:45,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:45,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 01:55:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:45,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 01:55:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:45,542 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:45,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:45,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267626194] [2024-11-10 01:55:45,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267626194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:45,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:45,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:55:45,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239198457] [2024-11-10 01:55:45,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:45,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:55:45,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:45,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:55:45,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:55:45,549 INFO L87 Difference]: Start difference. First operand 550 states and 818 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:45,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:45,887 INFO L93 Difference]: Finished difference Result 998 states and 1484 transitions. [2024-11-10 01:55:45,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:45,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 150 [2024-11-10 01:55:45,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:45,890 INFO L225 Difference]: With dead ends: 998 [2024-11-10 01:55:45,890 INFO L226 Difference]: Without dead ends: 550 [2024-11-10 01:55:45,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:45,892 INFO L432 NwaCegarLoop]: 619 mSDtfsCounter, 694 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:45,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 1240 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:55:45,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-10 01:55:45,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2024-11-10 01:55:45,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 545 states have (on average 1.4862385321100917) internal successors, (810), 545 states have internal predecessors, (810), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:45,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 816 transitions. [2024-11-10 01:55:45,905 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 816 transitions. Word has length 150 [2024-11-10 01:55:45,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:45,906 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 816 transitions. [2024-11-10 01:55:45,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:45,906 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 816 transitions. [2024-11-10 01:55:45,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 01:55:45,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:45,908 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:45,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 01:55:45,908 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:45,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:45,909 INFO L85 PathProgramCache]: Analyzing trace with hash -303861187, now seen corresponding path program 1 times [2024-11-10 01:55:45,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:45,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609209430] [2024-11-10 01:55:45,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:45,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:46,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:46,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 01:55:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:46,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 01:55:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:46,293 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:46,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:46,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609209430] [2024-11-10 01:55:46,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609209430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:46,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:46,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:46,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004840894] [2024-11-10 01:55:46,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:46,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:46,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:46,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:46,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:46,298 INFO L87 Difference]: Start difference. First operand 550 states and 816 transitions. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:46,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:46,664 INFO L93 Difference]: Finished difference Result 1006 states and 1491 transitions. [2024-11-10 01:55:46,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:55:46,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 152 [2024-11-10 01:55:46,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:46,667 INFO L225 Difference]: With dead ends: 1006 [2024-11-10 01:55:46,667 INFO L226 Difference]: Without dead ends: 550 [2024-11-10 01:55:46,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:55:46,668 INFO L432 NwaCegarLoop]: 674 mSDtfsCounter, 709 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 1971 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:46,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 1971 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:55:46,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-10 01:55:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2024-11-10 01:55:46,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 545 states have (on average 1.4844036697247707) internal successors, (809), 545 states have internal predecessors, (809), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:46,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 815 transitions. [2024-11-10 01:55:46,682 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 815 transitions. Word has length 152 [2024-11-10 01:55:46,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:46,684 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 815 transitions. [2024-11-10 01:55:46,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:46,684 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 815 transitions. [2024-11-10 01:55:46,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-10 01:55:46,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:46,686 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:46,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 01:55:46,687 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:46,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:46,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1361897857, now seen corresponding path program 1 times [2024-11-10 01:55:46,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:46,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503720103] [2024-11-10 01:55:46,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:46,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:47,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:47,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 01:55:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:47,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 01:55:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:47,049 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:47,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:47,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503720103] [2024-11-10 01:55:47,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503720103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:47,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:47,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:47,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039924073] [2024-11-10 01:55:47,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:47,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:47,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:47,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:47,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:47,051 INFO L87 Difference]: Start difference. First operand 550 states and 815 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:47,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:47,372 INFO L93 Difference]: Finished difference Result 998 states and 1478 transitions. [2024-11-10 01:55:47,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:47,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 153 [2024-11-10 01:55:47,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:47,375 INFO L225 Difference]: With dead ends: 998 [2024-11-10 01:55:47,376 INFO L226 Difference]: Without dead ends: 550 [2024-11-10 01:55:47,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:47,377 INFO L432 NwaCegarLoop]: 619 mSDtfsCounter, 1498 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:47,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 1240 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:55:47,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-10 01:55:47,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2024-11-10 01:55:47,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 545 states have (on average 1.4825688073394496) internal successors, (808), 545 states have internal predecessors, (808), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:47,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 814 transitions. [2024-11-10 01:55:47,388 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 814 transitions. Word has length 153 [2024-11-10 01:55:47,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:47,388 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 814 transitions. [2024-11-10 01:55:47,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:47,389 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 814 transitions. [2024-11-10 01:55:47,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-10 01:55:47,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:47,390 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:47,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 01:55:47,390 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:47,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:47,391 INFO L85 PathProgramCache]: Analyzing trace with hash -27729726, now seen corresponding path program 1 times [2024-11-10 01:55:47,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:47,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146282403] [2024-11-10 01:55:47,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:47,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:47,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:47,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 01:55:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:47,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 01:55:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:47,706 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:47,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:47,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146282403] [2024-11-10 01:55:47,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146282403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:47,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:47,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:47,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526828098] [2024-11-10 01:55:47,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:47,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:47,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:47,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:47,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:47,709 INFO L87 Difference]: Start difference. First operand 550 states and 814 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:47,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:47,989 INFO L93 Difference]: Finished difference Result 998 states and 1476 transitions. [2024-11-10 01:55:47,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:47,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 154 [2024-11-10 01:55:47,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:47,991 INFO L225 Difference]: With dead ends: 998 [2024-11-10 01:55:47,991 INFO L226 Difference]: Without dead ends: 550 [2024-11-10 01:55:47,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:47,993 INFO L432 NwaCegarLoop]: 619 mSDtfsCounter, 799 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:47,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 1247 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:47,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-10 01:55:48,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2024-11-10 01:55:48,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 545 states have (on average 1.4807339449541284) internal successors, (807), 545 states have internal predecessors, (807), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:48,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 813 transitions. [2024-11-10 01:55:48,002 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 813 transitions. Word has length 154 [2024-11-10 01:55:48,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:48,003 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 813 transitions. [2024-11-10 01:55:48,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:48,003 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 813 transitions. [2024-11-10 01:55:48,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 01:55:48,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:48,004 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:48,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 01:55:48,005 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:48,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:48,005 INFO L85 PathProgramCache]: Analyzing trace with hash -80997788, now seen corresponding path program 1 times [2024-11-10 01:55:48,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:48,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921757859] [2024-11-10 01:55:48,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:48,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:48,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:48,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 01:55:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:48,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 01:55:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:48,287 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:48,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:48,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921757859] [2024-11-10 01:55:48,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921757859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:48,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:48,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:48,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993548464] [2024-11-10 01:55:48,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:48,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:48,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:48,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:48,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:48,288 INFO L87 Difference]: Start difference. First operand 550 states and 813 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:48,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:48,580 INFO L93 Difference]: Finished difference Result 998 states and 1474 transitions. [2024-11-10 01:55:48,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:48,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 155 [2024-11-10 01:55:48,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:48,582 INFO L225 Difference]: With dead ends: 998 [2024-11-10 01:55:48,582 INFO L226 Difference]: Without dead ends: 550 [2024-11-10 01:55:48,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:48,584 INFO L432 NwaCegarLoop]: 619 mSDtfsCounter, 1482 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:48,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 1240 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:55:48,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-10 01:55:48,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2024-11-10 01:55:48,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 545 states have (on average 1.4788990825688073) internal successors, (806), 545 states have internal predecessors, (806), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:48,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 812 transitions. [2024-11-10 01:55:48,598 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 812 transitions. Word has length 155 [2024-11-10 01:55:48,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:48,598 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 812 transitions. [2024-11-10 01:55:48,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:48,598 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 812 transitions. [2024-11-10 01:55:48,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-10 01:55:48,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:48,599 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:48,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 01:55:48,600 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:48,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:48,600 INFO L85 PathProgramCache]: Analyzing trace with hash -716184121, now seen corresponding path program 1 times [2024-11-10 01:55:48,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:48,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98984918] [2024-11-10 01:55:48,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:48,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:48,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:48,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 01:55:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:48,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 01:55:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:48,907 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:48,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:48,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98984918] [2024-11-10 01:55:48,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98984918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:48,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:48,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:48,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168689169] [2024-11-10 01:55:48,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:48,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:48,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:48,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:48,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:48,910 INFO L87 Difference]: Start difference. First operand 550 states and 812 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:49,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:49,204 INFO L93 Difference]: Finished difference Result 998 states and 1472 transitions. [2024-11-10 01:55:49,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:49,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 156 [2024-11-10 01:55:49,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:49,206 INFO L225 Difference]: With dead ends: 998 [2024-11-10 01:55:49,206 INFO L226 Difference]: Without dead ends: 550 [2024-11-10 01:55:49,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:49,207 INFO L432 NwaCegarLoop]: 619 mSDtfsCounter, 1466 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:49,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1469 Valid, 1240 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:55:49,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-10 01:55:49,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2024-11-10 01:55:49,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 545 states have (on average 1.4770642201834863) internal successors, (805), 545 states have internal predecessors, (805), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:49,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 811 transitions. [2024-11-10 01:55:49,219 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 811 transitions. Word has length 156 [2024-11-10 01:55:49,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:49,219 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 811 transitions. [2024-11-10 01:55:49,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:49,220 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 811 transitions. [2024-11-10 01:55:49,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-10 01:55:49,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:49,221 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:49,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 01:55:49,221 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:49,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:49,222 INFO L85 PathProgramCache]: Analyzing trace with hash -379887002, now seen corresponding path program 1 times [2024-11-10 01:55:49,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:49,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228304229] [2024-11-10 01:55:49,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:49,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:49,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:49,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 01:55:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:49,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 01:55:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:49,535 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:49,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:49,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228304229] [2024-11-10 01:55:49,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228304229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:49,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:49,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:49,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423804238] [2024-11-10 01:55:49,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:49,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:49,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:49,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:49,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:49,538 INFO L87 Difference]: Start difference. First operand 550 states and 811 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:49,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:49,818 INFO L93 Difference]: Finished difference Result 998 states and 1470 transitions. [2024-11-10 01:55:49,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:49,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 157 [2024-11-10 01:55:49,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:49,820 INFO L225 Difference]: With dead ends: 998 [2024-11-10 01:55:49,820 INFO L226 Difference]: Without dead ends: 550 [2024-11-10 01:55:49,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:49,822 INFO L432 NwaCegarLoop]: 619 mSDtfsCounter, 783 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:49,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1247 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:55:49,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-10 01:55:49,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2024-11-10 01:55:49,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 545 states have (on average 1.4752293577981652) internal successors, (804), 545 states have internal predecessors, (804), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:49,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 810 transitions. [2024-11-10 01:55:49,829 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 810 transitions. Word has length 157 [2024-11-10 01:55:49,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:49,830 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 810 transitions. [2024-11-10 01:55:49,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:49,830 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 810 transitions. [2024-11-10 01:55:49,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-10 01:55:49,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:49,831 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:49,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 01:55:49,831 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:49,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:49,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1457250156, now seen corresponding path program 1 times [2024-11-10 01:55:49,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:49,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995638926] [2024-11-10 01:55:49,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:49,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:50,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:50,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 01:55:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:50,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 01:55:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:50,169 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:50,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:50,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995638926] [2024-11-10 01:55:50,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995638926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:50,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:50,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:50,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147653746] [2024-11-10 01:55:50,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:50,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:50,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:50,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:50,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:50,171 INFO L87 Difference]: Start difference. First operand 550 states and 810 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:50,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:50,438 INFO L93 Difference]: Finished difference Result 998 states and 1468 transitions. [2024-11-10 01:55:50,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:50,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 158 [2024-11-10 01:55:50,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:50,440 INFO L225 Difference]: With dead ends: 998 [2024-11-10 01:55:50,440 INFO L226 Difference]: Without dead ends: 550 [2024-11-10 01:55:50,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:50,441 INFO L432 NwaCegarLoop]: 619 mSDtfsCounter, 779 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:50,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 1247 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:50,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-10 01:55:50,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2024-11-10 01:55:50,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 545 states have (on average 1.473394495412844) internal successors, (803), 545 states have internal predecessors, (803), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 809 transitions. [2024-11-10 01:55:50,449 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 809 transitions. Word has length 158 [2024-11-10 01:55:50,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:50,450 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 809 transitions. [2024-11-10 01:55:50,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:50,450 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 809 transitions. [2024-11-10 01:55:50,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-10 01:55:50,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:50,451 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:50,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 01:55:50,452 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:50,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:50,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1971317205, now seen corresponding path program 1 times [2024-11-10 01:55:50,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:50,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247101019] [2024-11-10 01:55:50,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:50,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:50,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:50,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 01:55:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:50,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 01:55:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:50,889 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:50,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:50,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247101019] [2024-11-10 01:55:50,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247101019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:50,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:50,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:55:50,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218807204] [2024-11-10 01:55:50,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:50,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:55:50,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:50,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:55:50,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:55:50,893 INFO L87 Difference]: Start difference. First operand 550 states and 809 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:51,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:51,106 INFO L93 Difference]: Finished difference Result 555 states and 814 transitions. [2024-11-10 01:55:51,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:51,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 159 [2024-11-10 01:55:51,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:51,108 INFO L225 Difference]: With dead ends: 555 [2024-11-10 01:55:51,108 INFO L226 Difference]: Without dead ends: 552 [2024-11-10 01:55:51,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:55:51,109 INFO L432 NwaCegarLoop]: 674 mSDtfsCounter, 0 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2017 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:51,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2017 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:51,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-11-10 01:55:51,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-11-10 01:55:51,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4716636197440585) internal successors, (805), 547 states have internal predecessors, (805), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:51,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 811 transitions. [2024-11-10 01:55:51,119 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 811 transitions. Word has length 159 [2024-11-10 01:55:51,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:51,120 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 811 transitions. [2024-11-10 01:55:51,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:51,121 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 811 transitions. [2024-11-10 01:55:51,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-10 01:55:51,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:51,122 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:51,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 01:55:51,122 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:51,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:51,123 INFO L85 PathProgramCache]: Analyzing trace with hash -836237344, now seen corresponding path program 1 times [2024-11-10 01:55:51,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:51,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440882010] [2024-11-10 01:55:51,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:51,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:51,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:51,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 01:55:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:51,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 01:55:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:51,437 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:51,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:51,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440882010] [2024-11-10 01:55:51,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440882010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:51,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:51,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:51,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648228066] [2024-11-10 01:55:51,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:51,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:51,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:51,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:51,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:51,439 INFO L87 Difference]: Start difference. First operand 552 states and 811 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:51,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:51,978 INFO L93 Difference]: Finished difference Result 1373 states and 2016 transitions. [2024-11-10 01:55:51,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:55:51,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 160 [2024-11-10 01:55:51,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:51,980 INFO L225 Difference]: With dead ends: 1373 [2024-11-10 01:55:51,980 INFO L226 Difference]: Without dead ends: 552 [2024-11-10 01:55:51,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:55:51,982 INFO L432 NwaCegarLoop]: 709 mSDtfsCounter, 1583 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1583 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:51,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1583 Valid, 1944 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:55:51,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-11-10 01:55:51,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-11-10 01:55:51,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.469835466179159) internal successors, (804), 547 states have internal predecessors, (804), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:51,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 810 transitions. [2024-11-10 01:55:51,991 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 810 transitions. Word has length 160 [2024-11-10 01:55:51,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:51,992 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 810 transitions. [2024-11-10 01:55:51,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:51,992 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 810 transitions. [2024-11-10 01:55:51,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-10 01:55:51,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:51,993 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:51,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 01:55:51,993 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:51,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:51,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1803535423, now seen corresponding path program 1 times [2024-11-10 01:55:51,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:51,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543225430] [2024-11-10 01:55:51,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:51,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:52,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:52,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 01:55:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:52,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 01:55:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:52,264 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:52,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:52,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543225430] [2024-11-10 01:55:52,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543225430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:52,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:52,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:55:52,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316280130] [2024-11-10 01:55:52,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:52,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:55:52,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:52,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:55:52,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:55:52,266 INFO L87 Difference]: Start difference. First operand 552 states and 810 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:52,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:52,474 INFO L93 Difference]: Finished difference Result 1004 states and 1471 transitions. [2024-11-10 01:55:52,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:52,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 161 [2024-11-10 01:55:52,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:52,476 INFO L225 Difference]: With dead ends: 1004 [2024-11-10 01:55:52,476 INFO L226 Difference]: Without dead ends: 554 [2024-11-10 01:55:52,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:55:52,477 INFO L432 NwaCegarLoop]: 673 mSDtfsCounter, 0 mSDsluCounter, 1338 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2011 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:52,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2011 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:52,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-10 01:55:52,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2024-11-10 01:55:52,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 549 states have (on average 1.4681238615664844) internal successors, (806), 549 states have internal predecessors, (806), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:52,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 812 transitions. [2024-11-10 01:55:52,485 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 812 transitions. Word has length 161 [2024-11-10 01:55:52,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:52,485 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 812 transitions. [2024-11-10 01:55:52,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:52,485 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 812 transitions. [2024-11-10 01:55:52,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 01:55:52,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:52,487 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:52,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 01:55:52,487 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:52,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:52,487 INFO L85 PathProgramCache]: Analyzing trace with hash -177732687, now seen corresponding path program 1 times [2024-11-10 01:55:52,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:52,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256713223] [2024-11-10 01:55:52,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:52,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:52,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:52,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 01:55:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:52,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 01:55:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:52,907 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:52,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:52,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256713223] [2024-11-10 01:55:52,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256713223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:52,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:52,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:55:52,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107323453] [2024-11-10 01:55:52,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:52,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:55:52,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:52,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:55:52,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:55:52,910 INFO L87 Difference]: Start difference. First operand 554 states and 812 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:53,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:53,158 INFO L93 Difference]: Finished difference Result 1006 states and 1472 transitions. [2024-11-10 01:55:53,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:53,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 162 [2024-11-10 01:55:53,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:53,161 INFO L225 Difference]: With dead ends: 1006 [2024-11-10 01:55:53,161 INFO L226 Difference]: Without dead ends: 554 [2024-11-10 01:55:53,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:53,162 INFO L432 NwaCegarLoop]: 641 mSDtfsCounter, 694 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:53,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 1284 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:53,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-10 01:55:53,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2024-11-10 01:55:53,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 549 states have (on average 1.4663023679417122) internal successors, (805), 549 states have internal predecessors, (805), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:53,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 811 transitions. [2024-11-10 01:55:53,170 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 811 transitions. Word has length 162 [2024-11-10 01:55:53,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:53,171 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 811 transitions. [2024-11-10 01:55:53,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:53,171 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 811 transitions. [2024-11-10 01:55:53,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-10 01:55:53,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:53,172 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:53,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 01:55:53,172 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:53,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:53,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1183149618, now seen corresponding path program 1 times [2024-11-10 01:55:53,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:53,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668712070] [2024-11-10 01:55:53,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:53,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:53,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:53,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 01:55:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:53,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 01:55:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:53,484 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:53,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:53,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668712070] [2024-11-10 01:55:53,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668712070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:53,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:53,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:53,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759941849] [2024-11-10 01:55:53,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:53,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:53,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:53,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:53,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:53,487 INFO L87 Difference]: Start difference. First operand 554 states and 811 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:53,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:53,788 INFO L93 Difference]: Finished difference Result 1012 states and 1478 transitions. [2024-11-10 01:55:53,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:55:53,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 163 [2024-11-10 01:55:53,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:53,791 INFO L225 Difference]: With dead ends: 1012 [2024-11-10 01:55:53,791 INFO L226 Difference]: Without dead ends: 554 [2024-11-10 01:55:53,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:55:53,793 INFO L432 NwaCegarLoop]: 666 mSDtfsCounter, 705 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 1977 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:53,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 1977 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:55:53,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-10 01:55:53,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2024-11-10 01:55:53,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 549 states have (on average 1.46448087431694) internal successors, (804), 549 states have internal predecessors, (804), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:53,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 810 transitions. [2024-11-10 01:55:53,805 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 810 transitions. Word has length 163 [2024-11-10 01:55:53,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:53,806 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 810 transitions. [2024-11-10 01:55:53,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:53,806 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 810 transitions. [2024-11-10 01:55:53,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-10 01:55:53,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:53,808 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:53,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 01:55:53,808 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:53,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:53,809 INFO L85 PathProgramCache]: Analyzing trace with hash 167628546, now seen corresponding path program 1 times [2024-11-10 01:55:53,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:53,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158166774] [2024-11-10 01:55:53,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:53,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:54,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:54,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 01:55:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:54,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 01:55:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:54,123 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:54,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:54,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158166774] [2024-11-10 01:55:54,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158166774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:54,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:54,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:54,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329856708] [2024-11-10 01:55:54,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:54,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:54,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:54,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:54,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:54,125 INFO L87 Difference]: Start difference. First operand 554 states and 810 transitions. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:54,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:54,372 INFO L93 Difference]: Finished difference Result 1006 states and 1468 transitions. [2024-11-10 01:55:54,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:54,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 164 [2024-11-10 01:55:54,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:54,374 INFO L225 Difference]: With dead ends: 1006 [2024-11-10 01:55:54,374 INFO L226 Difference]: Without dead ends: 554 [2024-11-10 01:55:54,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:54,375 INFO L432 NwaCegarLoop]: 641 mSDtfsCounter, 794 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:54,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1291 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:54,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-10 01:55:54,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2024-11-10 01:55:54,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 549 states have (on average 1.4626593806921675) internal successors, (803), 549 states have internal predecessors, (803), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:54,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 809 transitions. [2024-11-10 01:55:54,385 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 809 transitions. Word has length 164 [2024-11-10 01:55:54,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:54,386 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 809 transitions. [2024-11-10 01:55:54,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:54,386 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 809 transitions. [2024-11-10 01:55:54,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 01:55:54,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:54,387 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:54,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 01:55:54,387 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:54,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:54,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1965996233, now seen corresponding path program 1 times [2024-11-10 01:55:54,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:54,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714718221] [2024-11-10 01:55:54,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:54,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:54,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:54,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 01:55:54,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:54,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 01:55:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:54,688 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:54,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:54,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714718221] [2024-11-10 01:55:54,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714718221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:54,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:54,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:54,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49189592] [2024-11-10 01:55:54,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:54,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:54,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:54,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:54,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:54,690 INFO L87 Difference]: Start difference. First operand 554 states and 809 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:54,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:54,935 INFO L93 Difference]: Finished difference Result 1006 states and 1466 transitions. [2024-11-10 01:55:54,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:54,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 165 [2024-11-10 01:55:54,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:54,937 INFO L225 Difference]: With dead ends: 1006 [2024-11-10 01:55:54,937 INFO L226 Difference]: Without dead ends: 554 [2024-11-10 01:55:54,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:54,938 INFO L432 NwaCegarLoop]: 641 mSDtfsCounter, 790 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:54,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 1291 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:54,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-10 01:55:54,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2024-11-10 01:55:54,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 549 states have (on average 1.4608378870673953) internal successors, (802), 549 states have internal predecessors, (802), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:54,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 808 transitions. [2024-11-10 01:55:54,947 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 808 transitions. Word has length 165 [2024-11-10 01:55:54,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:54,948 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 808 transitions. [2024-11-10 01:55:54,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:54,948 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 808 transitions. [2024-11-10 01:55:54,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-10 01:55:54,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:54,949 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:54,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 01:55:54,950 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:54,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:54,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1915392487, now seen corresponding path program 1 times [2024-11-10 01:55:54,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:54,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100315439] [2024-11-10 01:55:54,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:54,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:55,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:55,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 01:55:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:55,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 01:55:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:55,290 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:55,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:55,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100315439] [2024-11-10 01:55:55,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100315439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:55,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:55,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:55:55,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993388974] [2024-11-10 01:55:55,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:55,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:55:55,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:55,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:55:55,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:55:55,294 INFO L87 Difference]: Start difference. First operand 554 states and 808 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:55,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:55,493 INFO L93 Difference]: Finished difference Result 1005 states and 1463 transitions. [2024-11-10 01:55:55,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:55,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 166 [2024-11-10 01:55:55,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:55,495 INFO L225 Difference]: With dead ends: 1005 [2024-11-10 01:55:55,495 INFO L226 Difference]: Without dead ends: 553 [2024-11-10 01:55:55,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:55,496 INFO L432 NwaCegarLoop]: 653 mSDtfsCounter, 695 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:55,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 1308 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:55,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-10 01:55:55,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2024-11-10 01:55:55,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4580291970802919) internal successors, (799), 548 states have internal predecessors, (799), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 805 transitions. [2024-11-10 01:55:55,506 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 805 transitions. Word has length 166 [2024-11-10 01:55:55,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:55,506 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 805 transitions. [2024-11-10 01:55:55,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:55,506 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 805 transitions. [2024-11-10 01:55:55,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-10 01:55:55,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:55,508 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:55,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 01:55:55,508 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:55,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:55,508 INFO L85 PathProgramCache]: Analyzing trace with hash -143858948, now seen corresponding path program 1 times [2024-11-10 01:55:55,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:55,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432812245] [2024-11-10 01:55:55,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:55,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:55,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:55,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 01:55:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:55,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 01:55:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:55,783 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:55,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:55,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432812245] [2024-11-10 01:55:55,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432812245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:55,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:55,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:55,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468579225] [2024-11-10 01:55:55,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:55,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:55,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:55,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:55,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:55,785 INFO L87 Difference]: Start difference. First operand 553 states and 805 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:56,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:56,028 INFO L93 Difference]: Finished difference Result 1006 states and 1460 transitions. [2024-11-10 01:55:56,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:55:56,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 167 [2024-11-10 01:55:56,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:56,030 INFO L225 Difference]: With dead ends: 1006 [2024-11-10 01:55:56,030 INFO L226 Difference]: Without dead ends: 553 [2024-11-10 01:55:56,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:55:56,031 INFO L432 NwaCegarLoop]: 663 mSDtfsCounter, 699 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1983 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:56,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1983 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:56,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-10 01:55:56,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2024-11-10 01:55:56,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4562043795620438) internal successors, (798), 548 states have internal predecessors, (798), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:56,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 804 transitions. [2024-11-10 01:55:56,039 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 804 transitions. Word has length 167 [2024-11-10 01:55:56,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:56,040 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 804 transitions. [2024-11-10 01:55:56,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:56,040 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 804 transitions. [2024-11-10 01:55:56,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-10 01:55:56,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:56,041 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:56,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 01:55:56,042 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:56,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:56,042 INFO L85 PathProgramCache]: Analyzing trace with hash 903810, now seen corresponding path program 1 times [2024-11-10 01:55:56,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:56,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151856298] [2024-11-10 01:55:56,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:56,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:56,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:56,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 01:55:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:56,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 01:55:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:56,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:56,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151856298] [2024-11-10 01:55:56,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151856298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:56,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:56,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:55:56,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320991790] [2024-11-10 01:55:56,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:56,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:55:56,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:56,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:55:56,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:55:56,448 INFO L87 Difference]: Start difference. First operand 553 states and 804 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 01:55:56,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:56,666 INFO L93 Difference]: Finished difference Result 1004 states and 1456 transitions. [2024-11-10 01:55:56,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:56,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 168 [2024-11-10 01:55:56,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:56,668 INFO L225 Difference]: With dead ends: 1004 [2024-11-10 01:55:56,668 INFO L226 Difference]: Without dead ends: 553 [2024-11-10 01:55:56,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:56,669 INFO L432 NwaCegarLoop]: 655 mSDtfsCounter, 733 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:56,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 1312 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:56,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-10 01:55:56,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2024-11-10 01:55:56,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4543795620437956) internal successors, (797), 548 states have internal predecessors, (797), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:56,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 803 transitions. [2024-11-10 01:55:56,677 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 803 transitions. Word has length 168 [2024-11-10 01:55:56,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:56,677 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 803 transitions. [2024-11-10 01:55:56,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 01:55:56,678 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 803 transitions. [2024-11-10 01:55:56,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-10 01:55:56,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:56,679 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:56,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 01:55:56,679 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:56,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:56,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1233910747, now seen corresponding path program 1 times [2024-11-10 01:55:56,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:56,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223237027] [2024-11-10 01:55:56,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:56,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:57,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:57,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 01:55:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:57,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 01:55:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:57,046 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:57,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:57,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223237027] [2024-11-10 01:55:57,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223237027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:57,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:57,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:55:57,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111626789] [2024-11-10 01:55:57,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:57,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:55:57,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:57,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:55:57,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:55:57,048 INFO L87 Difference]: Start difference. First operand 553 states and 803 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 01:55:57,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:57,272 INFO L93 Difference]: Finished difference Result 1004 states and 1454 transitions. [2024-11-10 01:55:57,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:57,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 169 [2024-11-10 01:55:57,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:57,275 INFO L225 Difference]: With dead ends: 1004 [2024-11-10 01:55:57,275 INFO L226 Difference]: Without dead ends: 553 [2024-11-10 01:55:57,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:57,276 INFO L432 NwaCegarLoop]: 655 mSDtfsCounter, 731 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:57,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 1312 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:57,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-10 01:55:57,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2024-11-10 01:55:57,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4525547445255473) internal successors, (796), 548 states have internal predecessors, (796), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:57,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 802 transitions. [2024-11-10 01:55:57,291 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 802 transitions. Word has length 169 [2024-11-10 01:55:57,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:57,291 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 802 transitions. [2024-11-10 01:55:57,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 01:55:57,293 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 802 transitions. [2024-11-10 01:55:57,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-10 01:55:57,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:57,294 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:57,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 01:55:57,294 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:57,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:57,295 INFO L85 PathProgramCache]: Analyzing trace with hash -186834965, now seen corresponding path program 1 times [2024-11-10 01:55:57,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:57,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659697749] [2024-11-10 01:55:57,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:57,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:57,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:57,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:55:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:57,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:55:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:57,938 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:57,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:57,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659697749] [2024-11-10 01:55:57,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659697749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:57,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:57,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:57,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225113688] [2024-11-10 01:55:57,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:57,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:57,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:57,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:57,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:57,941 INFO L87 Difference]: Start difference. First operand 553 states and 802 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:58,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:58,336 INFO L93 Difference]: Finished difference Result 1010 states and 1460 transitions. [2024-11-10 01:55:58,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:55:58,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 170 [2024-11-10 01:55:58,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:58,339 INFO L225 Difference]: With dead ends: 1010 [2024-11-10 01:55:58,339 INFO L226 Difference]: Without dead ends: 557 [2024-11-10 01:55:58,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-11-10 01:55:58,341 INFO L432 NwaCegarLoop]: 661 mSDtfsCounter, 2 mSDsluCounter, 1828 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2489 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:58,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2489 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:55:58,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-10 01:55:58,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 555. [2024-11-10 01:55:58,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 550 states have (on average 1.450909090909091) internal successors, (798), 550 states have internal predecessors, (798), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:58,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 804 transitions. [2024-11-10 01:55:58,353 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 804 transitions. Word has length 170 [2024-11-10 01:55:58,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:58,353 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 804 transitions. [2024-11-10 01:55:58,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:58,353 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 804 transitions. [2024-11-10 01:55:58,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-10 01:55:58,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:58,355 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:58,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 01:55:58,356 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:58,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:58,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1847886509, now seen corresponding path program 1 times [2024-11-10 01:55:58,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:58,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348755063] [2024-11-10 01:55:58,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:58,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:58,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:58,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:55:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:58,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:55:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:58,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:58,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348755063] [2024-11-10 01:55:58,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348755063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:58,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:58,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:58,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106992353] [2024-11-10 01:55:58,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:58,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:58,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:58,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:58,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:58,742 INFO L87 Difference]: Start difference. First operand 555 states and 804 transitions. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:59,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:59,087 INFO L93 Difference]: Finished difference Result 1008 states and 1456 transitions. [2024-11-10 01:55:59,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:59,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 171 [2024-11-10 01:55:59,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:59,089 INFO L225 Difference]: With dead ends: 1008 [2024-11-10 01:55:59,089 INFO L226 Difference]: Without dead ends: 555 [2024-11-10 01:55:59,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:59,091 INFO L432 NwaCegarLoop]: 609 mSDtfsCounter, 673 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 1824 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:59,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 1824 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:55:59,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-10 01:55:59,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2024-11-10 01:55:59,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 550 states have (on average 1.449090909090909) internal successors, (797), 550 states have internal predecessors, (797), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:59,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 803 transitions. [2024-11-10 01:55:59,101 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 803 transitions. Word has length 171 [2024-11-10 01:55:59,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:59,101 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 803 transitions. [2024-11-10 01:55:59,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:59,101 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 803 transitions. [2024-11-10 01:55:59,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-10 01:55:59,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:59,102 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:59,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 01:55:59,103 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:59,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:59,103 INFO L85 PathProgramCache]: Analyzing trace with hash -920111317, now seen corresponding path program 1 times [2024-11-10 01:55:59,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:59,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238464973] [2024-11-10 01:55:59,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:59,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:59,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:59,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:55:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:59,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:55:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:59,471 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:59,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:59,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238464973] [2024-11-10 01:55:59,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238464973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:59,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:59,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:59,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813108016] [2024-11-10 01:55:59,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:59,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:59,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:59,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:59,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:59,473 INFO L87 Difference]: Start difference. First operand 555 states and 803 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:59,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:59,789 INFO L93 Difference]: Finished difference Result 1008 states and 1454 transitions. [2024-11-10 01:55:59,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:59,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 172 [2024-11-10 01:55:59,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:59,791 INFO L225 Difference]: With dead ends: 1008 [2024-11-10 01:55:59,791 INFO L226 Difference]: Without dead ends: 555 [2024-11-10 01:55:59,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:59,793 INFO L432 NwaCegarLoop]: 609 mSDtfsCounter, 670 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:59,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 1227 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:55:59,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-10 01:55:59,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2024-11-10 01:55:59,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 550 states have (on average 1.4472727272727273) internal successors, (796), 550 states have internal predecessors, (796), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:59,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 802 transitions. [2024-11-10 01:55:59,805 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 802 transitions. Word has length 172 [2024-11-10 01:55:59,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:59,805 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 802 transitions. [2024-11-10 01:55:59,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:59,805 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 802 transitions. [2024-11-10 01:55:59,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-10 01:55:59,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:59,806 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:59,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 01:55:59,806 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:59,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:59,807 INFO L85 PathProgramCache]: Analyzing trace with hash -537055903, now seen corresponding path program 1 times [2024-11-10 01:55:59,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:59,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821159544] [2024-11-10 01:55:59,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:59,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:00,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:00,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:00,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:00,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:00,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821159544] [2024-11-10 01:56:00,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821159544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:00,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:00,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:00,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985864304] [2024-11-10 01:56:00,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:00,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:00,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:00,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:00,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:00,153 INFO L87 Difference]: Start difference. First operand 555 states and 802 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:00,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:00,457 INFO L93 Difference]: Finished difference Result 1008 states and 1452 transitions. [2024-11-10 01:56:00,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:00,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 173 [2024-11-10 01:56:00,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:00,459 INFO L225 Difference]: With dead ends: 1008 [2024-11-10 01:56:00,459 INFO L226 Difference]: Without dead ends: 555 [2024-11-10 01:56:00,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:00,460 INFO L432 NwaCegarLoop]: 609 mSDtfsCounter, 1330 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1330 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:00,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1330 Valid, 1220 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:56:00,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-10 01:56:00,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2024-11-10 01:56:00,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 550 states have (on average 1.4454545454545455) internal successors, (795), 550 states have internal predecessors, (795), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:56:00,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 801 transitions. [2024-11-10 01:56:00,468 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 801 transitions. Word has length 173 [2024-11-10 01:56:00,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:00,468 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 801 transitions. [2024-11-10 01:56:00,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:00,468 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 801 transitions. [2024-11-10 01:56:00,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-10 01:56:00,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:00,469 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:00,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 01:56:00,469 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:00,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:00,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1720800400, now seen corresponding path program 1 times [2024-11-10 01:56:00,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:00,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134731662] [2024-11-10 01:56:00,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:00,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:00,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:00,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:00,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:00,816 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:00,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:00,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134731662] [2024-11-10 01:56:00,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134731662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:00,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:00,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:00,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244452391] [2024-11-10 01:56:00,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:00,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:00,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:00,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:00,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:00,818 INFO L87 Difference]: Start difference. First operand 555 states and 801 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:01,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:01,118 INFO L93 Difference]: Finished difference Result 1008 states and 1450 transitions. [2024-11-10 01:56:01,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:01,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 174 [2024-11-10 01:56:01,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:01,120 INFO L225 Difference]: With dead ends: 1008 [2024-11-10 01:56:01,120 INFO L226 Difference]: Without dead ends: 555 [2024-11-10 01:56:01,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:01,121 INFO L432 NwaCegarLoop]: 609 mSDtfsCounter, 1324 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1324 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:01,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1324 Valid, 1220 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:56:01,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-10 01:56:01,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2024-11-10 01:56:01,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 550 states have (on average 1.4436363636363636) internal successors, (794), 550 states have internal predecessors, (794), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:56:01,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 800 transitions. [2024-11-10 01:56:01,132 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 800 transitions. Word has length 174 [2024-11-10 01:56:01,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:01,133 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 800 transitions. [2024-11-10 01:56:01,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:01,133 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 800 transitions. [2024-11-10 01:56:01,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-10 01:56:01,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:01,134 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:01,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 01:56:01,134 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:01,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:01,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1055962433, now seen corresponding path program 1 times [2024-11-10 01:56:01,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:01,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814264940] [2024-11-10 01:56:01,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:01,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:01,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:01,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:01,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:01,487 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:01,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:01,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814264940] [2024-11-10 01:56:01,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814264940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:01,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:01,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:01,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749369394] [2024-11-10 01:56:01,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:01,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:01,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:01,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:01,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:01,490 INFO L87 Difference]: Start difference. First operand 555 states and 800 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:01,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:01,768 INFO L93 Difference]: Finished difference Result 1008 states and 1448 transitions. [2024-11-10 01:56:01,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:01,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 175 [2024-11-10 01:56:01,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:01,775 INFO L225 Difference]: With dead ends: 1008 [2024-11-10 01:56:01,775 INFO L226 Difference]: Without dead ends: 555 [2024-11-10 01:56:01,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:01,776 INFO L432 NwaCegarLoop]: 609 mSDtfsCounter, 1314 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:01,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1314 Valid, 1220 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:01,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-10 01:56:01,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2024-11-10 01:56:01,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 550 states have (on average 1.4418181818181819) internal successors, (793), 550 states have internal predecessors, (793), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:56:01,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 799 transitions. [2024-11-10 01:56:01,787 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 799 transitions. Word has length 175 [2024-11-10 01:56:01,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:01,787 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 799 transitions. [2024-11-10 01:56:01,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:01,787 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 799 transitions. [2024-11-10 01:56:01,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-10 01:56:01,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:01,788 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:01,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 01:56:01,789 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:01,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:01,789 INFO L85 PathProgramCache]: Analyzing trace with hash -318887595, now seen corresponding path program 1 times [2024-11-10 01:56:01,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:01,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900437941] [2024-11-10 01:56:01,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:01,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:02,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:02,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:02,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:02,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:02,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900437941] [2024-11-10 01:56:02,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900437941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:02,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:02,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:02,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421276221] [2024-11-10 01:56:02,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:02,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:02,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:02,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:02,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:02,217 INFO L87 Difference]: Start difference. First operand 555 states and 799 transitions. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:02,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:02,487 INFO L93 Difference]: Finished difference Result 1008 states and 1446 transitions. [2024-11-10 01:56:02,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:02,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 176 [2024-11-10 01:56:02,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:02,490 INFO L225 Difference]: With dead ends: 1008 [2024-11-10 01:56:02,490 INFO L226 Difference]: Without dead ends: 555 [2024-11-10 01:56:02,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:02,491 INFO L432 NwaCegarLoop]: 609 mSDtfsCounter, 1308 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1308 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:02,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1308 Valid, 1220 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:02,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-10 01:56:02,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2024-11-10 01:56:02,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 550 states have (on average 1.44) internal successors, (792), 550 states have internal predecessors, (792), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:56:02,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 798 transitions. [2024-11-10 01:56:02,499 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 798 transitions. Word has length 176 [2024-11-10 01:56:02,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:02,500 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 798 transitions. [2024-11-10 01:56:02,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:02,500 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 798 transitions. [2024-11-10 01:56:02,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 01:56:02,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:02,501 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:02,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 01:56:02,501 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:02,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:02,501 INFO L85 PathProgramCache]: Analyzing trace with hash -440231902, now seen corresponding path program 1 times [2024-11-10 01:56:02,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:02,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621856963] [2024-11-10 01:56:02,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:02,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:02,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:02,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:02,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:02,801 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:02,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:02,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621856963] [2024-11-10 01:56:02,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621856963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:02,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:02,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:56:02,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895687725] [2024-11-10 01:56:02,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:02,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:56:02,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:02,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:56:02,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:56:02,803 INFO L87 Difference]: Start difference. First operand 555 states and 798 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:03,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:03,006 INFO L93 Difference]: Finished difference Result 1008 states and 1444 transitions. [2024-11-10 01:56:03,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:03,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 177 [2024-11-10 01:56:03,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:03,008 INFO L225 Difference]: With dead ends: 1008 [2024-11-10 01:56:03,008 INFO L226 Difference]: Without dead ends: 555 [2024-11-10 01:56:03,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:03,009 INFO L432 NwaCegarLoop]: 645 mSDtfsCounter, 684 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:03,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1292 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:03,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-10 01:56:03,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2024-11-10 01:56:03,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 550 states have (on average 1.4381818181818182) internal successors, (791), 550 states have internal predecessors, (791), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:56:03,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 797 transitions. [2024-11-10 01:56:03,018 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 797 transitions. Word has length 177 [2024-11-10 01:56:03,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:03,018 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 797 transitions. [2024-11-10 01:56:03,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:03,019 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 797 transitions. [2024-11-10 01:56:03,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-10 01:56:03,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:03,019 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:03,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 01:56:03,020 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:03,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:03,020 INFO L85 PathProgramCache]: Analyzing trace with hash -881471005, now seen corresponding path program 1 times [2024-11-10 01:56:03,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:03,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796281674] [2024-11-10 01:56:03,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:03,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:03,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:03,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:03,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:03,314 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:03,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:03,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796281674] [2024-11-10 01:56:03,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796281674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:03,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:03,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:56:03,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090137842] [2024-11-10 01:56:03,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:03,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:56:03,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:03,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:56:03,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:56:03,316 INFO L87 Difference]: Start difference. First operand 555 states and 797 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:03,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:03,538 INFO L93 Difference]: Finished difference Result 1008 states and 1442 transitions. [2024-11-10 01:56:03,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:03,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 178 [2024-11-10 01:56:03,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:03,543 INFO L225 Difference]: With dead ends: 1008 [2024-11-10 01:56:03,544 INFO L226 Difference]: Without dead ends: 555 [2024-11-10 01:56:03,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:03,548 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 676 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:03,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1260 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:03,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-10 01:56:03,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2024-11-10 01:56:03,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 550 states have (on average 1.4363636363636363) internal successors, (790), 550 states have internal predecessors, (790), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:56:03,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 796 transitions. [2024-11-10 01:56:03,559 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 796 transitions. Word has length 178 [2024-11-10 01:56:03,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:03,559 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 796 transitions. [2024-11-10 01:56:03,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:03,559 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 796 transitions. [2024-11-10 01:56:03,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-10 01:56:03,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:03,560 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:03,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 01:56:03,560 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:03,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:03,560 INFO L85 PathProgramCache]: Analyzing trace with hash 634038681, now seen corresponding path program 1 times [2024-11-10 01:56:03,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:03,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81416207] [2024-11-10 01:56:03,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:03,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:03,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:03,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:03,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:03,901 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:03,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:03,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81416207] [2024-11-10 01:56:03,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81416207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:03,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:03,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:03,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254139773] [2024-11-10 01:56:03,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:03,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:03,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:03,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:03,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:03,903 INFO L87 Difference]: Start difference. First operand 555 states and 796 transitions. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:04,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:04,134 INFO L93 Difference]: Finished difference Result 1008 states and 1440 transitions. [2024-11-10 01:56:04,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:04,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 179 [2024-11-10 01:56:04,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:04,136 INFO L225 Difference]: With dead ends: 1008 [2024-11-10 01:56:04,137 INFO L226 Difference]: Without dead ends: 555 [2024-11-10 01:56:04,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:04,137 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 674 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:04,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1267 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:04,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-10 01:56:04,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2024-11-10 01:56:04,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 550 states have (on average 1.4345454545454546) internal successors, (789), 550 states have internal predecessors, (789), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:56:04,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 795 transitions. [2024-11-10 01:56:04,146 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 795 transitions. Word has length 179 [2024-11-10 01:56:04,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:04,146 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 795 transitions. [2024-11-10 01:56:04,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:04,147 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 795 transitions. [2024-11-10 01:56:04,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-10 01:56:04,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:04,147 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:04,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 01:56:04,147 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:04,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:04,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1661520297, now seen corresponding path program 1 times [2024-11-10 01:56:04,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:04,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186536201] [2024-11-10 01:56:04,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:04,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:04,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:04,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:04,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:04,597 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:04,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:04,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186536201] [2024-11-10 01:56:04,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186536201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:04,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:04,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:04,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569733221] [2024-11-10 01:56:04,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:04,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:04,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:04,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:04,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:04,598 INFO L87 Difference]: Start difference. First operand 555 states and 795 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:04,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:04,835 INFO L93 Difference]: Finished difference Result 1008 states and 1438 transitions. [2024-11-10 01:56:04,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:04,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 180 [2024-11-10 01:56:04,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:04,839 INFO L225 Difference]: With dead ends: 1008 [2024-11-10 01:56:04,839 INFO L226 Difference]: Without dead ends: 555 [2024-11-10 01:56:04,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:04,840 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 1338 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1338 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:04,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1338 Valid, 1260 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:04,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-10 01:56:04,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2024-11-10 01:56:04,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 550 states have (on average 1.4327272727272726) internal successors, (788), 550 states have internal predecessors, (788), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:56:04,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 794 transitions. [2024-11-10 01:56:04,848 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 794 transitions. Word has length 180 [2024-11-10 01:56:04,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:04,849 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 794 transitions. [2024-11-10 01:56:04,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:04,849 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 794 transitions. [2024-11-10 01:56:04,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-10 01:56:04,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:04,850 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:04,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 01:56:04,850 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:04,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:04,850 INFO L85 PathProgramCache]: Analyzing trace with hash -762192146, now seen corresponding path program 1 times [2024-11-10 01:56:04,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:04,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249391720] [2024-11-10 01:56:04,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:04,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:05,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:05,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:05,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:05,400 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:05,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:05,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249391720] [2024-11-10 01:56:05,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249391720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:05,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:05,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:05,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240642427] [2024-11-10 01:56:05,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:05,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:05,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:05,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:05,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:05,406 INFO L87 Difference]: Start difference. First operand 555 states and 794 transitions. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:05,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:05,798 INFO L93 Difference]: Finished difference Result 1010 states and 1439 transitions. [2024-11-10 01:56:05,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:56:05,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 181 [2024-11-10 01:56:05,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:05,800 INFO L225 Difference]: With dead ends: 1010 [2024-11-10 01:56:05,800 INFO L226 Difference]: Without dead ends: 557 [2024-11-10 01:56:05,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:05,801 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 689 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:05,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 1492 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:56:05,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-10 01:56:05,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 556. [2024-11-10 01:56:05,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.4319419237749547) internal successors, (789), 551 states have internal predecessors, (789), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:56:05,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 795 transitions. [2024-11-10 01:56:05,813 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 795 transitions. Word has length 181 [2024-11-10 01:56:05,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:05,813 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 795 transitions. [2024-11-10 01:56:05,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:05,814 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 795 transitions. [2024-11-10 01:56:05,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-10 01:56:05,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:05,814 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:05,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-10 01:56:05,815 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:05,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:05,815 INFO L85 PathProgramCache]: Analyzing trace with hash -2080535511, now seen corresponding path program 1 times [2024-11-10 01:56:05,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:05,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505523477] [2024-11-10 01:56:05,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:05,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:06,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:06,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:06,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:06,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:06,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505523477] [2024-11-10 01:56:06,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505523477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:06,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:06,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:56:06,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28884476] [2024-11-10 01:56:06,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:06,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:56:06,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:06,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:56:06,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:06,363 INFO L87 Difference]: Start difference. First operand 556 states and 795 transitions. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:06,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:06,884 INFO L93 Difference]: Finished difference Result 1078 states and 1511 transitions. [2024-11-10 01:56:06,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:56:06,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 181 [2024-11-10 01:56:06,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:06,886 INFO L225 Difference]: With dead ends: 1078 [2024-11-10 01:56:06,886 INFO L226 Difference]: Without dead ends: 620 [2024-11-10 01:56:06,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:56:06,887 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 71 mSDsluCounter, 2521 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 3204 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:06,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 3204 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:56:06,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-10 01:56:06,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 556. [2024-11-10 01:56:06,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.4301270417422867) internal successors, (788), 551 states have internal predecessors, (788), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:56:06,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 794 transitions. [2024-11-10 01:56:06,899 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 794 transitions. Word has length 181 [2024-11-10 01:56:06,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:06,899 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 794 transitions. [2024-11-10 01:56:06,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:06,900 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 794 transitions. [2024-11-10 01:56:06,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-10 01:56:06,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:06,901 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:06,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-10 01:56:06,901 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:06,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:06,901 INFO L85 PathProgramCache]: Analyzing trace with hash 222844443, now seen corresponding path program 1 times [2024-11-10 01:56:06,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:06,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546165506] [2024-11-10 01:56:06,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:06,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:07,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:07,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:07,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:07,618 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:07,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:07,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546165506] [2024-11-10 01:56:07,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546165506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:07,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:07,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 01:56:07,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334927827] [2024-11-10 01:56:07,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:07,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 01:56:07,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:07,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 01:56:07,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:56:07,620 INFO L87 Difference]: Start difference. First operand 556 states and 794 transitions. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:08,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:08,093 INFO L93 Difference]: Finished difference Result 1164 states and 1636 transitions. [2024-11-10 01:56:08,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:56:08,094 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 182 [2024-11-10 01:56:08,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:08,096 INFO L225 Difference]: With dead ends: 1164 [2024-11-10 01:56:08,096 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 01:56:08,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:56:08,097 INFO L432 NwaCegarLoop]: 643 mSDtfsCounter, 1127 mSDsluCounter, 2562 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 3205 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:08,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 3205 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:56:08,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 01:56:08,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-10 01:56:08,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 702 states have (on average 1.3974358974358974) internal successors, (981), 702 states have internal predecessors, (981), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:08,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 993 transitions. [2024-11-10 01:56:08,112 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 993 transitions. Word has length 182 [2024-11-10 01:56:08,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:08,113 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 993 transitions. [2024-11-10 01:56:08,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:08,113 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 993 transitions. [2024-11-10 01:56:08,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2024-11-10 01:56:08,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:08,115 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:08,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-10 01:56:08,116 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:08,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:08,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1085920029, now seen corresponding path program 1 times [2024-11-10 01:56:08,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:08,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445812968] [2024-11-10 01:56:08,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:08,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:08,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:08,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:08,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:08,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2024-11-10 01:56:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:08,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2024-11-10 01:56:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:08,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2024-11-10 01:56:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:08,764 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:08,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:08,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445812968] [2024-11-10 01:56:08,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445812968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:08,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:08,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:08,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565368595] [2024-11-10 01:56:08,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:08,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:08,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:08,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:08,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:08,766 INFO L87 Difference]: Start difference. First operand 710 states and 993 transitions. Second operand has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:09,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:09,035 INFO L93 Difference]: Finished difference Result 1164 states and 1635 transitions. [2024-11-10 01:56:09,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:09,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 449 [2024-11-10 01:56:09,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:09,038 INFO L225 Difference]: With dead ends: 1164 [2024-11-10 01:56:09,038 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 01:56:09,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:09,039 INFO L432 NwaCegarLoop]: 604 mSDtfsCounter, 1323 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:09,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 1210 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:09,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 01:56:09,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-10 01:56:09,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 702 states have (on average 1.396011396011396) internal successors, (980), 702 states have internal predecessors, (980), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:09,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 992 transitions. [2024-11-10 01:56:09,054 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 992 transitions. Word has length 449 [2024-11-10 01:56:09,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:09,055 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 992 transitions. [2024-11-10 01:56:09,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:09,055 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 992 transitions. [2024-11-10 01:56:09,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2024-11-10 01:56:09,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:09,058 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:09,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-10 01:56:09,058 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:09,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:09,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1319576289, now seen corresponding path program 1 times [2024-11-10 01:56:09,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:09,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051490452] [2024-11-10 01:56:09,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:09,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:09,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:09,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:09,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:09,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2024-11-10 01:56:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:09,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2024-11-10 01:56:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:09,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2024-11-10 01:56:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:09,805 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:09,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:09,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051490452] [2024-11-10 01:56:09,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051490452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:09,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:09,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:09,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845372777] [2024-11-10 01:56:09,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:09,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:09,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:09,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:09,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:09,808 INFO L87 Difference]: Start difference. First operand 710 states and 992 transitions. Second operand has 5 states, 5 states have (on average 84.6) internal successors, (423), 5 states have internal predecessors, (423), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:10,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:10,060 INFO L93 Difference]: Finished difference Result 1164 states and 1633 transitions. [2024-11-10 01:56:10,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:10,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 84.6) internal successors, (423), 5 states have internal predecessors, (423), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 450 [2024-11-10 01:56:10,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:10,062 INFO L225 Difference]: With dead ends: 1164 [2024-11-10 01:56:10,063 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 01:56:10,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:10,064 INFO L432 NwaCegarLoop]: 604 mSDtfsCounter, 715 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:10,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 1217 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:10,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 01:56:10,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-10 01:56:10,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 702 states have (on average 1.3945868945868947) internal successors, (979), 702 states have internal predecessors, (979), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:10,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 991 transitions. [2024-11-10 01:56:10,081 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 991 transitions. Word has length 450 [2024-11-10 01:56:10,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:10,082 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 991 transitions. [2024-11-10 01:56:10,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.6) internal successors, (423), 5 states have internal predecessors, (423), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:10,082 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 991 transitions. [2024-11-10 01:56:10,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2024-11-10 01:56:10,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:10,084 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:10,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-10 01:56:10,084 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:10,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:10,085 INFO L85 PathProgramCache]: Analyzing trace with hash 2035853236, now seen corresponding path program 1 times [2024-11-10 01:56:10,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:10,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262821461] [2024-11-10 01:56:10,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:10,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:10,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:10,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:10,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:10,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2024-11-10 01:56:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:10,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2024-11-10 01:56:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:10,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-11-10 01:56:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:10,664 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:10,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:10,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262821461] [2024-11-10 01:56:10,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262821461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:10,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:10,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:10,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681494138] [2024-11-10 01:56:10,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:10,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:10,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:10,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:10,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:10,666 INFO L87 Difference]: Start difference. First operand 710 states and 991 transitions. Second operand has 5 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:10,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:10,921 INFO L93 Difference]: Finished difference Result 1164 states and 1631 transitions. [2024-11-10 01:56:10,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:10,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 451 [2024-11-10 01:56:10,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:10,924 INFO L225 Difference]: With dead ends: 1164 [2024-11-10 01:56:10,924 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 01:56:10,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:10,925 INFO L432 NwaCegarLoop]: 604 mSDtfsCounter, 1291 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:10,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1294 Valid, 1210 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:10,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 01:56:10,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-10 01:56:10,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 702 states have (on average 1.393162393162393) internal successors, (978), 702 states have internal predecessors, (978), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:10,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 990 transitions. [2024-11-10 01:56:10,936 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 990 transitions. Word has length 451 [2024-11-10 01:56:10,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:10,937 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 990 transitions. [2024-11-10 01:56:10,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:10,937 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 990 transitions. [2024-11-10 01:56:10,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2024-11-10 01:56:10,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:10,939 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:10,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-10 01:56:10,939 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:10,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:10,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1991596306, now seen corresponding path program 1 times [2024-11-10 01:56:10,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:10,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16552100] [2024-11-10 01:56:10,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:10,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:11,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:11,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:11,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:11,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-11-10 01:56:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:11,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2024-11-10 01:56:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:11,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-11-10 01:56:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:11,638 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:11,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:11,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16552100] [2024-11-10 01:56:11,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16552100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:11,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:11,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:11,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224162227] [2024-11-10 01:56:11,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:11,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:11,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:11,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:11,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:11,640 INFO L87 Difference]: Start difference. First operand 710 states and 990 transitions. Second operand has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:11,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:11,857 INFO L93 Difference]: Finished difference Result 1164 states and 1629 transitions. [2024-11-10 01:56:11,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:11,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 452 [2024-11-10 01:56:11,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:11,860 INFO L225 Difference]: With dead ends: 1164 [2024-11-10 01:56:11,860 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 01:56:11,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:11,861 INFO L432 NwaCegarLoop]: 604 mSDtfsCounter, 1275 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:11,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1278 Valid, 1210 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:11,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 01:56:11,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-10 01:56:11,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 702 states have (on average 1.3917378917378918) internal successors, (977), 702 states have internal predecessors, (977), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:11,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 989 transitions. [2024-11-10 01:56:11,875 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 989 transitions. Word has length 452 [2024-11-10 01:56:11,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:11,875 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 989 transitions. [2024-11-10 01:56:11,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:11,876 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 989 transitions. [2024-11-10 01:56:11,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2024-11-10 01:56:11,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:11,879 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:11,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-10 01:56:11,879 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:11,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:11,879 INFO L85 PathProgramCache]: Analyzing trace with hash 618520581, now seen corresponding path program 1 times [2024-11-10 01:56:11,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:11,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106094189] [2024-11-10 01:56:11,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:11,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:12,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:12,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:12,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:12,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2024-11-10 01:56:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:12,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2024-11-10 01:56:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:12,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-11-10 01:56:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:12,469 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:12,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:12,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106094189] [2024-11-10 01:56:12,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106094189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:12,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:12,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:12,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740016978] [2024-11-10 01:56:12,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:12,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:12,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:12,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:12,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:12,471 INFO L87 Difference]: Start difference. First operand 710 states and 989 transitions. Second operand has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:12,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:12,698 INFO L93 Difference]: Finished difference Result 1164 states and 1627 transitions. [2024-11-10 01:56:12,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:12,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 453 [2024-11-10 01:56:12,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:12,700 INFO L225 Difference]: With dead ends: 1164 [2024-11-10 01:56:12,701 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 01:56:12,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:12,701 INFO L432 NwaCegarLoop]: 604 mSDtfsCounter, 1259 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:12,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 1210 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:12,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 01:56:12,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-10 01:56:12,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 702 states have (on average 1.3903133903133904) internal successors, (976), 702 states have internal predecessors, (976), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:12,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 988 transitions. [2024-11-10 01:56:12,712 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 988 transitions. Word has length 453 [2024-11-10 01:56:12,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:12,713 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 988 transitions. [2024-11-10 01:56:12,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:12,713 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 988 transitions. [2024-11-10 01:56:12,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2024-11-10 01:56:12,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:12,715 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:12,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-10 01:56:12,715 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:12,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:12,715 INFO L85 PathProgramCache]: Analyzing trace with hash -321239869, now seen corresponding path program 1 times [2024-11-10 01:56:12,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:12,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524392000] [2024-11-10 01:56:12,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:12,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:13,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:13,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:13,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:13,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2024-11-10 01:56:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:13,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2024-11-10 01:56:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:13,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2024-11-10 01:56:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:13,327 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:13,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:13,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524392000] [2024-11-10 01:56:13,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524392000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:13,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:13,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:13,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727760640] [2024-11-10 01:56:13,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:13,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:13,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:13,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:13,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:13,329 INFO L87 Difference]: Start difference. First operand 710 states and 988 transitions. Second operand has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:13,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:13,545 INFO L93 Difference]: Finished difference Result 1164 states and 1625 transitions. [2024-11-10 01:56:13,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:13,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 454 [2024-11-10 01:56:13,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:13,547 INFO L225 Difference]: With dead ends: 1164 [2024-11-10 01:56:13,547 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 01:56:13,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:13,548 INFO L432 NwaCegarLoop]: 604 mSDtfsCounter, 1243 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:13,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 1210 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:13,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 01:56:13,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-10 01:56:13,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 702 states have (on average 1.3888888888888888) internal successors, (975), 702 states have internal predecessors, (975), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:13,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 987 transitions. [2024-11-10 01:56:13,558 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 987 transitions. Word has length 454 [2024-11-10 01:56:13,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:13,559 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 987 transitions. [2024-11-10 01:56:13,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 987 transitions. [2024-11-10 01:56:13,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2024-11-10 01:56:13,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:13,561 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:13,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-10 01:56:13,561 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:13,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:13,562 INFO L85 PathProgramCache]: Analyzing trace with hash -2086464042, now seen corresponding path program 1 times [2024-11-10 01:56:13,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:13,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016459560] [2024-11-10 01:56:13,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:13,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:14,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:14,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:14,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:14,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2024-11-10 01:56:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:14,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2024-11-10 01:56:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:14,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2024-11-10 01:56:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:14,148 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:14,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:14,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016459560] [2024-11-10 01:56:14,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016459560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:14,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:14,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:14,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536505421] [2024-11-10 01:56:14,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:14,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:14,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:14,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:14,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:14,151 INFO L87 Difference]: Start difference. First operand 710 states and 987 transitions. Second operand has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:14,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:14,376 INFO L93 Difference]: Finished difference Result 1164 states and 1623 transitions. [2024-11-10 01:56:14,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:14,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 455 [2024-11-10 01:56:14,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:14,379 INFO L225 Difference]: With dead ends: 1164 [2024-11-10 01:56:14,379 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 01:56:14,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:14,380 INFO L432 NwaCegarLoop]: 604 mSDtfsCounter, 675 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:14,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1217 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:14,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 01:56:14,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-10 01:56:14,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 702 states have (on average 1.3874643874643875) internal successors, (974), 702 states have internal predecessors, (974), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:14,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 986 transitions. [2024-11-10 01:56:14,398 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 986 transitions. Word has length 455 [2024-11-10 01:56:14,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:14,398 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 986 transitions. [2024-11-10 01:56:14,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:14,399 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 986 transitions. [2024-11-10 01:56:14,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2024-11-10 01:56:14,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:14,403 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:14,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-10 01:56:14,403 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:14,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:14,403 INFO L85 PathProgramCache]: Analyzing trace with hash 725427700, now seen corresponding path program 1 times [2024-11-10 01:56:14,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:14,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876097902] [2024-11-10 01:56:14,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:14,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2024-11-10 01:56:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2024-11-10 01:56:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2024-11-10 01:56:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,123 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:15,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:15,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876097902] [2024-11-10 01:56:15,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876097902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:15,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:15,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:15,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9360473] [2024-11-10 01:56:15,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:15,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:15,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:15,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:15,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:15,125 INFO L87 Difference]: Start difference. First operand 710 states and 986 transitions. Second operand has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:15,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:15,334 INFO L93 Difference]: Finished difference Result 1164 states and 1621 transitions. [2024-11-10 01:56:15,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:15,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 456 [2024-11-10 01:56:15,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:15,337 INFO L225 Difference]: With dead ends: 1164 [2024-11-10 01:56:15,337 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 01:56:15,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:15,338 INFO L432 NwaCegarLoop]: 604 mSDtfsCounter, 1211 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:15,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 1210 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:15,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 01:56:15,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-10 01:56:15,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 702 states have (on average 1.3860398860398861) internal successors, (973), 702 states have internal predecessors, (973), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:15,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 985 transitions. [2024-11-10 01:56:15,349 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 985 transitions. Word has length 456 [2024-11-10 01:56:15,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:15,350 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 985 transitions. [2024-11-10 01:56:15,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:15,350 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 985 transitions. [2024-11-10 01:56:15,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2024-11-10 01:56:15,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:15,352 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:15,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-10 01:56:15,352 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:15,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:15,353 INFO L85 PathProgramCache]: Analyzing trace with hash 907381031, now seen corresponding path program 1 times [2024-11-10 01:56:15,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:15,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291499428] [2024-11-10 01:56:15,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:15,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2024-11-10 01:56:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2024-11-10 01:56:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2024-11-10 01:56:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,955 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:15,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:15,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291499428] [2024-11-10 01:56:15,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291499428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:15,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:15,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:15,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662952710] [2024-11-10 01:56:15,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:15,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:15,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:15,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:15,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:15,957 INFO L87 Difference]: Start difference. First operand 710 states and 985 transitions. Second operand has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:16,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:16,156 INFO L93 Difference]: Finished difference Result 1164 states and 1619 transitions. [2024-11-10 01:56:16,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:16,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 457 [2024-11-10 01:56:16,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:16,159 INFO L225 Difference]: With dead ends: 1164 [2024-11-10 01:56:16,159 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 01:56:16,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:16,160 INFO L432 NwaCegarLoop]: 620 mSDtfsCounter, 1180 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1183 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:16,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1183 Valid, 1242 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:16,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 01:56:16,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-10 01:56:16,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 702 states have (on average 1.3846153846153846) internal successors, (972), 702 states have internal predecessors, (972), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:16,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 984 transitions. [2024-11-10 01:56:16,172 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 984 transitions. Word has length 457 [2024-11-10 01:56:16,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:16,174 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 984 transitions. [2024-11-10 01:56:16,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:16,174 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 984 transitions. [2024-11-10 01:56:16,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2024-11-10 01:56:16,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:16,176 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:16,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-10 01:56:16,177 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:16,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:16,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1344617637, now seen corresponding path program 1 times [2024-11-10 01:56:16,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:16,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100505575] [2024-11-10 01:56:16,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:16,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:16,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:16,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:16,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:16,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2024-11-10 01:56:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:16,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2024-11-10 01:56:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:16,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2024-11-10 01:56:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:16,755 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:16,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:16,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100505575] [2024-11-10 01:56:16,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100505575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:16,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:16,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:16,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395186834] [2024-11-10 01:56:16,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:16,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:16,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:16,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:16,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:16,757 INFO L87 Difference]: Start difference. First operand 710 states and 984 transitions. Second operand has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:16,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:16,949 INFO L93 Difference]: Finished difference Result 1164 states and 1617 transitions. [2024-11-10 01:56:16,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:16,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 458 [2024-11-10 01:56:16,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:16,952 INFO L225 Difference]: With dead ends: 1164 [2024-11-10 01:56:16,952 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 01:56:16,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:16,953 INFO L432 NwaCegarLoop]: 620 mSDtfsCounter, 636 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:16,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1249 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:16,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 01:56:16,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-10 01:56:16,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 702 states have (on average 1.3831908831908832) internal successors, (971), 702 states have internal predecessors, (971), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:16,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 983 transitions. [2024-11-10 01:56:16,969 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 983 transitions. Word has length 458 [2024-11-10 01:56:16,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:16,969 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 983 transitions. [2024-11-10 01:56:16,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:16,970 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 983 transitions. [2024-11-10 01:56:16,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2024-11-10 01:56:16,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:16,973 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:16,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-10 01:56:16,973 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:16,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:16,974 INFO L85 PathProgramCache]: Analyzing trace with hash 2067954168, now seen corresponding path program 1 times [2024-11-10 01:56:16,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:16,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957940144] [2024-11-10 01:56:16,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:16,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:17,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:17,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:17,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:17,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2024-11-10 01:56:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:17,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2024-11-10 01:56:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:17,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2024-11-10 01:56:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:17,586 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:17,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:17,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957940144] [2024-11-10 01:56:17,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957940144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:17,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:17,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:17,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737170587] [2024-11-10 01:56:17,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:17,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:17,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:17,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:17,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:17,589 INFO L87 Difference]: Start difference. First operand 710 states and 983 transitions. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:17,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:17,821 INFO L93 Difference]: Finished difference Result 1164 states and 1615 transitions. [2024-11-10 01:56:17,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:17,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 459 [2024-11-10 01:56:17,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:17,823 INFO L225 Difference]: With dead ends: 1164 [2024-11-10 01:56:17,823 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 01:56:17,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:17,828 INFO L432 NwaCegarLoop]: 620 mSDtfsCounter, 1148 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:17,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 1242 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:17,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 01:56:17,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-10 01:56:17,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 702 states have (on average 1.3817663817663817) internal successors, (970), 702 states have internal predecessors, (970), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:17,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 982 transitions. [2024-11-10 01:56:17,839 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 982 transitions. Word has length 459 [2024-11-10 01:56:17,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:17,839 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 982 transitions. [2024-11-10 01:56:17,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:17,839 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 982 transitions. [2024-11-10 01:56:17,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2024-11-10 01:56:17,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:17,841 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:17,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-10 01:56:17,842 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:17,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:17,842 INFO L85 PathProgramCache]: Analyzing trace with hash 2113521878, now seen corresponding path program 1 times [2024-11-10 01:56:17,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:17,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750171244] [2024-11-10 01:56:17,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:17,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:18,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:18,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:18,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:18,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2024-11-10 01:56:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:18,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2024-11-10 01:56:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:18,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2024-11-10 01:56:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:18,452 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:18,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:18,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750171244] [2024-11-10 01:56:18,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750171244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:18,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:18,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:18,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211460381] [2024-11-10 01:56:18,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:18,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:18,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:18,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:18,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:18,453 INFO L87 Difference]: Start difference. First operand 710 states and 982 transitions. Second operand has 5 states, 5 states have (on average 86.6) internal successors, (433), 5 states have internal predecessors, (433), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:18,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:18,637 INFO L93 Difference]: Finished difference Result 1164 states and 1613 transitions. [2024-11-10 01:56:18,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:18,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.6) internal successors, (433), 5 states have internal predecessors, (433), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 460 [2024-11-10 01:56:18,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:18,639 INFO L225 Difference]: With dead ends: 1164 [2024-11-10 01:56:18,639 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 01:56:18,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:18,640 INFO L432 NwaCegarLoop]: 620 mSDtfsCounter, 620 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:18,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1249 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:18,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 01:56:18,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-10 01:56:18,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 702 states have (on average 1.3803418803418803) internal successors, (969), 702 states have internal predecessors, (969), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 981 transitions. [2024-11-10 01:56:18,650 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 981 transitions. Word has length 460 [2024-11-10 01:56:18,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:18,650 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 981 transitions. [2024-11-10 01:56:18,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.6) internal successors, (433), 5 states have internal predecessors, (433), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:18,650 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 981 transitions. [2024-11-10 01:56:18,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2024-11-10 01:56:18,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:18,652 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:18,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-10 01:56:18,654 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:18,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:18,654 INFO L85 PathProgramCache]: Analyzing trace with hash -254334903, now seen corresponding path program 1 times [2024-11-10 01:56:18,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:18,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531963304] [2024-11-10 01:56:18,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:18,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:19,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:19,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:19,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:19,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2024-11-10 01:56:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:19,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2024-11-10 01:56:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:19,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2024-11-10 01:56:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:19,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:19,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531963304] [2024-11-10 01:56:19,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531963304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:19,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:19,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:19,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230227291] [2024-11-10 01:56:19,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:19,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:19,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:19,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:19,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:19,300 INFO L87 Difference]: Start difference. First operand 710 states and 981 transitions. Second operand has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:19,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:19,458 INFO L93 Difference]: Finished difference Result 1164 states and 1611 transitions. [2024-11-10 01:56:19,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:19,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 461 [2024-11-10 01:56:19,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:19,460 INFO L225 Difference]: With dead ends: 1164 [2024-11-10 01:56:19,460 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 01:56:19,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:19,461 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 605 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:19,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 1267 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:56:19,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 01:56:19,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-10 01:56:19,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 702 states have (on average 1.378917378917379) internal successors, (968), 702 states have internal predecessors, (968), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:19,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 980 transitions. [2024-11-10 01:56:19,471 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 980 transitions. Word has length 461 [2024-11-10 01:56:19,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:19,471 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 980 transitions. [2024-11-10 01:56:19,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:19,471 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 980 transitions. [2024-11-10 01:56:19,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2024-11-10 01:56:19,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:19,473 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:19,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-10 01:56:19,473 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:19,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:19,474 INFO L85 PathProgramCache]: Analyzing trace with hash 994183815, now seen corresponding path program 1 times [2024-11-10 01:56:19,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:19,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6279515] [2024-11-10 01:56:19,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:19,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:20,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:20,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:20,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:20,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2024-11-10 01:56:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:20,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2024-11-10 01:56:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:20,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2024-11-10 01:56:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:20,201 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:20,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:20,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6279515] [2024-11-10 01:56:20,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6279515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:20,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:20,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:20,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456252806] [2024-11-10 01:56:20,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:20,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:20,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:20,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:20,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:20,204 INFO L87 Difference]: Start difference. First operand 710 states and 980 transitions. Second operand has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:20,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:20,387 INFO L93 Difference]: Finished difference Result 1164 states and 1609 transitions. [2024-11-10 01:56:20,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:20,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 462 [2024-11-10 01:56:20,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:20,389 INFO L225 Difference]: With dead ends: 1164 [2024-11-10 01:56:20,389 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 01:56:20,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:20,390 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 597 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:20,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 1267 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:20,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 01:56:20,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-10 01:56:20,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 702 states have (on average 1.3774928774928774) internal successors, (967), 702 states have internal predecessors, (967), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:20,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 979 transitions. [2024-11-10 01:56:20,407 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 979 transitions. Word has length 462 [2024-11-10 01:56:20,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:20,407 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 979 transitions. [2024-11-10 01:56:20,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:20,407 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 979 transitions. [2024-11-10 01:56:20,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2024-11-10 01:56:20,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:20,411 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:20,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-10 01:56:20,411 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:20,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:20,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1394660378, now seen corresponding path program 1 times [2024-11-10 01:56:20,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:20,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535281618] [2024-11-10 01:56:20,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:20,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:21,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:21,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:21,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:21,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2024-11-10 01:56:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:21,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-11-10 01:56:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:21,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2024-11-10 01:56:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:21,151 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:21,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:21,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535281618] [2024-11-10 01:56:21,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535281618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:21,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:21,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:21,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947582030] [2024-11-10 01:56:21,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:21,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:21,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:21,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:21,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:21,153 INFO L87 Difference]: Start difference. First operand 710 states and 979 transitions. Second operand has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:21,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:21,451 INFO L93 Difference]: Finished difference Result 1164 states and 1607 transitions. [2024-11-10 01:56:21,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:21,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 463 [2024-11-10 01:56:21,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:21,452 INFO L225 Difference]: With dead ends: 1164 [2024-11-10 01:56:21,453 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 01:56:21,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:21,453 INFO L432 NwaCegarLoop]: 483 mSDtfsCounter, 582 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:21,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 975 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:56:21,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 01:56:21,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-10 01:56:21,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 702 states have (on average 1.376068376068376) internal successors, (966), 702 states have internal predecessors, (966), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:21,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 978 transitions. [2024-11-10 01:56:21,464 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 978 transitions. Word has length 463 [2024-11-10 01:56:21,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:21,464 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 978 transitions. [2024-11-10 01:56:21,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:21,465 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 978 transitions. [2024-11-10 01:56:21,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2024-11-10 01:56:21,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:21,467 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:21,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-10 01:56:21,467 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:21,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:21,467 INFO L85 PathProgramCache]: Analyzing trace with hash -760921672, now seen corresponding path program 1 times [2024-11-10 01:56:21,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:21,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687194446] [2024-11-10 01:56:21,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:21,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:22,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:22,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:22,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:22,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2024-11-10 01:56:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:22,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-11-10 01:56:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:22,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2024-11-10 01:56:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:22,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:22,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687194446] [2024-11-10 01:56:22,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687194446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:22,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:22,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:56:22,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314193031] [2024-11-10 01:56:22,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:22,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:56:22,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:22,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:56:22,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:56:22,644 INFO L87 Difference]: Start difference. First operand 710 states and 978 transitions. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:22,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:22,797 INFO L93 Difference]: Finished difference Result 1164 states and 1605 transitions. [2024-11-10 01:56:22,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:22,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 464 [2024-11-10 01:56:22,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:22,798 INFO L225 Difference]: With dead ends: 1164 [2024-11-10 01:56:22,798 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 01:56:22,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:22,799 INFO L432 NwaCegarLoop]: 628 mSDtfsCounter, 495 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:22,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 1258 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:56:22,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 01:56:22,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-10 01:56:22,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 702 states have (on average 1.3746438746438747) internal successors, (965), 702 states have internal predecessors, (965), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:22,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 977 transitions. [2024-11-10 01:56:22,813 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 977 transitions. Word has length 464 [2024-11-10 01:56:22,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:22,813 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 977 transitions. [2024-11-10 01:56:22,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:22,813 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 977 transitions. [2024-11-10 01:56:22,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2024-11-10 01:56:22,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:22,815 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:22,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-10 01:56:22,815 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:22,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:22,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1377723043, now seen corresponding path program 1 times [2024-11-10 01:56:22,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:22,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674787057] [2024-11-10 01:56:22,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:22,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:23,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:23,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:23,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:23,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2024-11-10 01:56:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:23,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-11-10 01:56:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:23,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2024-11-10 01:56:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:23,841 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:23,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:23,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674787057] [2024-11-10 01:56:23,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674787057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:23,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:23,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:23,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195919540] [2024-11-10 01:56:23,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:23,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:23,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:23,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:23,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:23,842 INFO L87 Difference]: Start difference. First operand 710 states and 977 transitions. Second operand has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:24,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:24,046 INFO L93 Difference]: Finished difference Result 1164 states and 1603 transitions. [2024-11-10 01:56:24,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:24,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 465 [2024-11-10 01:56:24,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:24,048 INFO L225 Difference]: With dead ends: 1164 [2024-11-10 01:56:24,048 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 01:56:24,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:24,049 INFO L432 NwaCegarLoop]: 616 mSDtfsCounter, 1175 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:24,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1175 Valid, 1234 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:24,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 01:56:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-10 01:56:24,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 702 states have (on average 1.3732193732193732) internal successors, (964), 702 states have internal predecessors, (964), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:24,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 976 transitions. [2024-11-10 01:56:24,062 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 976 transitions. Word has length 465 [2024-11-10 01:56:24,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:24,063 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 976 transitions. [2024-11-10 01:56:24,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:24,063 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 976 transitions. [2024-11-10 01:56:24,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2024-11-10 01:56:24,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:24,066 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:24,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-10 01:56:24,067 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:24,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:24,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1191623239, now seen corresponding path program 1 times [2024-11-10 01:56:24,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:24,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396204206] [2024-11-10 01:56:24,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:24,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:25,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:25,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:25,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:25,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2024-11-10 01:56:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:25,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2024-11-10 01:56:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:25,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2024-11-10 01:56:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:25,082 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:25,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:25,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396204206] [2024-11-10 01:56:25,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396204206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:25,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:25,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:25,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061715103] [2024-11-10 01:56:25,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:25,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:25,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:25,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:25,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:25,084 INFO L87 Difference]: Start difference. First operand 710 states and 976 transitions. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:25,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:25,287 INFO L93 Difference]: Finished difference Result 1164 states and 1601 transitions. [2024-11-10 01:56:25,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:25,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 466 [2024-11-10 01:56:25,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:25,288 INFO L225 Difference]: With dead ends: 1164 [2024-11-10 01:56:25,288 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 01:56:25,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:25,289 INFO L432 NwaCegarLoop]: 616 mSDtfsCounter, 653 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:25,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 1241 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:25,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 01:56:25,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-10 01:56:25,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 702 states have (on average 1.3717948717948718) internal successors, (963), 702 states have internal predecessors, (963), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:25,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 975 transitions. [2024-11-10 01:56:25,302 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 975 transitions. Word has length 466 [2024-11-10 01:56:25,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:25,303 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 975 transitions. [2024-11-10 01:56:25,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:25,303 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 975 transitions. [2024-11-10 01:56:25,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2024-11-10 01:56:25,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:25,305 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:25,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-10 01:56:25,306 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:25,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:25,306 INFO L85 PathProgramCache]: Analyzing trace with hash 129117326, now seen corresponding path program 1 times [2024-11-10 01:56:25,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:25,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186739562] [2024-11-10 01:56:25,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:25,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:26,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:26,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:26,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:26,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2024-11-10 01:56:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:26,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2024-11-10 01:56:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:26,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2024-11-10 01:56:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:26,292 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:26,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:26,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186739562] [2024-11-10 01:56:26,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186739562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:26,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:26,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:56:26,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925595743] [2024-11-10 01:56:26,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:26,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:56:26,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:26,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:56:26,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:56:26,293 INFO L87 Difference]: Start difference. First operand 710 states and 975 transitions. Second operand has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:26,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:26,470 INFO L93 Difference]: Finished difference Result 1164 states and 1599 transitions. [2024-11-10 01:56:26,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:26,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 467 [2024-11-10 01:56:26,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:26,472 INFO L225 Difference]: With dead ends: 1164 [2024-11-10 01:56:26,472 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 01:56:26,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:26,473 INFO L432 NwaCegarLoop]: 616 mSDtfsCounter, 504 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:26,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1234 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:26,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 01:56:26,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-10 01:56:26,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 702 states have (on average 1.3703703703703705) internal successors, (962), 702 states have internal predecessors, (962), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:26,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 974 transitions. [2024-11-10 01:56:26,483 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 974 transitions. Word has length 467 [2024-11-10 01:56:26,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:26,483 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 974 transitions. [2024-11-10 01:56:26,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:26,483 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 974 transitions. [2024-11-10 01:56:26,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2024-11-10 01:56:26,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:26,485 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:26,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-11-10 01:56:26,486 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:26,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:26,486 INFO L85 PathProgramCache]: Analyzing trace with hash -71230396, now seen corresponding path program 1 times [2024-11-10 01:56:26,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:26,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802532558] [2024-11-10 01:56:26,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:26,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:27,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:27,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:27,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:27,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2024-11-10 01:56:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:27,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2024-11-10 01:56:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:27,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2024-11-10 01:56:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:27,642 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:27,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:27,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802532558] [2024-11-10 01:56:27,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802532558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:27,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:27,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:27,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812632903] [2024-11-10 01:56:27,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:27,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:27,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:27,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:27,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:27,644 INFO L87 Difference]: Start difference. First operand 710 states and 974 transitions. Second operand has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:27,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:27,867 INFO L93 Difference]: Finished difference Result 1164 states and 1597 transitions. [2024-11-10 01:56:27,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:27,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 468 [2024-11-10 01:56:27,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:27,868 INFO L225 Difference]: With dead ends: 1164 [2024-11-10 01:56:27,868 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 01:56:27,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:27,869 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 636 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:27,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 1195 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:27,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 01:56:27,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-10 01:56:27,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 702 states have (on average 1.368945868945869) internal successors, (961), 702 states have internal predecessors, (961), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:27,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 973 transitions. [2024-11-10 01:56:27,880 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 973 transitions. Word has length 468 [2024-11-10 01:56:27,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:27,880 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 973 transitions. [2024-11-10 01:56:27,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:27,880 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 973 transitions. [2024-11-10 01:56:27,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2024-11-10 01:56:27,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:27,882 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:27,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-10 01:56:27,883 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:27,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:27,883 INFO L85 PathProgramCache]: Analyzing trace with hash -917567557, now seen corresponding path program 1 times [2024-11-10 01:56:27,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:27,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248965981] [2024-11-10 01:56:27,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:27,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:28,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:28,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:28,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:28,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2024-11-10 01:56:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:28,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2024-11-10 01:56:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:28,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2024-11-10 01:56:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:28,864 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:28,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:28,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248965981] [2024-11-10 01:56:28,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248965981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:28,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:28,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:28,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522914015] [2024-11-10 01:56:28,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:28,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:28,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:28,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:28,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:28,866 INFO L87 Difference]: Start difference. First operand 710 states and 973 transitions. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:29,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:29,085 INFO L93 Difference]: Finished difference Result 1164 states and 1595 transitions. [2024-11-10 01:56:29,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:29,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 469 [2024-11-10 01:56:29,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:29,087 INFO L225 Difference]: With dead ends: 1164 [2024-11-10 01:56:29,087 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 01:56:29,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:29,088 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 1200 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:29,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1200 Valid, 1188 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:29,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 01:56:29,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-10 01:56:29,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 702 states have (on average 1.3675213675213675) internal successors, (960), 702 states have internal predecessors, (960), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:29,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 972 transitions. [2024-11-10 01:56:29,098 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 972 transitions. Word has length 469 [2024-11-10 01:56:29,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:29,098 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 972 transitions. [2024-11-10 01:56:29,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:29,098 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 972 transitions. [2024-11-10 01:56:29,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2024-11-10 01:56:29,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:29,100 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:29,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-10 01:56:29,101 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:29,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:29,101 INFO L85 PathProgramCache]: Analyzing trace with hash 183540307, now seen corresponding path program 1 times [2024-11-10 01:56:29,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:29,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95424117] [2024-11-10 01:56:29,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:29,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:30,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:30,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:30,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:30,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2024-11-10 01:56:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:30,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2024-11-10 01:56:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:30,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2024-11-10 01:56:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:30,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:30,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95424117] [2024-11-10 01:56:30,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95424117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:30,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:30,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:56:30,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160764448] [2024-11-10 01:56:30,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:30,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:56:30,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:30,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:56:30,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:56:30,173 INFO L87 Difference]: Start difference. First operand 710 states and 972 transitions. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:30,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:30,353 INFO L93 Difference]: Finished difference Result 1164 states and 1593 transitions. [2024-11-10 01:56:30,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:30,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 470 [2024-11-10 01:56:30,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:30,355 INFO L225 Difference]: With dead ends: 1164 [2024-11-10 01:56:30,355 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 01:56:30,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:30,356 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 557 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:30,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 1188 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:30,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 01:56:30,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-10 01:56:30,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 702 states have (on average 1.3660968660968662) internal successors, (959), 702 states have internal predecessors, (959), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:30,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 971 transitions. [2024-11-10 01:56:30,365 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 971 transitions. Word has length 470 [2024-11-10 01:56:30,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:30,365 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 971 transitions. [2024-11-10 01:56:30,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:30,365 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 971 transitions. [2024-11-10 01:56:30,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2024-11-10 01:56:30,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:30,367 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:30,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-11-10 01:56:30,367 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:30,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:30,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1966964770, now seen corresponding path program 1 times [2024-11-10 01:56:30,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:30,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062597288] [2024-11-10 01:56:30,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:30,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:31,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:31,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:31,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:31,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:31,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2024-11-10 01:56:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:31,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2024-11-10 01:56:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:31,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2024-11-10 01:56:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:31,349 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:31,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:31,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062597288] [2024-11-10 01:56:31,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062597288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:31,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:31,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:31,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906104249] [2024-11-10 01:56:31,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:31,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:31,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:31,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:31,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:31,352 INFO L87 Difference]: Start difference. First operand 710 states and 971 transitions. Second operand has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:31,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:31,573 INFO L93 Difference]: Finished difference Result 1164 states and 1591 transitions. [2024-11-10 01:56:31,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:31,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 471 [2024-11-10 01:56:31,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:31,574 INFO L225 Difference]: With dead ends: 1164 [2024-11-10 01:56:31,575 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 01:56:31,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:31,575 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 1180 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:31,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 1188 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:31,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 01:56:31,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-10 01:56:31,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 702 states have (on average 1.3646723646723646) internal successors, (958), 702 states have internal predecessors, (958), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:31,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 970 transitions. [2024-11-10 01:56:31,585 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 970 transitions. Word has length 471 [2024-11-10 01:56:31,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:31,585 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 970 transitions. [2024-11-10 01:56:31,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:31,585 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 970 transitions. [2024-11-10 01:56:31,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2024-11-10 01:56:31,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:31,587 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:31,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-11-10 01:56:31,587 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:31,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:31,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1200702795, now seen corresponding path program 1 times [2024-11-10 01:56:31,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:31,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458483320] [2024-11-10 01:56:31,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:31,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:32,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:32,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:32,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:32,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2024-11-10 01:56:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:32,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2024-11-10 01:56:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:32,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2024-11-10 01:56:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:32,627 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:32,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:32,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458483320] [2024-11-10 01:56:32,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458483320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:32,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:32,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:32,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494118216] [2024-11-10 01:56:32,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:32,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:32,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:32,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:32,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:32,629 INFO L87 Difference]: Start difference. First operand 710 states and 970 transitions. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:32,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:32,844 INFO L93 Difference]: Finished difference Result 1164 states and 1589 transitions. [2024-11-10 01:56:32,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:32,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 472 [2024-11-10 01:56:32,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:32,845 INFO L225 Difference]: With dead ends: 1164 [2024-11-10 01:56:32,845 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 01:56:32,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:32,846 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 1170 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:32,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 1188 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:32,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 01:56:32,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-10 01:56:32,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 702 states have (on average 1.3632478632478633) internal successors, (957), 702 states have internal predecessors, (957), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:32,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 969 transitions. [2024-11-10 01:56:32,856 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 969 transitions. Word has length 472 [2024-11-10 01:56:32,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:32,856 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 969 transitions. [2024-11-10 01:56:32,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:32,856 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 969 transitions. [2024-11-10 01:56:32,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2024-11-10 01:56:32,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:32,858 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:32,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-11-10 01:56:32,858 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:32,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:32,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1841576571, now seen corresponding path program 1 times [2024-11-10 01:56:32,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:32,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599256968] [2024-11-10 01:56:32,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:32,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:33,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:33,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:33,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:33,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2024-11-10 01:56:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:33,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2024-11-10 01:56:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:33,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2024-11-10 01:56:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:33,827 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:33,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:33,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599256968] [2024-11-10 01:56:33,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599256968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:33,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:33,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:33,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952461639] [2024-11-10 01:56:33,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:33,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:33,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:33,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:33,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:33,829 INFO L87 Difference]: Start difference. First operand 710 states and 969 transitions. Second operand has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:34,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:34,043 INFO L93 Difference]: Finished difference Result 1164 states and 1587 transitions. [2024-11-10 01:56:34,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:34,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 473 [2024-11-10 01:56:34,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:34,045 INFO L225 Difference]: With dead ends: 1164 [2024-11-10 01:56:34,045 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 01:56:34,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:34,046 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 1160 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:34,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 1188 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:34,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 01:56:34,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-10 01:56:34,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 702 states have (on average 1.3618233618233617) internal successors, (956), 702 states have internal predecessors, (956), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 968 transitions. [2024-11-10 01:56:34,055 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 968 transitions. Word has length 473 [2024-11-10 01:56:34,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:34,055 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 968 transitions. [2024-11-10 01:56:34,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:34,055 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 968 transitions. [2024-11-10 01:56:34,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2024-11-10 01:56:34,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:34,057 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:34,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-11-10 01:56:34,058 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:34,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:34,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1030904779, now seen corresponding path program 1 times [2024-11-10 01:56:34,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:34,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709293419] [2024-11-10 01:56:34,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:34,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:35,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:35,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:35,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:35,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2024-11-10 01:56:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:35,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2024-11-10 01:56:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:35,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 379 [2024-11-10 01:56:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:35,264 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:35,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:35,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709293419] [2024-11-10 01:56:35,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709293419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:35,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:35,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:56:35,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148128849] [2024-11-10 01:56:35,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:35,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:56:35,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:35,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:56:35,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:56:35,266 INFO L87 Difference]: Start difference. First operand 710 states and 968 transitions. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:35,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:35,473 INFO L93 Difference]: Finished difference Result 1164 states and 1585 transitions. [2024-11-10 01:56:35,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:35,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 474 [2024-11-10 01:56:35,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:35,475 INFO L225 Difference]: With dead ends: 1164 [2024-11-10 01:56:35,475 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 01:56:35,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:35,475 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 521 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:35,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1188 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:35,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 01:56:35,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-10 01:56:35,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 702 states have (on average 1.3603988603988604) internal successors, (955), 702 states have internal predecessors, (955), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 967 transitions. [2024-11-10 01:56:35,484 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 967 transitions. Word has length 474 [2024-11-10 01:56:35,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:35,485 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 967 transitions. [2024-11-10 01:56:35,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 967 transitions. [2024-11-10 01:56:35,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2024-11-10 01:56:35,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:35,487 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:35,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-11-10 01:56:35,487 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:35,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:35,487 INFO L85 PathProgramCache]: Analyzing trace with hash 242807525, now seen corresponding path program 1 times [2024-11-10 01:56:35,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:35,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859851158] [2024-11-10 01:56:35,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:35,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:36,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:36,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:36,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:36,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2024-11-10 01:56:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:36,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2024-11-10 01:56:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:36,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2024-11-10 01:56:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:36,719 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:36,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:36,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859851158] [2024-11-10 01:56:36,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859851158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:36,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:36,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:56:36,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438752028] [2024-11-10 01:56:36,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:36,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:56:36,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:36,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:56:36,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:36,721 INFO L87 Difference]: Start difference. First operand 710 states and 967 transitions. Second operand has 6 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:37,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:37,343 INFO L93 Difference]: Finished difference Result 1681 states and 2293 transitions. [2024-11-10 01:56:37,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:56:37,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 475 [2024-11-10 01:56:37,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:37,345 INFO L225 Difference]: With dead ends: 1681 [2024-11-10 01:56:37,345 INFO L226 Difference]: Without dead ends: 1227 [2024-11-10 01:56:37,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:56:37,346 INFO L432 NwaCegarLoop]: 599 mSDtfsCounter, 415 mSDsluCounter, 2245 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 2844 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:37,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 2844 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1329 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 01:56:37,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2024-11-10 01:56:37,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1119. [2024-11-10 01:56:37,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 1108 states have (on average 1.3546931407942238) internal successors, (1501), 1108 states have internal predecessors, (1501), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 01:56:37,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1519 transitions. [2024-11-10 01:56:37,362 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1519 transitions. Word has length 475 [2024-11-10 01:56:37,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:37,362 INFO L471 AbstractCegarLoop]: Abstraction has 1119 states and 1519 transitions. [2024-11-10 01:56:37,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:37,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1519 transitions. [2024-11-10 01:56:37,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2024-11-10 01:56:37,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:37,365 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:37,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-11-10 01:56:37,366 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:37,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:37,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1236820517, now seen corresponding path program 1 times [2024-11-10 01:56:37,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:37,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630735252] [2024-11-10 01:56:37,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:37,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:38,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:38,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:38,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:38,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2024-11-10 01:56:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:38,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2024-11-10 01:56:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:38,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2024-11-10 01:56:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:38,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:38,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630735252] [2024-11-10 01:56:38,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630735252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:38,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:38,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:56:38,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796301535] [2024-11-10 01:56:38,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:38,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:56:38,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:38,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:56:38,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:38,776 INFO L87 Difference]: Start difference. First operand 1119 states and 1519 transitions. Second operand has 6 states, 6 states have (on average 74.83333333333333) internal successors, (449), 6 states have internal predecessors, (449), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:39,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:39,345 INFO L93 Difference]: Finished difference Result 1596 states and 2169 transitions. [2024-11-10 01:56:39,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:56:39,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 74.83333333333333) internal successors, (449), 6 states have internal predecessors, (449), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 476 [2024-11-10 01:56:39,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:39,347 INFO L225 Difference]: With dead ends: 1596 [2024-11-10 01:56:39,347 INFO L226 Difference]: Without dead ends: 1142 [2024-11-10 01:56:39,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:56:39,348 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 1337 mSDsluCounter, 1389 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:39,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 1862 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1167 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:56:39,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2024-11-10 01:56:39,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1120. [2024-11-10 01:56:39,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 1109 states have (on average 1.3543733092876464) internal successors, (1502), 1109 states have internal predecessors, (1502), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 01:56:39,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1520 transitions. [2024-11-10 01:56:39,365 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1520 transitions. Word has length 476 [2024-11-10 01:56:39,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:39,365 INFO L471 AbstractCegarLoop]: Abstraction has 1120 states and 1520 transitions. [2024-11-10 01:56:39,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.83333333333333) internal successors, (449), 6 states have internal predecessors, (449), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:39,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1520 transitions. [2024-11-10 01:56:39,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2024-11-10 01:56:39,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:39,368 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:39,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-11-10 01:56:39,368 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:39,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:39,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2084455407, now seen corresponding path program 1 times [2024-11-10 01:56:39,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:39,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181687266] [2024-11-10 01:56:39,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:39,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:41,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:56:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:41,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 01:56:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:41,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 01:56:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:41,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2024-11-10 01:56:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:41,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2024-11-10 01:56:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:41,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2024-11-10 01:56:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:41,017 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 01:56:41,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:41,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181687266] [2024-11-10 01:56:41,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181687266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:41,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:41,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:56:41,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031856937] [2024-11-10 01:56:41,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:41,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:56:41,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:41,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:56:41,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:56:41,019 INFO L87 Difference]: Start difference. First operand 1120 states and 1520 transitions. Second operand has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:41,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:41,674 INFO L93 Difference]: Finished difference Result 2530 states and 3418 transitions. [2024-11-10 01:56:41,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:56:41,676 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 476 [2024-11-10 01:56:41,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:41,679 INFO L225 Difference]: With dead ends: 2530 [2024-11-10 01:56:41,680 INFO L226 Difference]: Without dead ends: 1972 [2024-11-10 01:56:41,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:56:41,681 INFO L432 NwaCegarLoop]: 1491 mSDtfsCounter, 1147 mSDsluCounter, 6401 mSDsCounter, 0 mSdLazyCounter, 1847 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 7892 SdHoareTripleChecker+Invalid, 1847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:41,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 7892 Invalid, 1847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1847 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 01:56:41,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2024-11-10 01:56:41,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1187. [2024-11-10 01:56:41,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 1173 states have (on average 1.3580562659846547) internal successors, (1593), 1173 states have internal predecessors, (1593), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 01:56:41,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1617 transitions. [2024-11-10 01:56:41,701 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1617 transitions. Word has length 476 [2024-11-10 01:56:41,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:41,701 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 1617 transitions. [2024-11-10 01:56:41,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:41,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1617 transitions. [2024-11-10 01:56:41,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2024-11-10 01:56:41,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:41,704 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:41,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-11-10 01:56:41,704 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:41,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:41,704 INFO L85 PathProgramCache]: Analyzing trace with hash -225051314, now seen corresponding path program 1 times [2024-11-10 01:56:41,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:41,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688818210] [2024-11-10 01:56:41,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:41,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:43,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:43,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:43,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:43,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2024-11-10 01:56:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:43,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2024-11-10 01:56:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:43,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2024-11-10 01:56:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:43,347 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-10 01:56:43,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:43,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688818210] [2024-11-10 01:56:43,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688818210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:43,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:43,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:43,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509460851] [2024-11-10 01:56:43,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:43,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:43,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:43,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:43,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:43,349 INFO L87 Difference]: Start difference. First operand 1187 states and 1617 transitions. Second operand has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:43,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:43,593 INFO L93 Difference]: Finished difference Result 2114 states and 2824 transitions. [2024-11-10 01:56:43,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:56:43,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 477 [2024-11-10 01:56:43,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:43,596 INFO L225 Difference]: With dead ends: 2114 [2024-11-10 01:56:43,596 INFO L226 Difference]: Without dead ends: 1421 [2024-11-10 01:56:43,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-11-10 01:56:43,597 INFO L432 NwaCegarLoop]: 624 mSDtfsCounter, 17 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2488 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:43,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2488 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:43,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2024-11-10 01:56:43,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1415. [2024-11-10 01:56:43,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1415 states, 1401 states have (on average 1.316916488222698) internal successors, (1845), 1401 states have internal predecessors, (1845), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 01:56:43,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 1869 transitions. [2024-11-10 01:56:43,618 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 1869 transitions. Word has length 477 [2024-11-10 01:56:43,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:43,618 INFO L471 AbstractCegarLoop]: Abstraction has 1415 states and 1869 transitions. [2024-11-10 01:56:43,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:43,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 1869 transitions. [2024-11-10 01:56:43,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2024-11-10 01:56:43,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:43,621 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:43,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-11-10 01:56:43,622 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:43,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:43,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1109413810, now seen corresponding path program 1 times [2024-11-10 01:56:43,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:43,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250836258] [2024-11-10 01:56:43,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:43,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:45,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:45,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:45,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:45,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2024-11-10 01:56:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:45,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2024-11-10 01:56:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:45,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 383 [2024-11-10 01:56:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 112 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:45,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:45,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250836258] [2024-11-10 01:56:45,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250836258] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 01:56:45,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597875555] [2024-11-10 01:56:45,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:45,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 01:56:45,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:56:45,800 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 01:56:45,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 01:56:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:47,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 2953 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 01:56:47,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:56:47,915 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-10 01:56:47,915 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 01:56:47,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597875555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:47,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 01:56:47,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2024-11-10 01:56:47,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185260150] [2024-11-10 01:56:47,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:47,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:56:47,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:47,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:56:47,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-10 01:56:47,918 INFO L87 Difference]: Start difference. First operand 1415 states and 1869 transitions. Second operand has 8 states, 8 states have (on average 56.5) internal successors, (452), 8 states have internal predecessors, (452), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:48,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:48,584 INFO L93 Difference]: Finished difference Result 3243 states and 4296 transitions. [2024-11-10 01:56:48,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 01:56:48,584 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 56.5) internal successors, (452), 8 states have internal predecessors, (452), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 479 [2024-11-10 01:56:48,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:48,587 INFO L225 Difference]: With dead ends: 3243 [2024-11-10 01:56:48,588 INFO L226 Difference]: Without dead ends: 2474 [2024-11-10 01:56:48,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 486 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:56:48,589 INFO L432 NwaCegarLoop]: 474 mSDtfsCounter, 2285 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2288 SdHoareTripleChecker+Valid, 2231 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:48,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2288 Valid, 2231 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1409 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 01:56:48,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2024-11-10 01:56:48,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 1936. [2024-11-10 01:56:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1913 states have (on average 1.2969158389963409) internal successors, (2481), 1913 states have internal predecessors, (2481), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 01:56:48,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2523 transitions. [2024-11-10 01:56:48,624 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2523 transitions. Word has length 479 [2024-11-10 01:56:48,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:48,625 INFO L471 AbstractCegarLoop]: Abstraction has 1936 states and 2523 transitions. [2024-11-10 01:56:48,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 56.5) internal successors, (452), 8 states have internal predecessors, (452), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:48,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2523 transitions. [2024-11-10 01:56:48,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2024-11-10 01:56:48,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:48,629 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:48,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 01:56:48,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2024-11-10 01:56:48,830 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:48,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:48,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1060979557, now seen corresponding path program 1 times [2024-11-10 01:56:48,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:48,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647632864] [2024-11-10 01:56:48,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:48,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:49,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:49,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:49,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:49,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2024-11-10 01:56:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:49,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2024-11-10 01:56:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:49,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 383 [2024-11-10 01:56:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:49,527 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-11-10 01:56:49,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:49,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647632864] [2024-11-10 01:56:49,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647632864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:49,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:49,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:49,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275618300] [2024-11-10 01:56:49,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:49,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:49,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:49,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:49,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:49,529 INFO L87 Difference]: Start difference. First operand 1936 states and 2523 transitions. Second operand has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:49,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:49,761 INFO L93 Difference]: Finished difference Result 3109 states and 4039 transitions. [2024-11-10 01:56:49,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:56:49,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 479 [2024-11-10 01:56:49,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:49,764 INFO L225 Difference]: With dead ends: 3109 [2024-11-10 01:56:49,764 INFO L226 Difference]: Without dead ends: 2026 [2024-11-10 01:56:49,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-11-10 01:56:49,765 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 16 mSDsluCounter, 1868 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2494 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:49,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2494 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:49,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2024-11-10 01:56:49,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2026. [2024-11-10 01:56:49,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2026 states, 2003 states have (on average 1.3035446829755366) internal successors, (2611), 2003 states have internal predecessors, (2611), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 01:56:49,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 2653 transitions. [2024-11-10 01:56:49,794 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 2653 transitions. Word has length 479 [2024-11-10 01:56:49,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:49,794 INFO L471 AbstractCegarLoop]: Abstraction has 2026 states and 2653 transitions. [2024-11-10 01:56:49,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:49,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2653 transitions. [2024-11-10 01:56:49,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2024-11-10 01:56:49,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:49,798 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:49,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-11-10 01:56:49,798 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:49,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:49,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1230269130, now seen corresponding path program 1 times [2024-11-10 01:56:49,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:49,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365586072] [2024-11-10 01:56:49,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:49,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:51,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:51,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:51,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:51,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-11-10 01:56:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:51,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2024-11-10 01:56:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:51,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 384 [2024-11-10 01:56:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:51,069 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-11-10 01:56:51,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:51,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365586072] [2024-11-10 01:56:51,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365586072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:51,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:51,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:51,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166222358] [2024-11-10 01:56:51,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:51,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:51,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:51,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:51,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:51,071 INFO L87 Difference]: Start difference. First operand 2026 states and 2653 transitions. Second operand has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:51,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:51,350 INFO L93 Difference]: Finished difference Result 4759 states and 6186 transitions. [2024-11-10 01:56:51,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:56:51,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 480 [2024-11-10 01:56:51,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:51,356 INFO L225 Difference]: With dead ends: 4759 [2024-11-10 01:56:51,356 INFO L226 Difference]: Without dead ends: 3278 [2024-11-10 01:56:51,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:51,358 INFO L432 NwaCegarLoop]: 642 mSDtfsCounter, 534 mSDsluCounter, 1900 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:51,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 2542 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:51,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3278 states. [2024-11-10 01:56:51,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3278 to 2396. [2024-11-10 01:56:51,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2396 states, 2355 states have (on average 1.3201698513800424) internal successors, (3109), 2355 states have internal predecessors, (3109), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-10 01:56:51,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 3187 transitions. [2024-11-10 01:56:51,408 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 3187 transitions. Word has length 480 [2024-11-10 01:56:51,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:51,409 INFO L471 AbstractCegarLoop]: Abstraction has 2396 states and 3187 transitions. [2024-11-10 01:56:51,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:51,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 3187 transitions. [2024-11-10 01:56:51,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2024-11-10 01:56:51,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:51,413 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:51,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-11-10 01:56:51,413 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:51,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:51,413 INFO L85 PathProgramCache]: Analyzing trace with hash -622823878, now seen corresponding path program 1 times [2024-11-10 01:56:51,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:51,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318982343] [2024-11-10 01:56:51,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:51,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:52,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:52,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:52,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 01:56:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:52,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-11-10 01:56:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:52,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2024-11-10 01:56:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:52,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 384 [2024-11-10 01:56:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:52,857 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2024-11-10 01:56:52,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:52,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318982343] [2024-11-10 01:56:52,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318982343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:52,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:52,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 01:56:52,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166342670] [2024-11-10 01:56:52,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:52,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 01:56:52,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:52,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 01:56:52,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:56:52,859 INFO L87 Difference]: Start difference. First operand 2396 states and 3187 transitions. Second operand has 7 states, 7 states have (on average 55.42857142857143) internal successors, (388), 7 states have internal predecessors, (388), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:53,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:53,320 INFO L93 Difference]: Finished difference Result 5205 states and 6941 transitions. [2024-11-10 01:56:53,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 01:56:53,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 55.42857142857143) internal successors, (388), 7 states have internal predecessors, (388), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 480 [2024-11-10 01:56:53,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:53,324 INFO L225 Difference]: With dead ends: 5205 [2024-11-10 01:56:53,324 INFO L226 Difference]: Without dead ends: 2448 [2024-11-10 01:56:53,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-10 01:56:53,327 INFO L432 NwaCegarLoop]: 608 mSDtfsCounter, 823 mSDsluCounter, 2292 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 2900 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:53,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 2900 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:56:53,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2024-11-10 01:56:53,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 2422. [2024-11-10 01:56:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2422 states, 2381 states have (on average 1.3112137757244855) internal successors, (3122), 2381 states have internal predecessors, (3122), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-10 01:56:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2422 states to 2422 states and 3200 transitions. [2024-11-10 01:56:53,376 INFO L78 Accepts]: Start accepts. Automaton has 2422 states and 3200 transitions. Word has length 480 [2024-11-10 01:56:53,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:53,377 INFO L471 AbstractCegarLoop]: Abstraction has 2422 states and 3200 transitions. [2024-11-10 01:56:53,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 55.42857142857143) internal successors, (388), 7 states have internal predecessors, (388), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:53,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2422 states and 3200 transitions. [2024-11-10 01:56:53,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2024-11-10 01:56:53,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:53,380 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:53,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-11-10 01:56:53,381 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:53,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:53,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1367915170, now seen corresponding path program 1 times [2024-11-10 01:56:53,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:53,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022129173] [2024-11-10 01:56:53,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:53,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms