./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_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 5bfb987fcec0e4e87ab47a565086b76b03edc9a60525cd8ee77a0c461c0fdaaa --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 22:37:30,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 22:37:30,215 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-12 22:37:30,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 22:37:30,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 22:37:30,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 22:37:30,249 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 22:37:30,249 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 22:37:30,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 22:37:30,250 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 22:37:30,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 22:37:30,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 22:37:30,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 22:37:30,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 22:37:30,253 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 22:37:30,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 22:37:30,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 22:37:30,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 22:37:30,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 22:37:30,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 22:37:30,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 22:37:30,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 22:37:30,256 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 22:37:30,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 22:37:30,256 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 22:37:30,256 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 22:37:30,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 22:37:30,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 22:37:30,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 22:37:30,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:37:30,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 22:37:30,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 22:37:30,258 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 22:37:30,258 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 22:37:30,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 22:37:30,258 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 22:37:30,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 22:37:30,268 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 22:37:30,269 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 22:37:30,269 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 -> 5bfb987fcec0e4e87ab47a565086b76b03edc9a60525cd8ee77a0c461c0fdaaa [2024-10-12 22:37:30,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 22:37:30,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 22:37:30,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 22:37:30,534 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 22:37:30,535 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 22:37:30,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c [2024-10-12 22:37:31,826 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 22:37:32,009 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 22:37:32,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c [2024-10-12 22:37:32,025 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b3f66e2a/2b544f79c3d645328d6a4fced713867d/FLAG81a7f004c [2024-10-12 22:37:32,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b3f66e2a/2b544f79c3d645328d6a4fced713867d [2024-10-12 22:37:32,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 22:37:32,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 22:37:32,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 22:37:32,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 22:37:32,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 22:37:32,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:37:32" (1/1) ... [2024-10-12 22:37:32,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70b917ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:32, skipping insertion in model container [2024-10-12 22:37:32,052 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:37:32" (1/1) ... [2024-10-12 22:37:32,084 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 22:37:32,215 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c[1279,1292] [2024-10-12 22:37:32,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:37:32,391 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 22:37:32,402 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c[1279,1292] [2024-10-12 22:37:32,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:37:32,514 INFO L204 MainTranslator]: Completed translation [2024-10-12 22:37:32,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:32 WrapperNode [2024-10-12 22:37:32,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 22:37:32,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 22:37:32,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 22:37:32,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 22:37:32,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:32" (1/1) ... [2024-10-12 22:37:32,544 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:32" (1/1) ... [2024-10-12 22:37:32,645 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1383 [2024-10-12 22:37:32,645 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 22:37:32,646 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 22:37:32,646 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 22:37:32,646 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 22:37:32,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:32" (1/1) ... [2024-10-12 22:37:32,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:32" (1/1) ... [2024-10-12 22:37:32,679 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:32" (1/1) ... [2024-10-12 22:37:32,735 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 22:37:32,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:32" (1/1) ... [2024-10-12 22:37:32,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:32" (1/1) ... [2024-10-12 22:37:32,776 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:32" (1/1) ... [2024-10-12 22:37:32,787 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:32" (1/1) ... [2024-10-12 22:37:32,807 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:32" (1/1) ... [2024-10-12 22:37:32,820 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:32" (1/1) ... [2024-10-12 22:37:32,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 22:37:32,848 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 22:37:32,849 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 22:37:32,849 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 22:37:32,850 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:32" (1/1) ... [2024-10-12 22:37:32,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:37:32,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 22:37:32,884 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 22:37:32,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 22:37:32,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 22:37:32,978 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 22:37:32,978 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 22:37:32,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 22:37:32,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 22:37:32,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 22:37:33,207 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 22:37:33,211 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 22:37:34,557 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2024-10-12 22:37:34,558 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 22:37:34,611 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 22:37:34,611 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 22:37:34,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:37:34 BoogieIcfgContainer [2024-10-12 22:37:34,612 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 22:37:34,613 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 22:37:34,613 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 22:37:34,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 22:37:34,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 10:37:32" (1/3) ... [2024-10-12 22:37:34,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c684a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:37:34, skipping insertion in model container [2024-10-12 22:37:34,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:32" (2/3) ... [2024-10-12 22:37:34,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c684a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:37:34, skipping insertion in model container [2024-10-12 22:37:34,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:37:34" (3/3) ... [2024-10-12 22:37:34,623 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c [2024-10-12 22:37:34,637 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 22:37:34,637 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 22:37:34,699 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 22:37:34,705 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;@5d798243, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 22:37:34,706 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 22:37:34,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 389 states, 383 states have (on average 1.4960835509138382) internal successors, (573), 384 states have internal predecessors, (573), 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-10-12 22:37:34,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-12 22:37:34,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:34,723 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] [2024-10-12 22:37:34,723 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:34,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:34,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1358744025, now seen corresponding path program 1 times [2024-10-12 22:37:34,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:34,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839637131] [2024-10-12 22:37:34,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:34,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:35,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:35,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 22:37:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:35,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 22:37:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:35,125 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:35,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:35,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839637131] [2024-10-12 22:37:35,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839637131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:35,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:35,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 22:37:35,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530339499] [2024-10-12 22:37:35,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:35,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 22:37:35,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:35,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 22:37:35,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 22:37:35,154 INFO L87 Difference]: Start difference. First operand has 389 states, 383 states have (on average 1.4960835509138382) internal successors, (573), 384 states have internal predecessors, (573), 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 52.0) internal successors, (104), 2 states have internal predecessors, (104), 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-10-12 22:37:35,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:35,197 INFO L93 Difference]: Finished difference Result 708 states and 1058 transitions. [2024-10-12 22:37:35,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 22:37:35,200 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 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 116 [2024-10-12 22:37:35,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:35,213 INFO L225 Difference]: With dead ends: 708 [2024-10-12 22:37:35,214 INFO L226 Difference]: Without dead ends: 388 [2024-10-12 22:37:35,219 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-10-12 22:37:35,222 INFO L432 NwaCegarLoop]: 575 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:35,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 575 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:35,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-12 22:37:35,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2024-10-12 22:37:35,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 383 states have (on average 1.4882506527415145) internal successors, (570), 383 states have internal predecessors, (570), 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-10-12 22:37:35,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 576 transitions. [2024-10-12 22:37:35,272 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 576 transitions. Word has length 116 [2024-10-12 22:37:35,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:35,273 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 576 transitions. [2024-10-12 22:37:35,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 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-10-12 22:37:35,273 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 576 transitions. [2024-10-12 22:37:35,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-12 22:37:35,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:35,277 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] [2024-10-12 22:37:35,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 22:37:35,279 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:35,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:35,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1080158561, now seen corresponding path program 1 times [2024-10-12 22:37:35,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:35,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081028880] [2024-10-12 22:37:35,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:35,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:36,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:36,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 22:37:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:36,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 22:37:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:36,051 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:36,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:36,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081028880] [2024-10-12 22:37:36,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081028880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:36,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:36,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:36,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240087664] [2024-10-12 22:37:36,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:36,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:36,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:36,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:36,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:36,055 INFO L87 Difference]: Start difference. First operand 388 states and 576 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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-10-12 22:37:36,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:36,112 INFO L93 Difference]: Finished difference Result 392 states and 580 transitions. [2024-10-12 22:37:36,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:36,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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 116 [2024-10-12 22:37:36,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:36,114 INFO L225 Difference]: With dead ends: 392 [2024-10-12 22:37:36,115 INFO L226 Difference]: Without dead ends: 390 [2024-10-12 22:37:36,115 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-10-12 22:37:36,116 INFO L432 NwaCegarLoop]: 573 mSDtfsCounter, 0 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:36,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1714 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:36,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-12 22:37:36,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2024-10-12 22:37:36,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 385 states have (on average 1.4857142857142858) internal successors, (572), 385 states have internal predecessors, (572), 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-10-12 22:37:36,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 578 transitions. [2024-10-12 22:37:36,130 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 578 transitions. Word has length 116 [2024-10-12 22:37:36,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:36,134 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 578 transitions. [2024-10-12 22:37:36,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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-10-12 22:37:36,134 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 578 transitions. [2024-10-12 22:37:36,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-12 22:37:36,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:36,136 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] [2024-10-12 22:37:36,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 22:37:36,136 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:36,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:36,137 INFO L85 PathProgramCache]: Analyzing trace with hash -873127207, now seen corresponding path program 1 times [2024-10-12 22:37:36,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:36,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017230439] [2024-10-12 22:37:36,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:36,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:36,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:36,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 22:37:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:36,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 22:37:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:36,505 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:36,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:36,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017230439] [2024-10-12 22:37:36,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017230439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:36,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:36,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:36,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238043210] [2024-10-12 22:37:36,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:36,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:36,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:36,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:36,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:36,512 INFO L87 Difference]: Start difference. First operand 390 states and 578 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-10-12 22:37:36,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:36,882 INFO L93 Difference]: Finished difference Result 970 states and 1440 transitions. [2024-10-12 22:37:36,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:37:36,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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 117 [2024-10-12 22:37:36,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:36,885 INFO L225 Difference]: With dead ends: 970 [2024-10-12 22:37:36,887 INFO L226 Difference]: Without dead ends: 390 [2024-10-12 22:37:36,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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-10-12 22:37:36,889 INFO L432 NwaCegarLoop]: 627 mSDtfsCounter, 1090 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:36,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 1682 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 22:37:36,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-12 22:37:36,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2024-10-12 22:37:36,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 385 states have (on average 1.483116883116883) internal successors, (571), 385 states have internal predecessors, (571), 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-10-12 22:37:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 577 transitions. [2024-10-12 22:37:36,912 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 577 transitions. Word has length 117 [2024-10-12 22:37:36,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:36,913 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 577 transitions. [2024-10-12 22:37:36,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-10-12 22:37:36,913 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 577 transitions. [2024-10-12 22:37:36,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-12 22:37:36,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:36,919 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] [2024-10-12 22:37:36,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 22:37:36,919 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:36,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:36,920 INFO L85 PathProgramCache]: Analyzing trace with hash 52997019, now seen corresponding path program 1 times [2024-10-12 22:37:36,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:36,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453381297] [2024-10-12 22:37:36,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:36,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:37,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:37,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 22:37:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:37,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 22:37:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:37,194 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:37,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:37,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453381297] [2024-10-12 22:37:37,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453381297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:37,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:37,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:37,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166324070] [2024-10-12 22:37:37,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:37,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:37,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:37,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:37,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:37,196 INFO L87 Difference]: Start difference. First operand 390 states and 577 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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-10-12 22:37:37,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:37,226 INFO L93 Difference]: Finished difference Result 713 states and 1054 transitions. [2024-10-12 22:37:37,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:37,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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 118 [2024-10-12 22:37:37,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:37,230 INFO L225 Difference]: With dead ends: 713 [2024-10-12 22:37:37,230 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 22:37:37,231 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-10-12 22:37:37,234 INFO L432 NwaCegarLoop]: 572 mSDtfsCounter, 0 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:37,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1708 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:37,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 22:37:37,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-12 22:37:37,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4806201550387597) internal successors, (573), 387 states have internal predecessors, (573), 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-10-12 22:37:37,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 579 transitions. [2024-10-12 22:37:37,248 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 579 transitions. Word has length 118 [2024-10-12 22:37:37,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:37,249 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 579 transitions. [2024-10-12 22:37:37,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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-10-12 22:37:37,249 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 579 transitions. [2024-10-12 22:37:37,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-12 22:37:37,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:37,253 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] [2024-10-12 22:37:37,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 22:37:37,254 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:37,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:37,254 INFO L85 PathProgramCache]: Analyzing trace with hash 544942264, now seen corresponding path program 1 times [2024-10-12 22:37:37,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:37,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337973578] [2024-10-12 22:37:37,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:37,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:37,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:37,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 22:37:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:37,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 22:37:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:37,630 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:37,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:37,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337973578] [2024-10-12 22:37:37,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337973578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:37,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:37,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:37,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556786044] [2024-10-12 22:37:37,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:37,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:37,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:37,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:37,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:37,634 INFO L87 Difference]: Start difference. First operand 392 states and 579 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-10-12 22:37:37,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:37,728 INFO L93 Difference]: Finished difference Result 715 states and 1055 transitions. [2024-10-12 22:37:37,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:37,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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 119 [2024-10-12 22:37:37,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:37,730 INFO L225 Difference]: With dead ends: 715 [2024-10-12 22:37:37,730 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 22:37:37,730 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-10-12 22:37:37,731 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 480 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:37,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 1066 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:37,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 22:37:37,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-12 22:37:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4780361757105944) internal successors, (572), 387 states have internal predecessors, (572), 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-10-12 22:37:37,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 578 transitions. [2024-10-12 22:37:37,738 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 578 transitions. Word has length 119 [2024-10-12 22:37:37,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:37,738 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 578 transitions. [2024-10-12 22:37:37,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-10-12 22:37:37,738 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 578 transitions. [2024-10-12 22:37:37,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-12 22:37:37,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:37,739 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] [2024-10-12 22:37:37,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 22:37:37,740 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:37,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:37,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1208713513, now seen corresponding path program 1 times [2024-10-12 22:37:37,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:37,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042734678] [2024-10-12 22:37:37,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:37,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:37,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:37,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 22:37:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:37,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 22:37:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:37,989 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:37,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:37,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042734678] [2024-10-12 22:37:37,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042734678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:37,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:37,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:37,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919443116] [2024-10-12 22:37:37,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:37,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:37,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:37,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:37,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:37,992 INFO L87 Difference]: Start difference. First operand 392 states and 578 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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-10-12 22:37:38,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:38,073 INFO L93 Difference]: Finished difference Result 719 states and 1058 transitions. [2024-10-12 22:37:38,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:37:38,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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 120 [2024-10-12 22:37:38,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:38,075 INFO L225 Difference]: With dead ends: 719 [2024-10-12 22:37:38,076 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 22:37:38,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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-10-12 22:37:38,077 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 487 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:38,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1667 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:38,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 22:37:38,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-12 22:37:38,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.475452196382429) internal successors, (571), 387 states have internal predecessors, (571), 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-10-12 22:37:38,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 577 transitions. [2024-10-12 22:37:38,088 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 577 transitions. Word has length 120 [2024-10-12 22:37:38,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:38,088 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 577 transitions. [2024-10-12 22:37:38,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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-10-12 22:37:38,088 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 577 transitions. [2024-10-12 22:37:38,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 22:37:38,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:38,089 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] [2024-10-12 22:37:38,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 22:37:38,090 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:38,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:38,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1275297526, now seen corresponding path program 1 times [2024-10-12 22:37:38,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:38,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500280289] [2024-10-12 22:37:38,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:38,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:38,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:38,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 22:37:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:38,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 22:37:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:38,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:38,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500280289] [2024-10-12 22:37:38,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500280289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:38,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:38,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:38,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773315691] [2024-10-12 22:37:38,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:38,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:38,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:38,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:38,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:38,327 INFO L87 Difference]: Start difference. First operand 392 states and 577 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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-10-12 22:37:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:38,414 INFO L93 Difference]: Finished difference Result 715 states and 1051 transitions. [2024-10-12 22:37:38,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:38,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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 121 [2024-10-12 22:37:38,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:38,416 INFO L225 Difference]: With dead ends: 715 [2024-10-12 22:37:38,416 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 22:37:38,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:38,418 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 1039 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:38,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 1066 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:38,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 22:37:38,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-12 22:37:38,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4728682170542635) internal successors, (570), 387 states have internal predecessors, (570), 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-10-12 22:37:38,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 576 transitions. [2024-10-12 22:37:38,455 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 576 transitions. Word has length 121 [2024-10-12 22:37:38,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:38,456 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 576 transitions. [2024-10-12 22:37:38,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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-10-12 22:37:38,456 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 576 transitions. [2024-10-12 22:37:38,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 22:37:38,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:38,458 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] [2024-10-12 22:37:38,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 22:37:38,458 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:38,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:38,459 INFO L85 PathProgramCache]: Analyzing trace with hash -178047970, now seen corresponding path program 1 times [2024-10-12 22:37:38,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:38,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085838127] [2024-10-12 22:37:38,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:38,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:38,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:38,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 22:37:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:38,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 22:37:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:38,753 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:38,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:38,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085838127] [2024-10-12 22:37:38,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085838127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:38,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:38,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:38,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343083756] [2024-10-12 22:37:38,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:38,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:38,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:38,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:38,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:38,755 INFO L87 Difference]: Start difference. First operand 392 states and 576 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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-10-12 22:37:38,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:38,842 INFO L93 Difference]: Finished difference Result 715 states and 1049 transitions. [2024-10-12 22:37:38,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:38,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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 122 [2024-10-12 22:37:38,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:38,845 INFO L225 Difference]: With dead ends: 715 [2024-10-12 22:37:38,845 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 22:37:38,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:38,846 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 555 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:38,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1072 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:38,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 22:37:38,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-12 22:37:38,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4702842377260983) internal successors, (569), 387 states have internal predecessors, (569), 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-10-12 22:37:38,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 575 transitions. [2024-10-12 22:37:38,856 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 575 transitions. Word has length 122 [2024-10-12 22:37:38,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:38,857 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 575 transitions. [2024-10-12 22:37:38,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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-10-12 22:37:38,857 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 575 transitions. [2024-10-12 22:37:38,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-12 22:37:38,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:38,859 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] [2024-10-12 22:37:38,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 22:37:38,859 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:38,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:38,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1899068650, now seen corresponding path program 1 times [2024-10-12 22:37:38,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:38,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720697439] [2024-10-12 22:37:38,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:38,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:39,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:39,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 22:37:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:39,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 22:37:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:39,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:39,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:39,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720697439] [2024-10-12 22:37:39,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720697439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:39,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:39,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:39,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188296645] [2024-10-12 22:37:39,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:39,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:39,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:39,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:39,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:39,205 INFO L87 Difference]: Start difference. First operand 392 states and 575 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-10-12 22:37:39,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:39,258 INFO L93 Difference]: Finished difference Result 715 states and 1047 transitions. [2024-10-12 22:37:39,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:39,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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 123 [2024-10-12 22:37:39,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:39,260 INFO L225 Difference]: With dead ends: 715 [2024-10-12 22:37:39,260 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 22:37:39,261 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-10-12 22:37:39,261 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 484 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:39,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 1098 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:39,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 22:37:39,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-12 22:37:39,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4677002583979328) internal successors, (568), 387 states have internal predecessors, (568), 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-10-12 22:37:39,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 574 transitions. [2024-10-12 22:37:39,269 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 574 transitions. Word has length 123 [2024-10-12 22:37:39,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:39,269 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 574 transitions. [2024-10-12 22:37:39,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-10-12 22:37:39,269 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 574 transitions. [2024-10-12 22:37:39,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-12 22:37:39,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:39,270 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] [2024-10-12 22:37:39,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 22:37:39,271 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:39,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:39,271 INFO L85 PathProgramCache]: Analyzing trace with hash -129347291, now seen corresponding path program 1 times [2024-10-12 22:37:39,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:39,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249409566] [2024-10-12 22:37:39,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:39,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:39,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:39,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 22:37:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:39,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 22:37:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:39,496 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:39,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:39,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249409566] [2024-10-12 22:37:39,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249409566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:39,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:39,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:39,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002481597] [2024-10-12 22:37:39,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:39,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:39,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:39,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:39,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:39,499 INFO L87 Difference]: Start difference. First operand 392 states and 574 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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-10-12 22:37:39,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:39,556 INFO L93 Difference]: Finished difference Result 715 states and 1045 transitions. [2024-10-12 22:37:39,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:39,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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 124 [2024-10-12 22:37:39,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:39,558 INFO L225 Difference]: With dead ends: 715 [2024-10-12 22:37:39,558 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 22:37:39,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:39,559 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 1037 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:39,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 1098 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:39,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 22:37:39,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-12 22:37:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4651162790697674) internal successors, (567), 387 states have internal predecessors, (567), 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-10-12 22:37:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 573 transitions. [2024-10-12 22:37:39,566 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 573 transitions. Word has length 124 [2024-10-12 22:37:39,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:39,567 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 573 transitions. [2024-10-12 22:37:39,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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-10-12 22:37:39,567 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 573 transitions. [2024-10-12 22:37:39,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-12 22:37:39,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:39,568 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] [2024-10-12 22:37:39,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 22:37:39,568 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:39,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:39,569 INFO L85 PathProgramCache]: Analyzing trace with hash -577416317, now seen corresponding path program 1 times [2024-10-12 22:37:39,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:39,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098393457] [2024-10-12 22:37:39,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:39,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:39,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:39,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 22:37:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:39,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 22:37:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:39,874 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:39,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:39,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098393457] [2024-10-12 22:37:39,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098393457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:39,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:39,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:39,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22583928] [2024-10-12 22:37:39,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:39,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:39,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:39,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:39,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:39,877 INFO L87 Difference]: Start difference. First operand 392 states and 573 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-10-12 22:37:39,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:39,936 INFO L93 Difference]: Finished difference Result 715 states and 1043 transitions. [2024-10-12 22:37:39,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:39,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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 125 [2024-10-12 22:37:39,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:39,938 INFO L225 Difference]: With dead ends: 715 [2024-10-12 22:37:39,938 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 22:37:39,939 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-10-12 22:37:39,939 INFO L432 NwaCegarLoop]: 552 mSDtfsCounter, 519 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:39,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1106 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:39,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 22:37:39,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-12 22:37:39,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4625322997416021) internal successors, (566), 387 states have internal predecessors, (566), 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-10-12 22:37:39,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 572 transitions. [2024-10-12 22:37:39,948 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 572 transitions. Word has length 125 [2024-10-12 22:37:39,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:39,948 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 572 transitions. [2024-10-12 22:37:39,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-10-12 22:37:39,948 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 572 transitions. [2024-10-12 22:37:39,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-12 22:37:39,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:39,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] [2024-10-12 22:37:39,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 22:37:39,950 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:39,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:39,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1617002421, now seen corresponding path program 1 times [2024-10-12 22:37:39,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:39,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505496324] [2024-10-12 22:37:39,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:39,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:40,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:40,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 22:37:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:40,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 22:37:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:40,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:40,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505496324] [2024-10-12 22:37:40,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505496324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:40,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:40,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:40,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706864564] [2024-10-12 22:37:40,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:40,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:40,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:40,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:40,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:40,334 INFO L87 Difference]: Start difference. First operand 392 states and 572 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-10-12 22:37:40,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:40,441 INFO L93 Difference]: Finished difference Result 715 states and 1041 transitions. [2024-10-12 22:37:40,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:40,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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 126 [2024-10-12 22:37:40,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:40,443 INFO L225 Difference]: With dead ends: 715 [2024-10-12 22:37:40,443 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 22:37:40,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-10-12 22:37:40,444 INFO L432 NwaCegarLoop]: 529 mSDtfsCounter, 474 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:40,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1585 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:40,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 22:37:40,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-12 22:37:40,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4599483204134367) internal successors, (565), 387 states have internal predecessors, (565), 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-10-12 22:37:40,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 571 transitions. [2024-10-12 22:37:40,453 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 571 transitions. Word has length 126 [2024-10-12 22:37:40,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:40,453 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 571 transitions. [2024-10-12 22:37:40,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-10-12 22:37:40,453 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 571 transitions. [2024-10-12 22:37:40,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-12 22:37:40,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:40,454 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] [2024-10-12 22:37:40,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 22:37:40,455 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:40,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:40,455 INFO L85 PathProgramCache]: Analyzing trace with hash 384933465, now seen corresponding path program 1 times [2024-10-12 22:37:40,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:40,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433341075] [2024-10-12 22:37:40,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:40,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:40,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:40,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 22:37:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:40,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 22:37:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:40,812 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:40,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:40,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433341075] [2024-10-12 22:37:40,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433341075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:40,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:40,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:40,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715860264] [2024-10-12 22:37:40,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:40,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:40,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:40,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:40,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:40,814 INFO L87 Difference]: Start difference. First operand 392 states and 571 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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-10-12 22:37:40,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:40,914 INFO L93 Difference]: Finished difference Result 715 states and 1039 transitions. [2024-10-12 22:37:40,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:40,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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 127 [2024-10-12 22:37:40,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:40,916 INFO L225 Difference]: With dead ends: 715 [2024-10-12 22:37:40,916 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 22:37:40,917 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-10-12 22:37:40,917 INFO L432 NwaCegarLoop]: 529 mSDtfsCounter, 938 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:40,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 1060 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:40,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 22:37:40,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-12 22:37:40,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4573643410852712) internal successors, (564), 387 states have internal predecessors, (564), 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-10-12 22:37:40,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 570 transitions. [2024-10-12 22:37:40,925 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 570 transitions. Word has length 127 [2024-10-12 22:37:40,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:40,926 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 570 transitions. [2024-10-12 22:37:40,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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-10-12 22:37:40,926 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 570 transitions. [2024-10-12 22:37:40,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-12 22:37:40,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:40,927 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] [2024-10-12 22:37:40,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 22:37:40,927 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:40,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:40,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1126086004, now seen corresponding path program 1 times [2024-10-12 22:37:40,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:40,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602420134] [2024-10-12 22:37:40,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:40,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:41,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:41,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 22:37:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:41,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 22:37:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:41,333 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:41,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:41,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602420134] [2024-10-12 22:37:41,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602420134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:41,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:41,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:41,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185260225] [2024-10-12 22:37:41,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:41,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:41,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:41,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:41,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:41,335 INFO L87 Difference]: Start difference. First operand 392 states and 570 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-10-12 22:37:41,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:41,445 INFO L93 Difference]: Finished difference Result 715 states and 1037 transitions. [2024-10-12 22:37:41,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:41,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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 128 [2024-10-12 22:37:41,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:41,448 INFO L225 Difference]: With dead ends: 715 [2024-10-12 22:37:41,448 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 22:37:41,448 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-10-12 22:37:41,449 INFO L432 NwaCegarLoop]: 529 mSDtfsCounter, 470 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:41,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1066 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:41,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 22:37:41,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-12 22:37:41,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.454780361757106) internal successors, (563), 387 states have internal predecessors, (563), 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-10-12 22:37:41,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 569 transitions. [2024-10-12 22:37:41,461 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 569 transitions. Word has length 128 [2024-10-12 22:37:41,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:41,462 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 569 transitions. [2024-10-12 22:37:41,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-10-12 22:37:41,462 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 569 transitions. [2024-10-12 22:37:41,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-12 22:37:41,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:41,463 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] [2024-10-12 22:37:41,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 22:37:41,464 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:41,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:41,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1478743000, now seen corresponding path program 1 times [2024-10-12 22:37:41,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:41,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126470209] [2024-10-12 22:37:41,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:41,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:41,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:41,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 22:37:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:41,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 22:37:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:41,768 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:41,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:41,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126470209] [2024-10-12 22:37:41,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126470209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:41,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:41,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:41,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240525659] [2024-10-12 22:37:41,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:41,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:41,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:41,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:41,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:41,771 INFO L87 Difference]: Start difference. First operand 392 states and 569 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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-10-12 22:37:41,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:41,823 INFO L93 Difference]: Finished difference Result 715 states and 1035 transitions. [2024-10-12 22:37:41,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:41,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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 129 [2024-10-12 22:37:41,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:41,825 INFO L225 Difference]: With dead ends: 715 [2024-10-12 22:37:41,825 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 22:37:41,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-10-12 22:37:41,826 INFO L432 NwaCegarLoop]: 549 mSDtfsCounter, 514 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:41,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 1100 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:41,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 22:37:41,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-12 22:37:41,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4521963824289406) internal successors, (562), 387 states have internal predecessors, (562), 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-10-12 22:37:41,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 568 transitions. [2024-10-12 22:37:41,836 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 568 transitions. Word has length 129 [2024-10-12 22:37:41,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:41,836 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 568 transitions. [2024-10-12 22:37:41,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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-10-12 22:37:41,836 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 568 transitions. [2024-10-12 22:37:41,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-12 22:37:41,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:41,838 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] [2024-10-12 22:37:41,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 22:37:41,839 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:41,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:41,839 INFO L85 PathProgramCache]: Analyzing trace with hash -23884227, now seen corresponding path program 1 times [2024-10-12 22:37:41,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:41,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670835260] [2024-10-12 22:37:41,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:41,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:42,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:42,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:42,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 22:37:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:42,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:42,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:42,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670835260] [2024-10-12 22:37:42,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670835260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:42,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:42,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:42,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637667456] [2024-10-12 22:37:42,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:42,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:42,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:42,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:42,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:42,106 INFO L87 Difference]: Start difference. First operand 392 states and 568 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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-10-12 22:37:42,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:42,160 INFO L93 Difference]: Finished difference Result 715 states and 1033 transitions. [2024-10-12 22:37:42,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:42,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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 130 [2024-10-12 22:37:42,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:42,162 INFO L225 Difference]: With dead ends: 715 [2024-10-12 22:37:42,162 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 22:37:42,162 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-10-12 22:37:42,163 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 474 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:42,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1088 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:42,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 22:37:42,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-12 22:37:42,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.449612403100775) internal successors, (561), 387 states have internal predecessors, (561), 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-10-12 22:37:42,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 567 transitions. [2024-10-12 22:37:42,171 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 567 transitions. Word has length 130 [2024-10-12 22:37:42,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:42,171 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 567 transitions. [2024-10-12 22:37:42,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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-10-12 22:37:42,171 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 567 transitions. [2024-10-12 22:37:42,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 22:37:42,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:42,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] [2024-10-12 22:37:42,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 22:37:42,173 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:42,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:42,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1259931877, now seen corresponding path program 1 times [2024-10-12 22:37:42,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:42,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594718149] [2024-10-12 22:37:42,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:42,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:42,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:42,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:42,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 22:37:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:42,601 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:42,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:42,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594718149] [2024-10-12 22:37:42,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594718149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:42,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:42,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:42,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489068919] [2024-10-12 22:37:42,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:42,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:42,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:42,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:42,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:42,604 INFO L87 Difference]: Start difference. First operand 392 states and 567 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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-10-12 22:37:42,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:42,771 INFO L93 Difference]: Finished difference Result 721 states and 1039 transitions. [2024-10-12 22:37:42,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:37:42,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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 131 [2024-10-12 22:37:42,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:42,774 INFO L225 Difference]: With dead ends: 721 [2024-10-12 22:37:42,774 INFO L226 Difference]: Without dead ends: 396 [2024-10-12 22:37:42,774 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-10-12 22:37:42,775 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 2 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2074 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:42,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2074 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 22:37:42,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-10-12 22:37:42,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 394. [2024-10-12 22:37:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4473007712082262) internal successors, (563), 389 states have internal predecessors, (563), 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-10-12 22:37:42,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 569 transitions. [2024-10-12 22:37:42,783 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 569 transitions. Word has length 131 [2024-10-12 22:37:42,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:42,784 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 569 transitions. [2024-10-12 22:37:42,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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-10-12 22:37:42,784 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 569 transitions. [2024-10-12 22:37:42,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-12 22:37:42,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:42,785 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] [2024-10-12 22:37:42,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 22:37:42,785 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:42,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:42,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1011320282, now seen corresponding path program 1 times [2024-10-12 22:37:42,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:42,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833254463] [2024-10-12 22:37:42,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:42,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:43,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:43,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:43,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 22:37:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:43,280 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:43,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:43,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833254463] [2024-10-12 22:37:43,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833254463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:43,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:43,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:43,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4094187] [2024-10-12 22:37:43,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:43,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:43,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:43,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:43,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:43,282 INFO L87 Difference]: Start difference. First operand 394 states and 569 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 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-10-12 22:37:43,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:43,319 INFO L93 Difference]: Finished difference Result 765 states and 1092 transitions. [2024-10-12 22:37:43,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:37:43,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 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 132 [2024-10-12 22:37:43,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:43,321 INFO L225 Difference]: With dead ends: 765 [2024-10-12 22:37:43,321 INFO L226 Difference]: Without dead ends: 440 [2024-10-12 22:37:43,321 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-10-12 22:37:43,322 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 19 mSDsluCounter, 1662 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:43,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 2218 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:43,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-10-12 22:37:43,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 438. [2024-10-12 22:37:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 433 states have (on average 1.4226327944572748) internal successors, (616), 433 states have internal predecessors, (616), 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-10-12 22:37:43,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 622 transitions. [2024-10-12 22:37:43,330 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 622 transitions. Word has length 132 [2024-10-12 22:37:43,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:43,331 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 622 transitions. [2024-10-12 22:37:43,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 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-10-12 22:37:43,331 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 622 transitions. [2024-10-12 22:37:43,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-12 22:37:43,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:43,332 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] [2024-10-12 22:37:43,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 22:37:43,332 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:43,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:43,333 INFO L85 PathProgramCache]: Analyzing trace with hash -2099922208, now seen corresponding path program 1 times [2024-10-12 22:37:43,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:43,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282935627] [2024-10-12 22:37:43,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:43,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:43,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:43,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:43,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 22:37:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:43,893 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:43,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:43,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282935627] [2024-10-12 22:37:43,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282935627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:43,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:43,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:37:43,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118487009] [2024-10-12 22:37:43,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:43,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:37:43,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:43,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:37:43,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:43,897 INFO L87 Difference]: Start difference. First operand 438 states and 622 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-10-12 22:37:43,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:43,998 INFO L93 Difference]: Finished difference Result 973 states and 1363 transitions. [2024-10-12 22:37:43,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:37:43,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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 133 [2024-10-12 22:37:43,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:44,000 INFO L225 Difference]: With dead ends: 973 [2024-10-12 22:37:44,001 INFO L226 Difference]: Without dead ends: 604 [2024-10-12 22:37:44,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-12 22:37:44,002 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 861 mSDsluCounter, 1646 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 2196 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:44,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 2196 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:44,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-12 22:37:44,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-10-12 22:37:44,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 596 states have (on average 1.3942953020134228) internal successors, (831), 596 states have internal predecessors, (831), 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-10-12 22:37:44,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 843 transitions. [2024-10-12 22:37:44,015 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 843 transitions. Word has length 133 [2024-10-12 22:37:44,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:44,015 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 843 transitions. [2024-10-12 22:37:44,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-10-12 22:37:44,015 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 843 transitions. [2024-10-12 22:37:44,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2024-10-12 22:37:44,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:44,018 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:37:44,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 22:37:44,018 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:44,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:44,019 INFO L85 PathProgramCache]: Analyzing trace with hash -527063259, now seen corresponding path program 1 times [2024-10-12 22:37:44,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:44,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033467892] [2024-10-12 22:37:44,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:44,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:44,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:44,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:44,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 22:37:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:44,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-12 22:37:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:44,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-12 22:37:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:44,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-10-12 22:37:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:44,640 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:44,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:44,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033467892] [2024-10-12 22:37:44,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033467892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:44,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:44,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:44,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797571754] [2024-10-12 22:37:44,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:44,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:44,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:44,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:44,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:44,643 INFO L87 Difference]: Start difference. First operand 604 states and 843 transitions. Second operand has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 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-10-12 22:37:44,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:44,723 INFO L93 Difference]: Finished difference Result 973 states and 1362 transitions. [2024-10-12 22:37:44,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:44,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 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 321 [2024-10-12 22:37:44,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:44,726 INFO L225 Difference]: With dead ends: 973 [2024-10-12 22:37:44,726 INFO L226 Difference]: Without dead ends: 604 [2024-10-12 22:37:44,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:44,727 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 515 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:44,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 1062 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:44,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-12 22:37:44,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-10-12 22:37:44,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 596 states have (on average 1.3926174496644295) internal successors, (830), 596 states have internal predecessors, (830), 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-10-12 22:37:44,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 842 transitions. [2024-10-12 22:37:44,739 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 842 transitions. Word has length 321 [2024-10-12 22:37:44,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:44,739 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 842 transitions. [2024-10-12 22:37:44,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 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-10-12 22:37:44,740 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 842 transitions. [2024-10-12 22:37:44,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-10-12 22:37:44,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:44,742 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:37:44,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 22:37:44,743 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:44,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:44,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1995936863, now seen corresponding path program 1 times [2024-10-12 22:37:44,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:44,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747942463] [2024-10-12 22:37:44,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:44,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:45,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:45,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:45,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 22:37:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:45,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-12 22:37:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:45,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-10-12 22:37:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:45,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-10-12 22:37:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:45,308 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:45,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:45,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747942463] [2024-10-12 22:37:45,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747942463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:45,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:45,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:45,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740923920] [2024-10-12 22:37:45,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:45,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:45,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:45,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:45,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:45,310 INFO L87 Difference]: Start difference. First operand 604 states and 842 transitions. Second operand has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 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-10-12 22:37:45,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:45,392 INFO L93 Difference]: Finished difference Result 973 states and 1360 transitions. [2024-10-12 22:37:45,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:45,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 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 322 [2024-10-12 22:37:45,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:45,395 INFO L225 Difference]: With dead ends: 973 [2024-10-12 22:37:45,395 INFO L226 Difference]: Without dead ends: 604 [2024-10-12 22:37:45,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:45,397 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 507 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:45,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1062 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:45,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-12 22:37:45,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-10-12 22:37:45,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 596 states have (on average 1.3909395973154361) internal successors, (829), 596 states have internal predecessors, (829), 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-10-12 22:37:45,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 841 transitions. [2024-10-12 22:37:45,411 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 841 transitions. Word has length 322 [2024-10-12 22:37:45,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:45,411 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 841 transitions. [2024-10-12 22:37:45,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 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-10-12 22:37:45,412 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 841 transitions. [2024-10-12 22:37:45,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-10-12 22:37:45,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:45,415 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:37:45,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 22:37:45,416 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:45,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:45,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1240803152, now seen corresponding path program 1 times [2024-10-12 22:37:45,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:45,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63231859] [2024-10-12 22:37:45,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:45,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:45,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:45,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:45,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 22:37:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:45,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-12 22:37:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:45,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-10-12 22:37:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:45,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-12 22:37:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:45,940 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:45,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:45,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63231859] [2024-10-12 22:37:45,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63231859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:45,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:45,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:45,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316060141] [2024-10-12 22:37:45,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:45,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:45,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:45,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:45,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:45,943 INFO L87 Difference]: Start difference. First operand 604 states and 841 transitions. Second operand has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 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-10-12 22:37:46,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:46,019 INFO L93 Difference]: Finished difference Result 973 states and 1358 transitions. [2024-10-12 22:37:46,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:46,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 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 323 [2024-10-12 22:37:46,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:46,024 INFO L225 Difference]: With dead ends: 973 [2024-10-12 22:37:46,024 INFO L226 Difference]: Without dead ends: 604 [2024-10-12 22:37:46,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:46,025 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 499 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:46,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 1062 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:46,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-12 22:37:46,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-10-12 22:37:46,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 596 states have (on average 1.389261744966443) internal successors, (828), 596 states have internal predecessors, (828), 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-10-12 22:37:46,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 840 transitions. [2024-10-12 22:37:46,038 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 840 transitions. Word has length 323 [2024-10-12 22:37:46,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:46,039 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 840 transitions. [2024-10-12 22:37:46,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 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-10-12 22:37:46,039 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 840 transitions. [2024-10-12 22:37:46,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-10-12 22:37:46,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:46,042 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:37:46,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 22:37:46,042 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:46,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:46,042 INFO L85 PathProgramCache]: Analyzing trace with hash -2068867158, now seen corresponding path program 1 times [2024-10-12 22:37:46,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:46,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980656889] [2024-10-12 22:37:46,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:46,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:46,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:46,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:46,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 22:37:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:46,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-10-12 22:37:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:46,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-12 22:37:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:46,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-10-12 22:37:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:46,562 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:46,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:46,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980656889] [2024-10-12 22:37:46,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980656889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:46,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:46,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:46,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984235971] [2024-10-12 22:37:46,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:46,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:46,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:46,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:46,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:46,564 INFO L87 Difference]: Start difference. First operand 604 states and 840 transitions. Second operand has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 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-10-12 22:37:46,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:46,642 INFO L93 Difference]: Finished difference Result 973 states and 1356 transitions. [2024-10-12 22:37:46,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:46,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 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 324 [2024-10-12 22:37:46,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:46,644 INFO L225 Difference]: With dead ends: 973 [2024-10-12 22:37:46,644 INFO L226 Difference]: Without dead ends: 604 [2024-10-12 22:37:46,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:46,645 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 891 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:46,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 1056 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:46,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-12 22:37:46,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-10-12 22:37:46,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 596 states have (on average 1.3875838926174497) internal successors, (827), 596 states have internal predecessors, (827), 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-10-12 22:37:46,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 839 transitions. [2024-10-12 22:37:46,658 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 839 transitions. Word has length 324 [2024-10-12 22:37:46,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:46,659 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 839 transitions. [2024-10-12 22:37:46,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 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-10-12 22:37:46,659 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 839 transitions. [2024-10-12 22:37:46,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-10-12 22:37:46,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:46,662 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:37:46,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 22:37:46,662 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:46,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:46,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1727343621, now seen corresponding path program 1 times [2024-10-12 22:37:46,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:46,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173841179] [2024-10-12 22:37:46,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:46,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:47,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:47,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:47,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 22:37:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:47,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-10-12 22:37:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:47,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-10-12 22:37:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:47,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-10-12 22:37:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:47,227 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:47,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:47,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173841179] [2024-10-12 22:37:47,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173841179] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:47,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:47,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:47,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128718903] [2024-10-12 22:37:47,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:47,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:47,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:47,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:47,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:47,231 INFO L87 Difference]: Start difference. First operand 604 states and 839 transitions. Second operand has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 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-10-12 22:37:47,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:47,299 INFO L93 Difference]: Finished difference Result 973 states and 1354 transitions. [2024-10-12 22:37:47,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:47,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 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 325 [2024-10-12 22:37:47,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:47,302 INFO L225 Difference]: With dead ends: 973 [2024-10-12 22:37:47,302 INFO L226 Difference]: Without dead ends: 604 [2024-10-12 22:37:47,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:47,303 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 476 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:47,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1086 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:47,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-12 22:37:47,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-10-12 22:37:47,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 596 states have (on average 1.3859060402684564) internal successors, (826), 596 states have internal predecessors, (826), 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-10-12 22:37:47,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 838 transitions. [2024-10-12 22:37:47,315 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 838 transitions. Word has length 325 [2024-10-12 22:37:47,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:47,315 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 838 transitions. [2024-10-12 22:37:47,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 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-10-12 22:37:47,316 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 838 transitions. [2024-10-12 22:37:47,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-10-12 22:37:47,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:47,319 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:37:47,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 22:37:47,319 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:47,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:47,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1491267445, now seen corresponding path program 1 times [2024-10-12 22:37:47,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:47,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416816307] [2024-10-12 22:37:47,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:47,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:47,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:47,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:47,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 22:37:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:47,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-12 22:37:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:47,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-10-12 22:37:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:47,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-10-12 22:37:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:47,921 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:47,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:47,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416816307] [2024-10-12 22:37:47,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416816307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:47,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:47,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:47,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178277608] [2024-10-12 22:37:47,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:47,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:47,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:47,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:47,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:47,924 INFO L87 Difference]: Start difference. First operand 604 states and 838 transitions. Second operand has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 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-10-12 22:37:47,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:47,991 INFO L93 Difference]: Finished difference Result 973 states and 1352 transitions. [2024-10-12 22:37:47,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:47,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 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 326 [2024-10-12 22:37:47,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:47,994 INFO L225 Difference]: With dead ends: 973 [2024-10-12 22:37:47,995 INFO L226 Difference]: Without dead ends: 604 [2024-10-12 22:37:47,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:47,996 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 852 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:47,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 1080 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:47,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-12 22:37:48,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-10-12 22:37:48,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 596 states have (on average 1.3842281879194631) internal successors, (825), 596 states have internal predecessors, (825), 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-10-12 22:37:48,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 837 transitions. [2024-10-12 22:37:48,017 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 837 transitions. Word has length 326 [2024-10-12 22:37:48,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:48,017 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 837 transitions. [2024-10-12 22:37:48,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 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-10-12 22:37:48,018 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 837 transitions. [2024-10-12 22:37:48,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-10-12 22:37:48,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:48,022 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:37:48,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 22:37:48,023 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:48,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:48,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1635488474, now seen corresponding path program 1 times [2024-10-12 22:37:48,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:48,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146404786] [2024-10-12 22:37:48,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:48,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:48,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:48,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:48,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 22:37:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:48,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-12 22:37:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:48,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-12 22:37:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:48,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-10-12 22:37:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:48,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:48,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146404786] [2024-10-12 22:37:48,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146404786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:48,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:48,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:48,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679278061] [2024-10-12 22:37:48,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:48,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:48,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:48,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:48,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:48,801 INFO L87 Difference]: Start difference. First operand 604 states and 837 transitions. Second operand has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 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-10-12 22:37:49,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:49,042 INFO L93 Difference]: Finished difference Result 973 states and 1350 transitions. [2024-10-12 22:37:49,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:49,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 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 327 [2024-10-12 22:37:49,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:49,045 INFO L225 Difference]: With dead ends: 973 [2024-10-12 22:37:49,045 INFO L226 Difference]: Without dead ends: 604 [2024-10-12 22:37:49,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:49,046 INFO L432 NwaCegarLoop]: 399 mSDtfsCounter, 454 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:49,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 806 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 22:37:49,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-12 22:37:49,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-10-12 22:37:49,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 596 states have (on average 1.3825503355704698) internal successors, (824), 596 states have internal predecessors, (824), 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-10-12 22:37:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 836 transitions. [2024-10-12 22:37:49,057 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 836 transitions. Word has length 327 [2024-10-12 22:37:49,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:49,058 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 836 transitions. [2024-10-12 22:37:49,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 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-10-12 22:37:49,058 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 836 transitions. [2024-10-12 22:37:49,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-10-12 22:37:49,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:49,061 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:37:49,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 22:37:49,062 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:49,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:49,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1908581440, now seen corresponding path program 1 times [2024-10-12 22:37:49,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:49,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404155282] [2024-10-12 22:37:49,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:49,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:50,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:50,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:50,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 22:37:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:50,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-12 22:37:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:50,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-12 22:37:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:50,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-12 22:37:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:50,031 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:50,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:50,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404155282] [2024-10-12 22:37:50,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404155282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:50,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:50,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:50,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864539656] [2024-10-12 22:37:50,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:50,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:50,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:50,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:50,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:50,034 INFO L87 Difference]: Start difference. First operand 604 states and 836 transitions. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 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-10-12 22:37:50,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:50,086 INFO L93 Difference]: Finished difference Result 973 states and 1348 transitions. [2024-10-12 22:37:50,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:50,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 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 328 [2024-10-12 22:37:50,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:50,088 INFO L225 Difference]: With dead ends: 973 [2024-10-12 22:37:50,088 INFO L226 Difference]: Without dead ends: 604 [2024-10-12 22:37:50,089 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-10-12 22:37:50,089 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 383 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:50,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1078 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:50,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-12 22:37:50,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-10-12 22:37:50,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 596 states have (on average 1.3808724832214765) internal successors, (823), 596 states have internal predecessors, (823), 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-10-12 22:37:50,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 835 transitions. [2024-10-12 22:37:50,108 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 835 transitions. Word has length 328 [2024-10-12 22:37:50,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:50,108 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 835 transitions. [2024-10-12 22:37:50,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 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-10-12 22:37:50,108 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 835 transitions. [2024-10-12 22:37:50,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-10-12 22:37:50,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:50,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:37:50,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 22:37:50,112 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:50,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:50,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1642191244, now seen corresponding path program 1 times [2024-10-12 22:37:50,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:50,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571251647] [2024-10-12 22:37:50,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:50,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:50,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:50,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:50,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 22:37:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:50,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-10-12 22:37:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:50,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-12 22:37:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:50,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-10-12 22:37:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:50,951 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:50,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:50,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571251647] [2024-10-12 22:37:50,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571251647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:50,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:50,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:50,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630644533] [2024-10-12 22:37:50,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:50,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:50,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:50,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:50,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:50,953 INFO L87 Difference]: Start difference. First operand 604 states and 835 transitions. Second operand has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 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-10-12 22:37:51,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:51,040 INFO L93 Difference]: Finished difference Result 973 states and 1346 transitions. [2024-10-12 22:37:51,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:51,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 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 329 [2024-10-12 22:37:51,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:51,042 INFO L225 Difference]: With dead ends: 973 [2024-10-12 22:37:51,042 INFO L226 Difference]: Without dead ends: 604 [2024-10-12 22:37:51,043 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-10-12 22:37:51,043 INFO L432 NwaCegarLoop]: 523 mSDtfsCounter, 865 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:51,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 1048 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:51,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-12 22:37:51,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-10-12 22:37:51,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 596 states have (on average 1.3791946308724832) internal successors, (822), 596 states have internal predecessors, (822), 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-10-12 22:37:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 834 transitions. [2024-10-12 22:37:51,062 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 834 transitions. Word has length 329 [2024-10-12 22:37:51,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:51,062 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 834 transitions. [2024-10-12 22:37:51,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 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-10-12 22:37:51,062 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 834 transitions. [2024-10-12 22:37:51,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-10-12 22:37:51,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:51,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:37:51,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-12 22:37:51,066 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:51,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:51,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1362929664, now seen corresponding path program 1 times [2024-10-12 22:37:51,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:51,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279785567] [2024-10-12 22:37:51,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:51,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:51,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:51,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:51,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 22:37:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:51,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-10-12 22:37:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:51,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-10-12 22:37:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:51,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-10-12 22:37:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:51,859 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:51,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:51,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279785567] [2024-10-12 22:37:51,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279785567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:51,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:51,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:51,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202798390] [2024-10-12 22:37:51,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:51,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:51,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:51,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:51,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:51,862 INFO L87 Difference]: Start difference. First operand 604 states and 834 transitions. Second operand has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 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-10-12 22:37:51,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:51,941 INFO L93 Difference]: Finished difference Result 973 states and 1344 transitions. [2024-10-12 22:37:51,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:51,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 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 330 [2024-10-12 22:37:51,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:51,944 INFO L225 Difference]: With dead ends: 973 [2024-10-12 22:37:51,944 INFO L226 Difference]: Without dead ends: 604 [2024-10-12 22:37:51,944 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-10-12 22:37:51,944 INFO L432 NwaCegarLoop]: 523 mSDtfsCounter, 855 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:51,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 1048 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:51,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-12 22:37:51,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-10-12 22:37:51,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 596 states have (on average 1.3775167785234899) internal successors, (821), 596 states have internal predecessors, (821), 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-10-12 22:37:51,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 833 transitions. [2024-10-12 22:37:51,958 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 833 transitions. Word has length 330 [2024-10-12 22:37:51,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:51,958 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 833 transitions. [2024-10-12 22:37:51,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 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-10-12 22:37:51,958 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 833 transitions. [2024-10-12 22:37:51,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-10-12 22:37:51,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:51,968 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:37:51,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-12 22:37:51,968 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:51,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:51,969 INFO L85 PathProgramCache]: Analyzing trace with hash -252416955, now seen corresponding path program 1 times [2024-10-12 22:37:51,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:51,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812177395] [2024-10-12 22:37:51,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:51,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:52,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:52,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:52,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 22:37:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:52,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-10-12 22:37:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:52,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-10-12 22:37:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:52,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-10-12 22:37:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:52,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:52,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812177395] [2024-10-12 22:37:52,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812177395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:52,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:52,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:52,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585060645] [2024-10-12 22:37:52,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:52,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:52,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:52,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:52,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:52,798 INFO L87 Difference]: Start difference. First operand 604 states and 833 transitions. Second operand has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 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-10-12 22:37:52,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:52,871 INFO L93 Difference]: Finished difference Result 973 states and 1342 transitions. [2024-10-12 22:37:52,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:52,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 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 331 [2024-10-12 22:37:52,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:52,873 INFO L225 Difference]: With dead ends: 973 [2024-10-12 22:37:52,873 INFO L226 Difference]: Without dead ends: 604 [2024-10-12 22:37:52,874 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-10-12 22:37:52,874 INFO L432 NwaCegarLoop]: 523 mSDtfsCounter, 392 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:52,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 1048 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:52,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-12 22:37:52,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-10-12 22:37:52,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 596 states have (on average 1.3758389261744965) internal successors, (820), 596 states have internal predecessors, (820), 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-10-12 22:37:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 832 transitions. [2024-10-12 22:37:52,888 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 832 transitions. Word has length 331 [2024-10-12 22:37:52,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:52,888 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 832 transitions. [2024-10-12 22:37:52,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 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-10-12 22:37:52,889 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 832 transitions. [2024-10-12 22:37:52,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-10-12 22:37:52,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:52,891 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:37:52,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-12 22:37:52,891 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:52,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:52,892 INFO L85 PathProgramCache]: Analyzing trace with hash 848291183, now seen corresponding path program 1 times [2024-10-12 22:37:52,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:52,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169633098] [2024-10-12 22:37:52,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:52,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:54,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:54,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:54,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 22:37:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:54,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-12 22:37:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:54,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-12 22:37:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:54,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-10-12 22:37:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:54,410 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-12 22:37:54,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:54,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169633098] [2024-10-12 22:37:54,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169633098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:54,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:54,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:54,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567242839] [2024-10-12 22:37:54,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:54,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:54,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:54,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:54,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:54,412 INFO L87 Difference]: Start difference. First operand 604 states and 832 transitions. Second operand has 5 states, 5 states have (on average 54.4) internal successors, (272), 5 states have internal predecessors, (272), 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-10-12 22:37:54,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:54,701 INFO L93 Difference]: Finished difference Result 1053 states and 1436 transitions. [2024-10-12 22:37:54,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:37:54,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.4) internal successors, (272), 5 states have internal predecessors, (272), 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 332 [2024-10-12 22:37:54,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:54,703 INFO L225 Difference]: With dead ends: 1053 [2024-10-12 22:37:54,703 INFO L226 Difference]: Without dead ends: 612 [2024-10-12 22:37:54,703 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-10-12 22:37:54,704 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 469 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:54,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1200 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 22:37:54,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-10-12 22:37:54,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 608. [2024-10-12 22:37:54,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 600 states have (on average 1.3733333333333333) internal successors, (824), 600 states have internal predecessors, (824), 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-10-12 22:37:54,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 836 transitions. [2024-10-12 22:37:54,716 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 836 transitions. Word has length 332 [2024-10-12 22:37:54,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:54,716 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 836 transitions. [2024-10-12 22:37:54,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.4) internal successors, (272), 5 states have internal predecessors, (272), 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-10-12 22:37:54,716 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 836 transitions. [2024-10-12 22:37:54,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-10-12 22:37:54,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:54,718 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:37:54,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-12 22:37:54,718 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:54,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:54,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1390299249, now seen corresponding path program 1 times [2024-10-12 22:37:54,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:54,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598179080] [2024-10-12 22:37:54,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:54,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:55,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:55,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:55,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 22:37:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:55,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-12 22:37:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:55,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-12 22:37:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:55,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-10-12 22:37:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-10-12 22:37:55,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:55,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598179080] [2024-10-12 22:37:55,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598179080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:55,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:55,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:55,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277832805] [2024-10-12 22:37:55,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:55,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:55,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:55,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:55,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:55,552 INFO L87 Difference]: Start difference. First operand 608 states and 836 transitions. Second operand has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 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-10-12 22:37:55,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:55,701 INFO L93 Difference]: Finished difference Result 1055 states and 1434 transitions. [2024-10-12 22:37:55,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:55,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 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 332 [2024-10-12 22:37:55,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:55,708 INFO L225 Difference]: With dead ends: 1055 [2024-10-12 22:37:55,708 INFO L226 Difference]: Without dead ends: 608 [2024-10-12 22:37:55,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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-10-12 22:37:55,709 INFO L432 NwaCegarLoop]: 546 mSDtfsCounter, 2 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:55,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1491 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:55,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-10-12 22:37:55,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2024-10-12 22:37:55,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 600 states have (on average 1.3666666666666667) internal successors, (820), 600 states have internal predecessors, (820), 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-10-12 22:37:55,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 832 transitions. [2024-10-12 22:37:55,723 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 832 transitions. Word has length 332 [2024-10-12 22:37:55,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:55,724 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 832 transitions. [2024-10-12 22:37:55,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 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-10-12 22:37:55,724 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 832 transitions. [2024-10-12 22:37:55,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-10-12 22:37:55,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:55,727 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:37:55,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-12 22:37:55,727 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:55,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:55,727 INFO L85 PathProgramCache]: Analyzing trace with hash 744328405, now seen corresponding path program 1 times [2024-10-12 22:37:55,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:55,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634665100] [2024-10-12 22:37:55,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:55,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:56,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:56,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:56,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 22:37:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:56,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-10-12 22:37:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:56,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-10-12 22:37:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:56,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-10-12 22:37:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:56,641 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:56,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:56,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634665100] [2024-10-12 22:37:56,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634665100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:56,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:56,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:37:56,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593047243] [2024-10-12 22:37:56,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:56,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:37:56,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:56,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:37:56,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:56,643 INFO L87 Difference]: Start difference. First operand 608 states and 832 transitions. Second operand has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 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-10-12 22:37:56,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:56,989 INFO L93 Difference]: Finished difference Result 1422 states and 1953 transitions. [2024-10-12 22:37:56,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:37:56,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 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 334 [2024-10-12 22:37:56,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:56,996 INFO L225 Difference]: With dead ends: 1422 [2024-10-12 22:37:56,996 INFO L226 Difference]: Without dead ends: 1051 [2024-10-12 22:37:56,997 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-10-12 22:37:56,998 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 567 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 2094 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:56,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 2094 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 22:37:56,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2024-10-12 22:37:57,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 935. [2024-10-12 22:37:57,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 924 states have (on average 1.3625541125541125) internal successors, (1259), 924 states have internal predecessors, (1259), 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-10-12 22:37:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1277 transitions. [2024-10-12 22:37:57,021 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1277 transitions. Word has length 334 [2024-10-12 22:37:57,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:57,021 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1277 transitions. [2024-10-12 22:37:57,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 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-10-12 22:37:57,021 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1277 transitions. [2024-10-12 22:37:57,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-10-12 22:37:57,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:57,025 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:37:57,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-12 22:37:57,025 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:57,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:57,026 INFO L85 PathProgramCache]: Analyzing trace with hash -101311359, now seen corresponding path program 1 times [2024-10-12 22:37:57,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:57,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344463404] [2024-10-12 22:37:57,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:57,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:57,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:57,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:57,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 22:37:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:57,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-10-12 22:37:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:57,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-10-12 22:37:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:57,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-12 22:37:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:57,945 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:57,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:57,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344463404] [2024-10-12 22:37:57,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344463404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:57,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:57,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:37:57,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481628328] [2024-10-12 22:37:57,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:57,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:37:57,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:57,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:37:57,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:57,947 INFO L87 Difference]: Start difference. First operand 935 states and 1277 transitions. Second operand has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 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-10-12 22:37:58,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:58,495 INFO L93 Difference]: Finished difference Result 1329 states and 1819 transitions. [2024-10-12 22:37:58,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:37:58,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 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 335 [2024-10-12 22:37:58,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:58,503 INFO L225 Difference]: With dead ends: 1329 [2024-10-12 22:37:58,503 INFO L226 Difference]: Without dead ends: 958 [2024-10-12 22:37:58,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 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-10-12 22:37:58,505 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 1010 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:58,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 1559 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 22:37:58,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-10-12 22:37:58,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 936. [2024-10-12 22:37:58,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 925 states have (on average 1.3621621621621622) internal successors, (1260), 925 states have internal predecessors, (1260), 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-10-12 22:37:58,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1278 transitions. [2024-10-12 22:37:58,535 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1278 transitions. Word has length 335 [2024-10-12 22:37:58,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:58,535 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1278 transitions. [2024-10-12 22:37:58,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 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-10-12 22:37:58,535 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1278 transitions. [2024-10-12 22:37:58,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-10-12 22:37:58,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:58,538 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:37:58,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-12 22:37:58,538 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:58,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:58,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1966033512, now seen corresponding path program 1 times [2024-10-12 22:37:58,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:58,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501903189] [2024-10-12 22:37:58,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:58,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:59,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 22:37:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:59,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:59,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 22:37:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:59,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-10-12 22:37:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:59,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-10-12 22:37:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:59,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-12 22:37:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:59,637 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-10-12 22:37:59,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:59,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501903189] [2024-10-12 22:37:59,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501903189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:59,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:59,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 22:37:59,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352410612] [2024-10-12 22:37:59,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:59,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 22:37:59,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:59,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 22:37:59,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 22:37:59,639 INFO L87 Difference]: Start difference. First operand 936 states and 1278 transitions. Second operand has 8 states, 8 states have (on average 32.125) internal successors, (257), 8 states have internal predecessors, (257), 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-10-12 22:37:59,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:59,784 INFO L93 Difference]: Finished difference Result 2113 states and 2876 transitions. [2024-10-12 22:37:59,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 22:37:59,785 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.125) internal successors, (257), 8 states have internal predecessors, (257), 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 335 [2024-10-12 22:37:59,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:59,790 INFO L225 Difference]: With dead ends: 2113 [2024-10-12 22:37:59,790 INFO L226 Difference]: Without dead ends: 1624 [2024-10-12 22:37:59,791 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-10-12 22:37:59,793 INFO L432 NwaCegarLoop]: 1286 mSDtfsCounter, 822 mSDsluCounter, 5521 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 6807 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:59,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 6807 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:59,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2024-10-12 22:37:59,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1003. [2024-10-12 22:37:59,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 989 states have (on average 1.366026289180991) internal successors, (1351), 989 states have internal predecessors, (1351), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-12 22:37:59,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1375 transitions. [2024-10-12 22:37:59,818 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1375 transitions. Word has length 335 [2024-10-12 22:37:59,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:59,818 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1375 transitions. [2024-10-12 22:37:59,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.125) internal successors, (257), 8 states have internal predecessors, (257), 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-10-12 22:37:59,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1375 transitions. [2024-10-12 22:37:59,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-10-12 22:37:59,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:59,821 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:37:59,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-12 22:37:59,822 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:59,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:59,822 INFO L85 PathProgramCache]: Analyzing trace with hash 541248472, now seen corresponding path program 1 times [2024-10-12 22:37:59,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:59,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823431389] [2024-10-12 22:37:59,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:59,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:00,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:38:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:00,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:38:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:00,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 22:38:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:00,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-10-12 22:38:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:00,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-12 22:38:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:00,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-12 22:38:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:00,732 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-10-12 22:38:00,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:00,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823431389] [2024-10-12 22:38:00,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823431389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:00,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:00,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 22:38:00,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748817644] [2024-10-12 22:38:00,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:00,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 22:38:00,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:00,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 22:38:00,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:38:00,734 INFO L87 Difference]: Start difference. First operand 1003 states and 1375 transitions. Second operand has 7 states, 7 states have (on average 39.142857142857146) internal successors, (274), 7 states have internal predecessors, (274), 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-10-12 22:38:00,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:00,995 INFO L93 Difference]: Finished difference Result 2131 states and 2918 transitions. [2024-10-12 22:38:00,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 22:38:00,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.142857142857146) internal successors, (274), 7 states have internal predecessors, (274), 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 336 [2024-10-12 22:38:00,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:00,998 INFO L225 Difference]: With dead ends: 2131 [2024-10-12 22:38:00,999 INFO L226 Difference]: Without dead ends: 1019 [2024-10-12 22:38:01,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 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-10-12 22:38:01,000 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 630 mSDsluCounter, 1974 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:01,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 2501 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 22:38:01,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2024-10-12 22:38:01,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1011. [2024-10-12 22:38:01,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 997 states have (on average 1.3590772316950852) internal successors, (1355), 997 states have internal predecessors, (1355), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-12 22:38:01,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1379 transitions. [2024-10-12 22:38:01,021 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1379 transitions. Word has length 336 [2024-10-12 22:38:01,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:01,021 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1379 transitions. [2024-10-12 22:38:01,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.142857142857146) internal successors, (274), 7 states have internal predecessors, (274), 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-10-12 22:38:01,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1379 transitions. [2024-10-12 22:38:01,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-10-12 22:38:01,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:01,024 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:38:01,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-12 22:38:01,024 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:01,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:01,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1114654100, now seen corresponding path program 1 times [2024-10-12 22:38:01,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:01,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950148178] [2024-10-12 22:38:01,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:01,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:02,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 22:38:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:02,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:38:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:02,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 22:38:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:02,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-12 22:38:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:02,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-10-12 22:38:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:02,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-10-12 22:38:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:02,106 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-10-12 22:38:02,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:02,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950148178] [2024-10-12 22:38:02,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950148178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:02,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:02,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 22:38:02,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311102172] [2024-10-12 22:38:02,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:02,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 22:38:02,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:02,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 22:38:02,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 22:38:02,108 INFO L87 Difference]: Start difference. First operand 1011 states and 1379 transitions. Second operand has 8 states, 8 states have (on average 35.125) internal successors, (281), 8 states have internal predecessors, (281), 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-10-12 22:38:02,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:02,710 INFO L93 Difference]: Finished difference Result 2517 states and 3402 transitions. [2024-10-12 22:38:02,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 22:38:02,710 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 35.125) internal successors, (281), 8 states have internal predecessors, (281), 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 338 [2024-10-12 22:38:02,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:02,716 INFO L225 Difference]: With dead ends: 2517 [2024-10-12 22:38:02,716 INFO L226 Difference]: Without dead ends: 1877 [2024-10-12 22:38:02,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-12 22:38:02,718 INFO L432 NwaCegarLoop]: 414 mSDtfsCounter, 909 mSDsluCounter, 2002 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 2416 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:02,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 2416 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 22:38:02,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2024-10-12 22:38:02,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1869. [2024-10-12 22:38:02,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1843 states have (on average 1.3505154639175259) internal successors, (2489), 1843 states have internal predecessors, (2489), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-12 22:38:02,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2537 transitions. [2024-10-12 22:38:02,756 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2537 transitions. Word has length 338 [2024-10-12 22:38:02,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:02,756 INFO L471 AbstractCegarLoop]: Abstraction has 1869 states and 2537 transitions. [2024-10-12 22:38:02,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 35.125) internal successors, (281), 8 states have internal predecessors, (281), 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-10-12 22:38:02,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2537 transitions. [2024-10-12 22:38:02,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-10-12 22:38:02,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:02,761 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:38:02,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-12 22:38:02,761 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:02,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:02,761 INFO L85 PathProgramCache]: Analyzing trace with hash 366505692, now seen corresponding path program 1 times [2024-10-12 22:38:02,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:02,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472190157] [2024-10-12 22:38:02,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:02,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:03,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 22:38:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:03,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:38:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:03,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 22:38:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:03,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-10-12 22:38:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:03,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-10-12 22:38:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:03,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-10-12 22:38:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:03,809 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-10-12 22:38:03,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:03,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472190157] [2024-10-12 22:38:03,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472190157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:03,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:03,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 22:38:03,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977193483] [2024-10-12 22:38:03,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:03,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 22:38:03,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:03,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 22:38:03,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:38:03,812 INFO L87 Difference]: Start difference. First operand 1869 states and 2537 transitions. Second operand has 7 states, 7 states have (on average 35.857142857142854) internal successors, (251), 7 states have internal predecessors, (251), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 22:38:04,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:04,207 INFO L93 Difference]: Finished difference Result 3532 states and 4783 transitions. [2024-10-12 22:38:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:38:04,207 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.857142857142854) internal successors, (251), 7 states have internal predecessors, (251), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 340 [2024-10-12 22:38:04,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:04,213 INFO L225 Difference]: With dead ends: 3532 [2024-10-12 22:38:04,213 INFO L226 Difference]: Without dead ends: 1901 [2024-10-12 22:38:04,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-12 22:38:04,215 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 1035 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:04,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 1547 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 22:38:04,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2024-10-12 22:38:04,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1885. [2024-10-12 22:38:04,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1885 states, 1859 states have (on average 1.3431952662721893) internal successors, (2497), 1859 states have internal predecessors, (2497), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-12 22:38:04,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 2545 transitions. [2024-10-12 22:38:04,266 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 2545 transitions. Word has length 340 [2024-10-12 22:38:04,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:04,266 INFO L471 AbstractCegarLoop]: Abstraction has 1885 states and 2545 transitions. [2024-10-12 22:38:04,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.857142857142854) internal successors, (251), 7 states have internal predecessors, (251), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 22:38:04,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2545 transitions. [2024-10-12 22:38:04,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-10-12 22:38:04,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:04,272 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:38:04,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-12 22:38:04,272 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:04,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:04,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1624562388, now seen corresponding path program 1 times [2024-10-12 22:38:04,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:04,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926621594] [2024-10-12 22:38:04,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:04,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:05,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 22:38:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:05,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:38:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:05,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 22:38:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:05,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-10-12 22:38:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:05,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-12 22:38:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:05,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-12 22:38:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:05,187 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-10-12 22:38:05,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:05,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926621594] [2024-10-12 22:38:05,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926621594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:05,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:05,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:38:05,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786328894] [2024-10-12 22:38:05,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:05,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:38:05,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:05,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:38:05,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:38:05,189 INFO L87 Difference]: Start difference. First operand 1885 states and 2545 transitions. Second operand has 6 states, 6 states have (on average 42.166666666666664) internal successors, (253), 6 states have internal predecessors, (253), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 22:38:05,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:05,557 INFO L93 Difference]: Finished difference Result 3512 states and 4733 transitions. [2024-10-12 22:38:05,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:38:05,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.166666666666664) internal successors, (253), 6 states have internal predecessors, (253), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 342 [2024-10-12 22:38:05,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:05,566 INFO L225 Difference]: With dead ends: 3512 [2024-10-12 22:38:05,566 INFO L226 Difference]: Without dead ends: 1901 [2024-10-12 22:38:05,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-12 22:38:05,572 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 498 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:05,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 1547 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 22:38:05,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2024-10-12 22:38:05,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1893. [2024-10-12 22:38:05,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1867 states have (on average 1.3417246920192822) internal successors, (2505), 1867 states have internal predecessors, (2505), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-12 22:38:05,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2553 transitions. [2024-10-12 22:38:05,608 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2553 transitions. Word has length 342 [2024-10-12 22:38:05,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:05,609 INFO L471 AbstractCegarLoop]: Abstraction has 1893 states and 2553 transitions. [2024-10-12 22:38:05,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.166666666666664) internal successors, (253), 6 states have internal predecessors, (253), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 22:38:05,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2553 transitions. [2024-10-12 22:38:05,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-10-12 22:38:05,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:05,613 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:38:05,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-12 22:38:05,613 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:05,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:05,614 INFO L85 PathProgramCache]: Analyzing trace with hash -526007198, now seen corresponding path program 1 times [2024-10-12 22:38:05,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:05,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419845569] [2024-10-12 22:38:05,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:05,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:06,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 22:38:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:06,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 22:38:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:06,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 22:38:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:06,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-12 22:38:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:06,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-10-12 22:38:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:06,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2024-10-12 22:38:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:06,501 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-10-12 22:38:06,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:06,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419845569] [2024-10-12 22:38:06,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419845569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:06,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:06,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:38:06,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971369047] [2024-10-12 22:38:06,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:06,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:38:06,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:06,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:38:06,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:38:06,504 INFO L87 Difference]: Start difference. First operand 1893 states and 2553 transitions. Second operand has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 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-10-12 22:38:06,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:06,810 INFO L93 Difference]: Finished difference Result 1903 states and 2561 transitions. [2024-10-12 22:38:06,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:38:06,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 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 344 [2024-10-12 22:38:06,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:06,814 INFO L225 Difference]: With dead ends: 1903 [2024-10-12 22:38:06,814 INFO L226 Difference]: Without dead ends: 1031 [2024-10-12 22:38:06,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-12 22:38:06,815 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 510 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:06,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1547 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 22:38:06,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2024-10-12 22:38:06,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1027. [2024-10-12 22:38:06,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1013 states have (on average 1.3494570582428431) internal successors, (1367), 1013 states have internal predecessors, (1367), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-12 22:38:06,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1391 transitions. [2024-10-12 22:38:06,832 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1391 transitions. Word has length 344 [2024-10-12 22:38:06,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:06,832 INFO L471 AbstractCegarLoop]: Abstraction has 1027 states and 1391 transitions. [2024-10-12 22:38:06,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 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-10-12 22:38:06,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1391 transitions. [2024-10-12 22:38:06,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-10-12 22:38:06,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:06,835 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:38:06,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-12 22:38:06,835 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:06,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:06,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1627115852, now seen corresponding path program 1 times [2024-10-12 22:38:06,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:06,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69111660] [2024-10-12 22:38:06,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:06,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:09,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 22:38:09,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:09,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 22:38:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:09,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 22:38:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:09,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-10-12 22:38:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:09,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-10-12 22:38:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:09,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-10-12 22:38:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-12 22:38:09,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:09,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69111660] [2024-10-12 22:38:09,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69111660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:09,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:09,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 22:38:09,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027087027] [2024-10-12 22:38:09,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:09,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 22:38:09,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:09,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 22:38:09,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-12 22:38:09,094 INFO L87 Difference]: Start difference. First operand 1027 states and 1391 transitions. Second operand has 10 states, 10 states have (on average 27.0) internal successors, (270), 10 states have internal predecessors, (270), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 22:38:09,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:09,401 INFO L93 Difference]: Finished difference Result 1982 states and 2678 transitions. [2024-10-12 22:38:09,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 22:38:09,401 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.0) internal successors, (270), 10 states have internal predecessors, (270), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 344 [2024-10-12 22:38:09,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:09,405 INFO L225 Difference]: With dead ends: 1982 [2024-10-12 22:38:09,408 INFO L226 Difference]: Without dead ends: 1356 [2024-10-12 22:38:09,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-10-12 22:38:09,410 INFO L432 NwaCegarLoop]: 808 mSDtfsCounter, 1288 mSDsluCounter, 4453 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 5261 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:09,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 5261 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 22:38:09,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2024-10-12 22:38:09,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1059. [2024-10-12 22:38:09,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 1043 states have (on average 1.3499520613614573) internal successors, (1408), 1043 states have internal predecessors, (1408), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-12 22:38:09,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1436 transitions. [2024-10-12 22:38:09,431 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1436 transitions. Word has length 344 [2024-10-12 22:38:09,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:09,431 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1436 transitions. [2024-10-12 22:38:09,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.0) internal successors, (270), 10 states have internal predecessors, (270), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 22:38:09,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1436 transitions. [2024-10-12 22:38:09,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-10-12 22:38:09,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:09,435 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:38:09,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-12 22:38:09,435 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:09,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:09,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1968053996, now seen corresponding path program 1 times [2024-10-12 22:38:09,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:09,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46995827] [2024-10-12 22:38:09,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:09,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:11,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 22:38:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:11,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 22:38:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:11,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 22:38:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:11,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-10-12 22:38:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:11,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-10-12 22:38:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:11,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-10-12 22:38:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:11,162 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 4 proven. 82 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:11,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:11,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46995827] [2024-10-12 22:38:11,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46995827] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 22:38:11,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120742259] [2024-10-12 22:38:11,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:11,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 22:38:11,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 22:38:11,165 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 22:38:11,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 22:38:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:11,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 2043 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-12 22:38:11,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:38:12,663 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 78 proven. 6 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-12 22:38:12,663 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 22:38:13,590 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 64 proven. 3 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-10-12 22:38:13,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120742259] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 22:38:13,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 22:38:13,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2024-10-12 22:38:13,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349082992] [2024-10-12 22:38:13,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 22:38:13,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-12 22:38:13,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:13,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-12 22:38:13,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2024-10-12 22:38:13,593 INFO L87 Difference]: Start difference. First operand 1059 states and 1436 transitions. Second operand has 25 states, 25 states have (on average 34.08) internal successors, (852), 25 states have internal predecessors, (852), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-10-12 22:38:14,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:14,901 INFO L93 Difference]: Finished difference Result 1883 states and 2542 transitions. [2024-10-12 22:38:14,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-12 22:38:14,901 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 34.08) internal successors, (852), 25 states have internal predecessors, (852), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 344 [2024-10-12 22:38:14,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:14,904 INFO L225 Difference]: With dead ends: 1883 [2024-10-12 22:38:14,904 INFO L226 Difference]: Without dead ends: 1087 [2024-10-12 22:38:14,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 687 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=332, Invalid=1830, Unknown=0, NotChecked=0, Total=2162 [2024-10-12 22:38:14,906 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 1104 mSDsluCounter, 5910 mSDsCounter, 0 mSdLazyCounter, 3146 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1104 SdHoareTripleChecker+Valid, 6391 SdHoareTripleChecker+Invalid, 3150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:14,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1104 Valid, 6391 Invalid, 3150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3146 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 22:38:14,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2024-10-12 22:38:14,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1075. [2024-10-12 22:38:14,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 1059 states have (on average 1.3408876298394712) internal successors, (1420), 1059 states have internal predecessors, (1420), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-12 22:38:14,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1448 transitions. [2024-10-12 22:38:14,925 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1448 transitions. Word has length 344 [2024-10-12 22:38:14,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:14,926 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1448 transitions. [2024-10-12 22:38:14,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 34.08) internal successors, (852), 25 states have internal predecessors, (852), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-10-12 22:38:14,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1448 transitions. [2024-10-12 22:38:14,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-10-12 22:38:14,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:14,933 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:38:14,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 22:38:15,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 22:38:15,135 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:15,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:15,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1019445219, now seen corresponding path program 1 times [2024-10-12 22:38:15,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:15,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037414859] [2024-10-12 22:38:15,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:15,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:15,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 22:38:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:15,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 22:38:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:15,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 22:38:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:15,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-12 22:38:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:15,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-10-12 22:38:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:15,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-10-12 22:38:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:15,652 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-12 22:38:15,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:15,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037414859] [2024-10-12 22:38:15,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037414859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:15,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:15,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:15,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493202147] [2024-10-12 22:38:15,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:15,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:15,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:15,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:15,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:15,654 INFO L87 Difference]: Start difference. First operand 1075 states and 1448 transitions. Second operand has 5 states, 5 states have (on average 58.2) internal successors, (291), 5 states have internal predecessors, (291), 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-10-12 22:38:15,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:15,684 INFO L93 Difference]: Finished difference Result 1753 states and 2365 transitions. [2024-10-12 22:38:15,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:38:15,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 58.2) internal successors, (291), 5 states have internal predecessors, (291), 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 348 [2024-10-12 22:38:15,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:15,687 INFO L225 Difference]: With dead ends: 1753 [2024-10-12 22:38:15,687 INFO L226 Difference]: Without dead ends: 1131 [2024-10-12 22:38:15,688 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-10-12 22:38:15,688 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 16 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2167 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:15,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2167 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:38:15,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2024-10-12 22:38:15,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1131. [2024-10-12 22:38:15,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 1115 states have (on average 1.345291479820628) internal successors, (1500), 1115 states have internal predecessors, (1500), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-12 22:38:15,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1528 transitions. [2024-10-12 22:38:15,705 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1528 transitions. Word has length 348 [2024-10-12 22:38:15,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:15,705 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 1528 transitions. [2024-10-12 22:38:15,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.2) internal successors, (291), 5 states have internal predecessors, (291), 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-10-12 22:38:15,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1528 transitions. [2024-10-12 22:38:15,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-10-12 22:38:15,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:15,708 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:38:15,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-12 22:38:15,708 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:15,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:15,709 INFO L85 PathProgramCache]: Analyzing trace with hash -72193039, now seen corresponding path program 1 times [2024-10-12 22:38:15,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:15,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195878224] [2024-10-12 22:38:15,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:15,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:17,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 22:38:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:17,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 22:38:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:17,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 22:38:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:17,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-12 22:38:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:17,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-10-12 22:38:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:17,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-10-12 22:38:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:17,382 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-12 22:38:17,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:17,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195878224] [2024-10-12 22:38:17,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195878224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:17,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:17,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 22:38:17,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532475911] [2024-10-12 22:38:17,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:17,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 22:38:17,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:17,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 22:38:17,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-12 22:38:17,383 INFO L87 Difference]: Start difference. First operand 1131 states and 1528 transitions. Second operand has 9 states, 9 states have (on average 31.11111111111111) internal successors, (280), 9 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 22:38:18,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:18,240 INFO L93 Difference]: Finished difference Result 2707 states and 3622 transitions. [2024-10-12 22:38:18,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 22:38:18,240 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 31.11111111111111) internal successors, (280), 9 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 349 [2024-10-12 22:38:18,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:18,243 INFO L225 Difference]: With dead ends: 2707 [2024-10-12 22:38:18,243 INFO L226 Difference]: Without dead ends: 1953 [2024-10-12 22:38:18,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-10-12 22:38:18,245 INFO L432 NwaCegarLoop]: 603 mSDtfsCounter, 1343 mSDsluCounter, 2743 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1344 SdHoareTripleChecker+Valid, 3346 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:18,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1344 Valid, 3346 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 22:38:18,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2024-10-12 22:38:18,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1304. [2024-10-12 22:38:18,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 1283 states have (on average 1.3468433359314107) internal successors, (1728), 1283 states have internal predecessors, (1728), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-12 22:38:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1766 transitions. [2024-10-12 22:38:18,275 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1766 transitions. Word has length 349 [2024-10-12 22:38:18,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:18,276 INFO L471 AbstractCegarLoop]: Abstraction has 1304 states and 1766 transitions. [2024-10-12 22:38:18,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 31.11111111111111) internal successors, (280), 9 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 22:38:18,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1766 transitions. [2024-10-12 22:38:18,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-10-12 22:38:18,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:18,280 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:38:18,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-12 22:38:18,280 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:18,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:18,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1783097521, now seen corresponding path program 1 times [2024-10-12 22:38:18,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:18,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715425290] [2024-10-12 22:38:18,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:18,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:22,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 22:38:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:22,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 22:38:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:22,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 22:38:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:22,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-12 22:38:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:22,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-10-12 22:38:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:22,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-10-12 22:38:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:22,734 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 50 proven. 36 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-12 22:38:22,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:22,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715425290] [2024-10-12 22:38:22,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715425290] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 22:38:22,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664785778] [2024-10-12 22:38:22,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:22,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 22:38:22,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 22:38:22,737 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 22:38:22,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 22:38:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:23,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 2052 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 22:38:23,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:38:23,985 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-10-12 22:38:23,986 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 22:38:23,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664785778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:23,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 22:38:23,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 21 [2024-10-12 22:38:23,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650490289] [2024-10-12 22:38:23,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:23,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:38:23,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:23,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:38:23,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-10-12 22:38:23,988 INFO L87 Difference]: Start difference. First operand 1304 states and 1766 transitions. Second operand has 6 states, 5 states have (on average 55.2) internal successors, (276), 6 states have internal predecessors, (276), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 22:38:24,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:24,035 INFO L93 Difference]: Finished difference Result 2269 states and 3068 transitions. [2024-10-12 22:38:24,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:38:24,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 55.2) internal successors, (276), 6 states have internal predecessors, (276), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 349 [2024-10-12 22:38:24,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:24,039 INFO L225 Difference]: With dead ends: 2269 [2024-10-12 22:38:24,039 INFO L226 Difference]: Without dead ends: 1304 [2024-10-12 22:38:24,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-10-12 22:38:24,041 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 0 mSDsluCounter, 2159 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2703 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:24,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2703 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:38:24,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2024-10-12 22:38:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1304. [2024-10-12 22:38:24,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 1283 states have (on average 1.3390491036632892) internal successors, (1718), 1283 states have internal predecessors, (1718), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-12 22:38:24,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1756 transitions. [2024-10-12 22:38:24,063 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1756 transitions. Word has length 349 [2024-10-12 22:38:24,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:24,063 INFO L471 AbstractCegarLoop]: Abstraction has 1304 states and 1756 transitions. [2024-10-12 22:38:24,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 55.2) internal successors, (276), 6 states have internal predecessors, (276), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 22:38:24,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1756 transitions. [2024-10-12 22:38:24,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-10-12 22:38:24,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38: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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:38:24,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 22:38:24,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2024-10-12 22:38:24,267 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:24,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:24,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1555587349, now seen corresponding path program 1 times [2024-10-12 22:38:24,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:24,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126996061] [2024-10-12 22:38:24,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:24,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:28,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 22:38:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:28,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 22:38:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:28,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 22:38:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:28,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-12 22:38:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:28,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-12 22:38:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:28,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-10-12 22:38:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:28,763 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 51 proven. 36 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-12 22:38:28,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:28,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126996061] [2024-10-12 22:38:28,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126996061] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 22:38:28,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120941155] [2024-10-12 22:38:28,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:28,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 22:38:28,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 22:38:28,765 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 22:38:28,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 22:38:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:29,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 2058 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-12 22:38:29,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:38:30,122 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-12 22:38:30,123 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 22:38:30,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120941155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:30,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 22:38:30,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 23 [2024-10-12 22:38:30,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320889917] [2024-10-12 22:38:30,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:30,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 22:38:30,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:30,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 22:38:30,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2024-10-12 22:38:30,125 INFO L87 Difference]: Start difference. First operand 1304 states and 1756 transitions. Second operand has 8 states, 8 states have (on average 40.5) internal successors, (324), 8 states have internal predecessors, (324), 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-10-12 22:38:30,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:30,641 INFO L93 Difference]: Finished difference Result 2862 states and 3861 transitions. [2024-10-12 22:38:30,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 22:38:30,641 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 40.5) internal successors, (324), 8 states have internal predecessors, (324), 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 351 [2024-10-12 22:38:30,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:30,645 INFO L225 Difference]: With dead ends: 2862 [2024-10-12 22:38:30,645 INFO L226 Difference]: Without dead ends: 2277 [2024-10-12 22:38:30,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2024-10-12 22:38:30,646 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 930 mSDsluCounter, 1862 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:30,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 2255 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 22:38:30,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2277 states. [2024-10-12 22:38:30,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2277 to 1931. [2024-10-12 22:38:30,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1931 states, 1895 states have (on average 1.3229551451187336) internal successors, (2507), 1895 states have internal predecessors, (2507), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-12 22:38:30,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2575 transitions. [2024-10-12 22:38:30,688 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2575 transitions. Word has length 351 [2024-10-12 22:38:30,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:30,689 INFO L471 AbstractCegarLoop]: Abstraction has 1931 states and 2575 transitions. [2024-10-12 22:38:30,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.5) internal successors, (324), 8 states have internal predecessors, (324), 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-10-12 22:38:30,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2575 transitions. [2024-10-12 22:38:30,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-10-12 22:38:30,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:30,693 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:38:30,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 22:38:30,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 22:38:30,894 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:30,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:30,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1735365702, now seen corresponding path program 1 times [2024-10-12 22:38:30,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:30,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636223081] [2024-10-12 22:38:30,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:30,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:32,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 22:38:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:32,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 22:38:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:32,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 22:38:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:32,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-12 22:38:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:32,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-12 22:38:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:32,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-10-12 22:38:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:32,102 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:32,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:32,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636223081] [2024-10-12 22:38:32,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636223081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:32,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:32,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:38:32,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849971324] [2024-10-12 22:38:32,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:32,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:38:32,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:32,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:38:32,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:38:32,105 INFO L87 Difference]: Start difference. First operand 1931 states and 2575 transitions. Second operand has 6 states, 6 states have (on average 54.166666666666664) internal successors, (325), 6 states have internal predecessors, (325), 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-10-12 22:38:32,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:32,565 INFO L93 Difference]: Finished difference Result 3311 states and 4391 transitions. [2024-10-12 22:38:32,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 22:38:32,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 54.166666666666664) internal successors, (325), 6 states have internal predecessors, (325), 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 352 [2024-10-12 22:38:32,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:32,570 INFO L225 Difference]: With dead ends: 3311 [2024-10-12 22:38:32,570 INFO L226 Difference]: Without dead ends: 2760 [2024-10-12 22:38:32,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-12 22:38:32,572 INFO L432 NwaCegarLoop]: 603 mSDtfsCounter, 699 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 2189 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:32,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 2189 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 22:38:32,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2024-10-12 22:38:32,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 2526. [2024-10-12 22:38:32,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2526 states, 2490 states have (on average 1.3036144578313253) internal successors, (3246), 2490 states have internal predecessors, (3246), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-12 22:38:32,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 3314 transitions. [2024-10-12 22:38:32,616 INFO L78 Accepts]: Start accepts. Automaton has 2526 states and 3314 transitions. Word has length 352 [2024-10-12 22:38:32,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:32,617 INFO L471 AbstractCegarLoop]: Abstraction has 2526 states and 3314 transitions. [2024-10-12 22:38:32,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 54.166666666666664) internal successors, (325), 6 states have internal predecessors, (325), 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-10-12 22:38:32,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 3314 transitions. [2024-10-12 22:38:32,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-10-12 22:38:32,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:32,623 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:38:32,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-12 22:38:32,623 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:32,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:32,623 INFO L85 PathProgramCache]: Analyzing trace with hash 921459997, now seen corresponding path program 1 times [2024-10-12 22:38:32,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:32,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674562239] [2024-10-12 22:38:32,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:32,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:36,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 22:38:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:36,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 22:38:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:36,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 22:38:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:36,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-12 22:38:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:36,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-12 22:38:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:36,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-10-12 22:38:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:36,394 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 50 proven. 37 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:36,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:36,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674562239] [2024-10-12 22:38:36,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674562239] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 22:38:36,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756743044] [2024-10-12 22:38:36,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:36,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 22:38:36,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 22:38:36,397 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 22:38:36,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 22:38:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:37,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 2061 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 22:38:37,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:38:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-12 22:38:37,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 22:38:37,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756743044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:37,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 22:38:37,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 22 [2024-10-12 22:38:37,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905620374] [2024-10-12 22:38:37,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:37,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:38:37,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:37,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:38:37,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2024-10-12 22:38:37,620 INFO L87 Difference]: Start difference. First operand 2526 states and 3314 transitions. Second operand has 6 states, 5 states have (on average 55.0) internal successors, (275), 6 states have internal predecessors, (275), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 22:38:37,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:37,676 INFO L93 Difference]: Finished difference Result 4574 states and 5982 transitions. [2024-10-12 22:38:37,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:38:37,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 55.0) internal successors, (275), 6 states have internal predecessors, (275), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 352 [2024-10-12 22:38:37,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:37,680 INFO L225 Difference]: With dead ends: 4574 [2024-10-12 22:38:37,681 INFO L226 Difference]: Without dead ends: 2526 [2024-10-12 22:38:37,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2024-10-12 22:38:37,684 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 0 mSDsluCounter, 2155 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2698 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:37,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2698 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:38:37,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states. [2024-10-12 22:38:37,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 2526. [2024-10-12 22:38:37,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2526 states, 2490 states have (on average 1.3008032128514055) internal successors, (3239), 2490 states have internal predecessors, (3239), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-12 22:38:37,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 3307 transitions. [2024-10-12 22:38:37,726 INFO L78 Accepts]: Start accepts. Automaton has 2526 states and 3307 transitions. Word has length 352 [2024-10-12 22:38:37,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:37,726 INFO L471 AbstractCegarLoop]: Abstraction has 2526 states and 3307 transitions. [2024-10-12 22:38:37,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 55.0) internal successors, (275), 6 states have internal predecessors, (275), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 22:38:37,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 3307 transitions. [2024-10-12 22:38:37,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-10-12 22:38:37,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:37,731 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:38:37,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 22:38:37,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2024-10-12 22:38:37,932 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:37,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:37,932 INFO L85 PathProgramCache]: Analyzing trace with hash 775757118, now seen corresponding path program 1 times [2024-10-12 22:38:37,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:37,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160513263] [2024-10-12 22:38:37,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:37,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:39,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 22:38:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:39,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 22:38:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:39,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:38:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:39,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-12 22:38:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:39,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-12 22:38:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:39,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-10-12 22:38:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:39,179 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:39,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:39,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160513263] [2024-10-12 22:38:39,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160513263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:39,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:39,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 22:38:39,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172658955] [2024-10-12 22:38:39,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:39,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 22:38:39,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:39,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 22:38:39,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 22:38:39,180 INFO L87 Difference]: Start difference. First operand 2526 states and 3307 transitions. Second operand has 8 states, 8 states have (on average 40.625) internal successors, (325), 8 states have internal predecessors, (325), 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-10-12 22:38:39,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:39,850 INFO L93 Difference]: Finished difference Result 4019 states and 5279 transitions. [2024-10-12 22:38:39,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 22:38:39,850 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 40.625) internal successors, (325), 8 states have internal predecessors, (325), 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 352 [2024-10-12 22:38:39,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:39,855 INFO L225 Difference]: With dead ends: 4019 [2024-10-12 22:38:39,855 INFO L226 Difference]: Without dead ends: 3426 [2024-10-12 22:38:39,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-12 22:38:39,857 INFO L432 NwaCegarLoop]: 689 mSDtfsCounter, 749 mSDsluCounter, 3106 mSDsCounter, 0 mSdLazyCounter, 1575 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 3795 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:39,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 3795 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1575 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 22:38:39,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3426 states. [2024-10-12 22:38:39,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3426 to 3407. [2024-10-12 22:38:39,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3407 states, 3363 states have (on average 1.3003270889087124) internal successors, (4373), 3363 states have internal predecessors, (4373), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-12 22:38:39,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3407 states to 3407 states and 4457 transitions. [2024-10-12 22:38:39,908 INFO L78 Accepts]: Start accepts. Automaton has 3407 states and 4457 transitions. Word has length 352 [2024-10-12 22:38:39,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:39,908 INFO L471 AbstractCegarLoop]: Abstraction has 3407 states and 4457 transitions. [2024-10-12 22:38:39,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.625) internal successors, (325), 8 states have internal predecessors, (325), 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-10-12 22:38:39,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3407 states and 4457 transitions. [2024-10-12 22:38:39,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-10-12 22:38:39,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:39,914 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:38:39,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-10-12 22:38:39,914 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:39,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:39,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1772218397, now seen corresponding path program 1 times [2024-10-12 22:38:39,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:39,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261859475] [2024-10-12 22:38:39,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:39,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:41,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 22:38:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:41,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 22:38:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:41,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 22:38:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:41,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-12 22:38:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:41,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-12 22:38:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:41,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-10-12 22:38:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:41,026 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:41,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:41,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261859475] [2024-10-12 22:38:41,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261859475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:41,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:41,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 22:38:41,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928900496] [2024-10-12 22:38:41,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:41,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 22:38:41,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:41,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 22:38:41,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:38:41,027 INFO L87 Difference]: Start difference. First operand 3407 states and 4457 transitions. Second operand has 7 states, 7 states have (on average 46.42857142857143) internal successors, (325), 7 states have internal predecessors, (325), 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-10-12 22:38:41,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:41,437 INFO L93 Difference]: Finished difference Result 4200 states and 5529 transitions. [2024-10-12 22:38:41,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:38:41,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 46.42857142857143) internal successors, (325), 7 states have internal predecessors, (325), 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 352 [2024-10-12 22:38:41,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:41,444 INFO L225 Difference]: With dead ends: 4200 [2024-10-12 22:38:41,444 INFO L226 Difference]: Without dead ends: 3602 [2024-10-12 22:38:41,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 22:38:41,446 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 2041 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2044 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:41,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2044 Valid, 1545 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 22:38:41,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3602 states. [2024-10-12 22:38:41,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3602 to 2779. [2024-10-12 22:38:41,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2779 states, 2741 states have (on average 1.3071871579715433) internal successors, (3583), 2741 states have internal predecessors, (3583), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-12 22:38:41,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 3655 transitions. [2024-10-12 22:38:41,493 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 3655 transitions. Word has length 352 [2024-10-12 22:38:41,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:41,494 INFO L471 AbstractCegarLoop]: Abstraction has 2779 states and 3655 transitions. [2024-10-12 22:38:41,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.42857142857143) internal successors, (325), 7 states have internal predecessors, (325), 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-10-12 22:38:41,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 3655 transitions. [2024-10-12 22:38:41,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2024-10-12 22:38:41,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:41,498 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:38:41,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-10-12 22:38:41,498 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:41,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:41,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1494012478, now seen corresponding path program 1 times [2024-10-12 22:38:41,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:41,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138211412] [2024-10-12 22:38:41,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:41,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:42,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 22:38:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:42,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 22:38:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:42,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 22:38:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:42,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-10-12 22:38:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:42,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-10-12 22:38:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:42,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-10-12 22:38:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-12 22:38:42,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:42,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138211412] [2024-10-12 22:38:42,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138211412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:42,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:42,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:38:42,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336659157] [2024-10-12 22:38:42,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:42,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:38:42,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:42,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:38:42,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:38:42,066 INFO L87 Difference]: Start difference. First operand 2779 states and 3655 transitions. Second operand has 6 states, 6 states have (on average 47.333333333333336) internal successors, (284), 6 states have internal predecessors, (284), 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-10-12 22:38:42,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:42,357 INFO L93 Difference]: Finished difference Result 4680 states and 6126 transitions. [2024-10-12 22:38:42,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:38:42,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 47.333333333333336) internal successors, (284), 6 states have internal predecessors, (284), 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 353 [2024-10-12 22:38:42,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:42,361 INFO L225 Difference]: With dead ends: 4680 [2024-10-12 22:38:42,361 INFO L226 Difference]: Without dead ends: 2859 [2024-10-12 22:38:42,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:38:42,364 INFO L432 NwaCegarLoop]: 397 mSDtfsCounter, 504 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:42,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1577 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 22:38:42,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2024-10-12 22:38:42,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2819. [2024-10-12 22:38:42,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2819 states, 2781 states have (on average 1.3027687882056813) internal successors, (3623), 2781 states have internal predecessors, (3623), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-12 22:38:42,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 3695 transitions. [2024-10-12 22:38:42,407 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 3695 transitions. Word has length 353 [2024-10-12 22:38:42,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:42,408 INFO L471 AbstractCegarLoop]: Abstraction has 2819 states and 3695 transitions. [2024-10-12 22:38:42,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 47.333333333333336) internal successors, (284), 6 states have internal predecessors, (284), 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-10-12 22:38:42,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 3695 transitions. [2024-10-12 22:38:42,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2024-10-12 22:38:42,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:42,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:38:42,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-10-12 22:38:42,413 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:42,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:42,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1230543474, now seen corresponding path program 1 times [2024-10-12 22:38:42,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:42,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059296912] [2024-10-12 22:38:42,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:42,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat