./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_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 dcf39230c24eb915e747e88202e73a35b6e85db9fcbfa83adc9e68e89fc807d5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:55:53,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:55:53,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 01:55:53,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:55:53,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:55:53,519 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:55:53,520 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:55:53,520 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:55:53,521 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:55:53,521 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:55:53,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:55:53,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:55:53,523 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:55:53,525 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:55:53,525 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:55:53,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:55:53,527 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:55:53,527 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 01:55:53,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:55:53,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:55:53,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:55:53,532 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:55:53,533 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:55:53,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:55:53,533 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:55:53,533 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:55:53,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:55:53,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:55:53,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:55:53,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:55:53,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:55:53,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:55:53,536 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:55:53,536 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 01:55:53,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 01:55:53,537 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:55:53,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:55:53,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:55:53,538 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:55:53,538 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 -> dcf39230c24eb915e747e88202e73a35b6e85db9fcbfa83adc9e68e89fc807d5 [2024-11-10 01:55:53,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:55:53,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:55:53,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:55:53,821 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:55:53,821 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:55:53,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c [2024-11-10 01:55:55,290 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:55:55,536 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:55:55,536 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c [2024-11-10 01:55:55,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52f8ffc68/25e4e4fa448a4965baa300497515d56e/FLAG2f0d708f9 [2024-11-10 01:55:55,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52f8ffc68/25e4e4fa448a4965baa300497515d56e [2024-11-10 01:55:55,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:55:55,577 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:55:55,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:55:55,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:55:55,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:55:55,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:55:55" (1/1) ... [2024-11-10 01:55:55,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@113f50d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:55, skipping insertion in model container [2024-11-10 01:55:55,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:55:55" (1/1) ... [2024-11-10 01:55:55,629 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:55:55,800 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c[1279,1292] [2024-11-10 01:55:56,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:55:56,013 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:55:56,022 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c[1279,1292] [2024-11-10 01:55:56,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:55:56,165 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:55:56,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:56 WrapperNode [2024-11-10 01:55:56,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:55:56,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:55:56,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:55:56,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:55:56,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:56" (1/1) ... [2024-11-10 01:55:56,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:56" (1/1) ... [2024-11-10 01:55:56,350 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1382 [2024-11-10 01:55:56,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:55:56,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:55:56,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:55:56,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:55:56,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:56" (1/1) ... [2024-11-10 01:55:56,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:56" (1/1) ... [2024-11-10 01:55:56,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:56" (1/1) ... [2024-11-10 01:55:56,468 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 01:55:56,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:56" (1/1) ... [2024-11-10 01:55:56,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:56" (1/1) ... [2024-11-10 01:55:56,514 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:56" (1/1) ... [2024-11-10 01:55:56,530 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:56" (1/1) ... [2024-11-10 01:55:56,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:56" (1/1) ... [2024-11-10 01:55:56,567 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:56" (1/1) ... [2024-11-10 01:55:56,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:55:56,594 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:55:56,594 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:55:56,594 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:55:56,595 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:56" (1/1) ... [2024-11-10 01:55:56,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:55:56,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:55:56,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 01:55:56,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 01:55:56,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:55:56,667 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 01:55:56,667 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 01:55:56,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 01:55:56,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:55:56,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:55:56,836 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:55:56,838 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:55:58,385 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2024-11-10 01:55:58,385 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:55:58,464 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:55:58,465 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 01:55:58,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:55:58 BoogieIcfgContainer [2024-11-10 01:55:58,465 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:55:58,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:55:58,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:55:58,474 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:55:58,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:55:55" (1/3) ... [2024-11-10 01:55:58,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa1993d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:55:58, skipping insertion in model container [2024-11-10 01:55:58,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:56" (2/3) ... [2024-11-10 01:55:58,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa1993d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:55:58, skipping insertion in model container [2024-11-10 01:55:58,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:55:58" (3/3) ... [2024-11-10 01:55:58,477 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c [2024-11-10 01:55:58,493 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:55:58,494 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 01:55:58,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:55:58,583 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;@7e1881e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:55:58,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 01:55:58,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 395 states, 389 states have (on average 1.4884318766066837) internal successors, (579), 390 states have internal predecessors, (579), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:58,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 01:55:58,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:58,606 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-11-10 01:55:58,608 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:58,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:58,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1130703786, now seen corresponding path program 1 times [2024-11-10 01:55:58,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:58,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201180917] [2024-11-10 01:55:58,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:58,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:59,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:55:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:59,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:55:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:59,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:55:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:59,072 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:59,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:59,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201180917] [2024-11-10 01:55:59,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201180917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:59,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:59,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 01:55:59,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959274768] [2024-11-10 01:55:59,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:59,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 01:55:59,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:59,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 01:55:59,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 01:55:59,114 INFO L87 Difference]: Start difference. First operand has 395 states, 389 states have (on average 1.4884318766066837) internal successors, (579), 390 states have internal predecessors, (579), 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 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 01:55:59,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:59,327 INFO L93 Difference]: Finished difference Result 715 states and 1065 transitions. [2024-11-10 01:55:59,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 01:55:59,329 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 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 118 [2024-11-10 01:55:59,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:59,347 INFO L225 Difference]: With dead ends: 715 [2024-11-10 01:55:59,347 INFO L226 Difference]: Without dead ends: 390 [2024-11-10 01:55:59,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 01:55:59,354 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:59,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 485 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:59,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-10 01:55:59,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2024-11-10 01:55:59,413 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-11-10 01:55:59,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 578 transitions. [2024-11-10 01:55:59,416 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 578 transitions. Word has length 118 [2024-11-10 01:55:59,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:59,417 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 578 transitions. [2024-11-10 01:55:59,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 01:55:59,418 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 578 transitions. [2024-11-10 01:55:59,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 01:55:59,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:59,423 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-11-10 01:55:59,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 01:55:59,424 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:59,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:59,425 INFO L85 PathProgramCache]: Analyzing trace with hash 165064281, now seen corresponding path program 1 times [2024-11-10 01:55:59,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:59,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131525421] [2024-11-10 01:55:59,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:59,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:00,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:00,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:56:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:00,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:56:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:00,260 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:00,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:00,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131525421] [2024-11-10 01:56:00,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131525421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:00,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:00,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:56:00,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506103496] [2024-11-10 01:56:00,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:00,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:56:00,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:00,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:56:00,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:56:00,267 INFO L87 Difference]: Start difference. First operand 390 states and 578 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-11-10 01:56:00,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:00,511 INFO L93 Difference]: Finished difference Result 395 states and 583 transitions. [2024-11-10 01:56:00,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:00,511 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-11-10 01:56:00,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:00,514 INFO L225 Difference]: With dead ends: 395 [2024-11-10 01:56:00,514 INFO L226 Difference]: Without dead ends: 392 [2024-11-10 01:56:00,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:56:00,518 INFO L432 NwaCegarLoop]: 483 mSDtfsCounter, 0 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:00,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1444 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:00,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-10 01:56:00,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-11-10 01:56:00,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.483204134366925) internal successors, (574), 387 states have internal predecessors, (574), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:56:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 580 transitions. [2024-11-10 01:56:00,548 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 580 transitions. Word has length 118 [2024-11-10 01:56:00,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:00,550 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 580 transitions. [2024-11-10 01:56:00,550 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-11-10 01:56:00,550 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 580 transitions. [2024-11-10 01:56:00,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-10 01:56:00,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:00,552 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-11-10 01:56:00,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 01:56:00,553 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:00,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:00,554 INFO L85 PathProgramCache]: Analyzing trace with hash 967079114, now seen corresponding path program 1 times [2024-11-10 01:56:00,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:00,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050802849] [2024-11-10 01:56:00,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:00,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:01,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:01,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:56:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:01,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:56:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:01,042 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:01,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:01,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050802849] [2024-11-10 01:56:01,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050802849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:01,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:01,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:01,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024710642] [2024-11-10 01:56:01,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:01,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:01,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:01,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:01,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:01,046 INFO L87 Difference]: Start difference. First operand 392 states and 580 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 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-11-10 01:56:01,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:01,621 INFO L93 Difference]: Finished difference Result 973 states and 1443 transitions. [2024-11-10 01:56:01,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:56:01,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 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-11-10 01:56:01,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:01,626 INFO L225 Difference]: With dead ends: 973 [2024-11-10 01:56:01,626 INFO L226 Difference]: Without dead ends: 392 [2024-11-10 01:56:01,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:56:01,632 INFO L432 NwaCegarLoop]: 526 mSDtfsCounter, 1091 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:01,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 1419 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:56:01,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-10 01:56:01,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-11-10 01:56:01,653 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-11-10 01:56:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 579 transitions. [2024-11-10 01:56:01,656 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 579 transitions. Word has length 119 [2024-11-10 01:56:01,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:01,656 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 579 transitions. [2024-11-10 01:56:01,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 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-11-10 01:56:01,657 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 579 transitions. [2024-11-10 01:56:01,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-10 01:56:01,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:01,660 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-11-10 01:56:01,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 01:56:01,660 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:01,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:01,661 INFO L85 PathProgramCache]: Analyzing trace with hash 806869547, now seen corresponding path program 1 times [2024-11-10 01:56:01,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:01,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899523435] [2024-11-10 01:56:01,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:01,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:02,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:02,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:56:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:02,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:56:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:02,040 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:02,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:02,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899523435] [2024-11-10 01:56:02,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899523435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:02,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:02,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:56:02,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219805989] [2024-11-10 01:56:02,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:02,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:56:02,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:02,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:56:02,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:56:02,043 INFO L87 Difference]: Start difference. First operand 392 states and 579 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 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-11-10 01:56:02,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:02,258 INFO L93 Difference]: Finished difference Result 716 states and 1057 transitions. [2024-11-10 01:56:02,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:02,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 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-11-10 01:56:02,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:02,262 INFO L225 Difference]: With dead ends: 716 [2024-11-10 01:56:02,262 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:56:02,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:56:02,264 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 0 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:02,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1438 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:02,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:56:02,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:56:02,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4781491002570695) internal successors, (575), 389 states have internal predecessors, (575), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:56:02,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 581 transitions. [2024-11-10 01:56:02,275 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 581 transitions. Word has length 120 [2024-11-10 01:56:02,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:02,276 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 581 transitions. [2024-11-10 01:56:02,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 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-11-10 01:56:02,276 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 581 transitions. [2024-11-10 01:56:02,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 01:56:02,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:02,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, 1, 1, 1, 1, 1] [2024-11-10 01:56:02,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 01:56:02,278 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:02,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:02,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1009603939, now seen corresponding path program 1 times [2024-11-10 01:56:02,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:02,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777176941] [2024-11-10 01:56:02,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:02,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:02,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:02,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:56:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:02,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:56:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:02,850 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:02,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:02,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777176941] [2024-11-10 01:56:02,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777176941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:02,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:02,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:56:02,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444320690] [2024-11-10 01:56:02,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:02,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:56:02,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:02,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:56:02,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:56:02,854 INFO L87 Difference]: Start difference. First operand 394 states and 581 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 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-11-10 01:56:03,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:03,126 INFO L93 Difference]: Finished difference Result 718 states and 1058 transitions. [2024-11-10 01:56:03,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:03,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 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-11-10 01:56:03,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:03,129 INFO L225 Difference]: With dead ends: 718 [2024-11-10 01:56:03,129 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:56:03,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:03,133 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 479 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:03,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 902 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:03,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:56:03,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:56:03,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4755784061696657) internal successors, (574), 389 states have internal predecessors, (574), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:56:03,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 580 transitions. [2024-11-10 01:56:03,145 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 580 transitions. Word has length 121 [2024-11-10 01:56:03,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:03,146 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 580 transitions. [2024-11-10 01:56:03,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 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-11-10 01:56:03,147 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 580 transitions. [2024-11-10 01:56:03,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 01:56:03,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:03,151 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-11-10 01:56:03,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 01:56:03,151 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:03,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:03,152 INFO L85 PathProgramCache]: Analyzing trace with hash 533424028, now seen corresponding path program 1 times [2024-11-10 01:56:03,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:03,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938944678] [2024-11-10 01:56:03,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:03,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:03,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:03,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:56:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:03,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:56:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:03,432 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:03,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:03,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938944678] [2024-11-10 01:56:03,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938944678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:03,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:03,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:03,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569825854] [2024-11-10 01:56:03,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:03,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:03,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:03,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:03,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:03,437 INFO L87 Difference]: Start difference. First operand 394 states and 580 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-11-10 01:56:03,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:03,721 INFO L93 Difference]: Finished difference Result 724 states and 1064 transitions. [2024-11-10 01:56:03,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:56:03,722 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-11-10 01:56:03,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:03,724 INFO L225 Difference]: With dead ends: 724 [2024-11-10 01:56:03,724 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:56:03,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:56:03,726 INFO L432 NwaCegarLoop]: 475 mSDtfsCounter, 490 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:03,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 1404 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:03,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:56:03,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:56:03,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4730077120822622) internal successors, (573), 389 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-11-10 01:56:03,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 579 transitions. [2024-11-10 01:56:03,741 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 579 transitions. Word has length 122 [2024-11-10 01:56:03,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:03,742 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 579 transitions. [2024-11-10 01:56:03,742 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-11-10 01:56:03,742 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 579 transitions. [2024-11-10 01:56:03,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 01:56:03,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:03,744 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-11-10 01:56:03,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 01:56:03,744 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:03,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:03,744 INFO L85 PathProgramCache]: Analyzing trace with hash -70417876, now seen corresponding path program 1 times [2024-11-10 01:56:03,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:03,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001884030] [2024-11-10 01:56:03,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:03,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:04,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:04,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:56:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:04,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:56:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:04,082 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:04,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:04,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001884030] [2024-11-10 01:56:04,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001884030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:04,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:04,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:04,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422313396] [2024-11-10 01:56:04,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:04,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:04,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:04,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:04,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:04,085 INFO L87 Difference]: Start difference. First operand 394 states and 579 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 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-11-10 01:56:04,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:04,326 INFO L93 Difference]: Finished difference Result 718 states and 1054 transitions. [2024-11-10 01:56:04,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:04,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 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-11-10 01:56:04,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:04,329 INFO L225 Difference]: With dead ends: 718 [2024-11-10 01:56:04,329 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:56:04,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:04,330 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 1041 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:04,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 902 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:04,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:56:04,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:56:04,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4704370179948587) internal successors, (572), 389 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-11-10 01:56:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 578 transitions. [2024-11-10 01:56:04,342 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 578 transitions. Word has length 123 [2024-11-10 01:56:04,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:04,343 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 578 transitions. [2024-11-10 01:56:04,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 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-11-10 01:56:04,343 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 578 transitions. [2024-11-10 01:56:04,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-10 01:56:04,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:04,345 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-11-10 01:56:04,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 01:56:04,345 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:04,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:04,346 INFO L85 PathProgramCache]: Analyzing trace with hash -82565385, now seen corresponding path program 1 times [2024-11-10 01:56:04,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:04,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509465230] [2024-11-10 01:56:04,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:04,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:04,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:04,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:56:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:04,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:56:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:04,647 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:04,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:04,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509465230] [2024-11-10 01:56:04,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509465230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:04,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:04,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:04,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459184645] [2024-11-10 01:56:04,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:04,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:04,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:04,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:04,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:04,652 INFO L87 Difference]: Start difference. First operand 394 states and 578 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-11-10 01:56:04,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:04,927 INFO L93 Difference]: Finished difference Result 718 states and 1052 transitions. [2024-11-10 01:56:04,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:04,928 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-11-10 01:56:04,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:04,929 INFO L225 Difference]: With dead ends: 718 [2024-11-10 01:56:04,929 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:56:04,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:04,931 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 559 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:04,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 909 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:04,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:56:04,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:56:04,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.467866323907455) internal successors, (571), 389 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-11-10 01:56:04,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 577 transitions. [2024-11-10 01:56:04,945 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 577 transitions. Word has length 124 [2024-11-10 01:56:04,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:04,946 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 577 transitions. [2024-11-10 01:56:04,946 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-11-10 01:56:04,946 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 577 transitions. [2024-11-10 01:56:04,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 01:56:04,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:04,948 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-11-10 01:56:04,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 01:56:04,948 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:04,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:04,949 INFO L85 PathProgramCache]: Analyzing trace with hash -850844761, now seen corresponding path program 1 times [2024-11-10 01:56:04,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:04,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737996654] [2024-11-10 01:56:04,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:04,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:05,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:05,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:56:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:05,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:56:05,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:05,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:05,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:05,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737996654] [2024-11-10 01:56:05,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737996654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:05,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:05,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:56:05,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855986696] [2024-11-10 01:56:05,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:05,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:56:05,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:05,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:56:05,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:56:05,379 INFO L87 Difference]: Start difference. First operand 394 states and 577 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:05,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:05,582 INFO L93 Difference]: Finished difference Result 718 states and 1050 transitions. [2024-11-10 01:56:05,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:05,583 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), 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 125 [2024-11-10 01:56:05,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:05,585 INFO L225 Difference]: With dead ends: 718 [2024-11-10 01:56:05,585 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:56:05,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:05,586 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 484 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:05,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 926 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:05,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:56:05,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:56:05,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4627249357326477) internal successors, (569), 389 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-11-10 01:56:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 575 transitions. [2024-11-10 01:56:05,596 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 575 transitions. Word has length 125 [2024-11-10 01:56:05,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:05,597 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 575 transitions. [2024-11-10 01:56:05,597 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:05,597 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 575 transitions. [2024-11-10 01:56:05,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 01:56:05,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:05,598 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-11-10 01:56:05,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 01:56:05,599 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:05,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:05,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1240331494, now seen corresponding path program 1 times [2024-11-10 01:56:05,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:05,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290308677] [2024-11-10 01:56:05,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:05,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:05,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:05,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:56:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:05,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:56:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:05,909 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:05,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:05,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290308677] [2024-11-10 01:56:05,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290308677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:05,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:05,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:05,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216892974] [2024-11-10 01:56:05,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:05,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:05,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:05,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:05,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:05,912 INFO L87 Difference]: Start difference. First operand 394 states and 575 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-11-10 01:56:06,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:06,113 INFO L93 Difference]: Finished difference Result 718 states and 1046 transitions. [2024-11-10 01:56:06,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:06,114 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-11-10 01:56:06,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:06,115 INFO L225 Difference]: With dead ends: 718 [2024-11-10 01:56:06,115 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:56:06,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:06,116 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 558 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:06,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 933 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:06,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:56:06,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:56:06,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4601542416452442) internal successors, (568), 389 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-11-10 01:56:06,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 574 transitions. [2024-11-10 01:56:06,126 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 574 transitions. Word has length 127 [2024-11-10 01:56:06,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:06,126 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 574 transitions. [2024-11-10 01:56:06,126 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-11-10 01:56:06,126 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 574 transitions. [2024-11-10 01:56:06,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 01:56:06,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:06,128 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-11-10 01:56:06,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 01:56:06,128 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:06,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:06,129 INFO L85 PathProgramCache]: Analyzing trace with hash 577757747, now seen corresponding path program 1 times [2024-11-10 01:56:06,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:06,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410461636] [2024-11-10 01:56:06,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:06,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:06,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:06,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:56:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:06,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:56:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:06,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:06,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410461636] [2024-11-10 01:56:06,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410461636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:06,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:06,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:56:06,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074249638] [2024-11-10 01:56:06,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:06,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:56:06,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:06,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:56:06,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:56:06,574 INFO L87 Difference]: Start difference. First operand 394 states and 574 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 01:56:06,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:06,791 INFO L93 Difference]: Finished difference Result 718 states and 1044 transitions. [2024-11-10 01:56:06,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:06,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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 128 [2024-11-10 01:56:06,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:06,794 INFO L225 Difference]: With dead ends: 718 [2024-11-10 01:56:06,794 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:56:06,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:06,796 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 519 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:06,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 930 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:06,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:56:06,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:56:06,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4575835475578407) internal successors, (567), 389 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-11-10 01:56:06,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 573 transitions. [2024-11-10 01:56:06,806 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 573 transitions. Word has length 128 [2024-11-10 01:56:06,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:06,806 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 573 transitions. [2024-11-10 01:56:06,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 01:56:06,807 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 573 transitions. [2024-11-10 01:56:06,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-10 01:56:06,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:06,808 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:06,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 01:56:06,808 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:06,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:06,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1439866612, now seen corresponding path program 1 times [2024-11-10 01:56:06,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:06,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293536175] [2024-11-10 01:56:06,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:06,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:07,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:07,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 01:56:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:07,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-10 01:56:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:07,270 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:07,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:07,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293536175] [2024-11-10 01:56:07,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293536175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:07,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:07,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:56:07,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630893265] [2024-11-10 01:56:07,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:07,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:56:07,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:07,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:56:07,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:56:07,272 INFO L87 Difference]: Start difference. First operand 394 states and 573 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-11-10 01:56:07,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:07,485 INFO L93 Difference]: Finished difference Result 718 states and 1042 transitions. [2024-11-10 01:56:07,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:07,486 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-11-10 01:56:07,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:07,487 INFO L225 Difference]: With dead ends: 718 [2024-11-10 01:56:07,487 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:56:07,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:07,489 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 517 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:07,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 930 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:07,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:56:07,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:56:07,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.455012853470437) internal successors, (566), 389 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-11-10 01:56:07,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 572 transitions. [2024-11-10 01:56:07,500 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 572 transitions. Word has length 129 [2024-11-10 01:56:07,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:07,500 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 572 transitions. [2024-11-10 01:56:07,501 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-11-10 01:56:07,501 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 572 transitions. [2024-11-10 01:56:07,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 01:56:07,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:07,502 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-11-10 01:56:07,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 01:56:07,502 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:07,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:07,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1246117868, now seen corresponding path program 1 times [2024-11-10 01:56:07,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:07,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870857671] [2024-11-10 01:56:07,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:07,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:07,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:07,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:07,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:56:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:07,997 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:07,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:07,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870857671] [2024-11-10 01:56:07,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870857671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:07,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:07,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:07,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315920677] [2024-11-10 01:56:07,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:07,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:07,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:07,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:07,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:07,999 INFO L87 Difference]: Start difference. First operand 394 states and 572 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 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-11-10 01:56:08,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:08,263 INFO L93 Difference]: Finished difference Result 718 states and 1040 transitions. [2024-11-10 01:56:08,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:08,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 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-11-10 01:56:08,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:08,265 INFO L225 Difference]: With dead ends: 718 [2024-11-10 01:56:08,266 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:56:08,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:08,267 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 472 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:08,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 892 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:08,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:56:08,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:56:08,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4524421593830334) internal successors, (565), 389 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-11-10 01:56:08,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 571 transitions. [2024-11-10 01:56:08,278 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 571 transitions. Word has length 130 [2024-11-10 01:56:08,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:08,278 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 571 transitions. [2024-11-10 01:56:08,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 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-11-10 01:56:08,279 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 571 transitions. [2024-11-10 01:56:08,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 01:56:08,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:08,280 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-11-10 01:56:08,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 01:56:08,280 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:08,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:08,280 INFO L85 PathProgramCache]: Analyzing trace with hash -711738532, now seen corresponding path program 1 times [2024-11-10 01:56:08,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:08,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447548261] [2024-11-10 01:56:08,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:08,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:08,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:08,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:08,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:56:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:09,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:09,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447548261] [2024-11-10 01:56:09,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447548261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:09,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:09,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:09,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444452796] [2024-11-10 01:56:09,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:09,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:09,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:09,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:09,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:09,003 INFO L87 Difference]: Start difference. First operand 394 states and 571 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-11-10 01:56:09,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:09,405 INFO L93 Difference]: Finished difference Result 724 states and 1046 transitions. [2024-11-10 01:56:09,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:56:09,405 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-11-10 01:56:09,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:09,408 INFO L225 Difference]: With dead ends: 724 [2024-11-10 01:56:09,408 INFO L226 Difference]: Without dead ends: 398 [2024-11-10 01:56:09,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:09,409 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 2 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:09,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1753 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:56:09,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-10 01:56:09,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 396. [2024-11-10 01:56:09,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 391 states have (on average 1.4501278772378516) internal successors, (567), 391 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-11-10 01:56:09,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 573 transitions. [2024-11-10 01:56:09,423 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 573 transitions. Word has length 131 [2024-11-10 01:56:09,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:09,423 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 573 transitions. [2024-11-10 01:56:09,423 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-11-10 01:56:09,423 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 573 transitions. [2024-11-10 01:56:09,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-10 01:56:09,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:09,425 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-11-10 01:56:09,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 01:56:09,426 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:09,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:09,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1629532284, now seen corresponding path program 1 times [2024-11-10 01:56:09,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:09,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284402458] [2024-11-10 01:56:09,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:09,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:09,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:09,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:09,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:56:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:09,908 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:09,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:09,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284402458] [2024-11-10 01:56:09,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284402458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:09,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:09,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:09,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738782885] [2024-11-10 01:56:09,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:09,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:09,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:09,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:09,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:09,911 INFO L87 Difference]: Start difference. First operand 396 states and 573 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-11-10 01:56:10,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:10,182 INFO L93 Difference]: Finished difference Result 722 states and 1042 transitions. [2024-11-10 01:56:10,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:10,183 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-11-10 01:56:10,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:10,184 INFO L225 Difference]: With dead ends: 722 [2024-11-10 01:56:10,185 INFO L226 Difference]: Without dead ends: 396 [2024-11-10 01:56:10,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:10,186 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 467 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:10,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 899 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:10,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-10 01:56:10,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-10 01:56:10,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 391 states have (on average 1.4475703324808185) internal successors, (566), 391 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-11-10 01:56:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 572 transitions. [2024-11-10 01:56:10,196 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 572 transitions. Word has length 132 [2024-11-10 01:56:10,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:10,196 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 572 transitions. [2024-11-10 01:56:10,197 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-11-10 01:56:10,197 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 572 transitions. [2024-11-10 01:56:10,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 01:56:10,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:10,198 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-11-10 01:56:10,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 01:56:10,198 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:10,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:10,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1114957878, now seen corresponding path program 1 times [2024-11-10 01:56:10,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:10,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312591790] [2024-11-10 01:56:10,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:10,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:10,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:10,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:10,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:56:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:10,702 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:10,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:10,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312591790] [2024-11-10 01:56:10,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312591790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:10,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:10,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:10,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342266547] [2024-11-10 01:56:10,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:10,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:10,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:10,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:10,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:10,706 INFO L87 Difference]: Start difference. First operand 396 states and 572 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 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-11-10 01:56:10,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:10,984 INFO L93 Difference]: Finished difference Result 722 states and 1040 transitions. [2024-11-10 01:56:10,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:10,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 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-11-10 01:56:10,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:10,987 INFO L225 Difference]: With dead ends: 722 [2024-11-10 01:56:10,987 INFO L226 Difference]: Without dead ends: 396 [2024-11-10 01:56:10,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:10,988 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 924 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:10,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 892 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:10,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-10 01:56:10,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-10 01:56:10,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 391 states have (on average 1.4450127877237853) internal successors, (565), 391 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-11-10 01:56:11,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 571 transitions. [2024-11-10 01:56:11,001 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 571 transitions. Word has length 133 [2024-11-10 01:56:11,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:11,001 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 571 transitions. [2024-11-10 01:56:11,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 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-11-10 01:56:11,002 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 571 transitions. [2024-11-10 01:56:11,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-10 01:56:11,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:11,003 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:11,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 01:56:11,004 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:11,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:11,004 INFO L85 PathProgramCache]: Analyzing trace with hash -241491764, now seen corresponding path program 1 times [2024-11-10 01:56:11,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:11,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395839739] [2024-11-10 01:56:11,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:11,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:11,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:11,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:11,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:56:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:11,698 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:11,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:11,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395839739] [2024-11-10 01:56:11,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395839739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:11,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:11,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:11,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226038819] [2024-11-10 01:56:11,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:11,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:11,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:11,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:11,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:11,702 INFO L87 Difference]: Start difference. First operand 396 states and 571 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:11,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:11,972 INFO L93 Difference]: Finished difference Result 768 states and 1095 transitions. [2024-11-10 01:56:11,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:56:11,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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 134 [2024-11-10 01:56:11,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:11,974 INFO L225 Difference]: With dead ends: 768 [2024-11-10 01:56:11,975 INFO L226 Difference]: Without dead ends: 442 [2024-11-10 01:56:11,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:11,976 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 19 mSDsluCounter, 1393 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1860 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:11,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1860 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:11,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-10 01:56:11,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2024-11-10 01:56:11,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 435 states have (on average 1.4206896551724137) internal successors, (618), 435 states have internal predecessors, (618), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:56:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 624 transitions. [2024-11-10 01:56:11,989 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 624 transitions. Word has length 134 [2024-11-10 01:56:11,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:11,989 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 624 transitions. [2024-11-10 01:56:11,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:11,990 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 624 transitions. [2024-11-10 01:56:11,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-10 01:56:11,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:11,991 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:11,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 01:56:11,991 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:11,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:11,992 INFO L85 PathProgramCache]: Analyzing trace with hash -486614377, now seen corresponding path program 1 times [2024-11-10 01:56:11,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:11,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206264407] [2024-11-10 01:56:11,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:11,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:12,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:12,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:12,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:56:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:12,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:56:12,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:12,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206264407] [2024-11-10 01:56:12,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206264407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:12,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:12,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:56:12,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691891596] [2024-11-10 01:56:12,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:12,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:56:12,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:12,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:56:12,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:12,762 INFO L87 Difference]: Start difference. First operand 440 states and 624 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:13,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:13,129 INFO L93 Difference]: Finished difference Result 976 states and 1366 transitions. [2024-11-10 01:56:13,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:56:13,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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 135 [2024-11-10 01:56:13,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:13,132 INFO L225 Difference]: With dead ends: 976 [2024-11-10 01:56:13,132 INFO L226 Difference]: Without dead ends: 606 [2024-11-10 01:56:13,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 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-11-10 01:56:13,133 INFO L432 NwaCegarLoop]: 460 mSDtfsCounter, 862 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:13,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 1835 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:56:13,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-10 01:56:13,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-10 01:56:13,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 598 states have (on average 1.3929765886287626) internal successors, (833), 598 states have internal predecessors, (833), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:13,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 845 transitions. [2024-11-10 01:56:13,151 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 845 transitions. Word has length 135 [2024-11-10 01:56:13,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:13,151 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 845 transitions. [2024-11-10 01:56:13,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:13,152 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 845 transitions. [2024-11-10 01:56:13,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-11-10 01:56:13,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:13,155 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-11-10 01:56:13,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 01:56:13,156 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:13,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:13,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1135936739, now seen corresponding path program 1 times [2024-11-10 01:56:13,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:13,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270401561] [2024-11-10 01:56:13,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:13,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:13,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:13,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:13,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:56:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:13,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-10 01:56:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:13,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-10 01:56:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:13,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-11-10 01:56:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:13,827 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:13,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:13,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270401561] [2024-11-10 01:56:13,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270401561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:13,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:13,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:13,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115226924] [2024-11-10 01:56:13,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:13,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:13,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:13,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:13,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:13,830 INFO L87 Difference]: Start difference. First operand 606 states and 845 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-11-10 01:56:14,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:14,112 INFO L93 Difference]: Finished difference Result 976 states and 1365 transitions. [2024-11-10 01:56:14,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:14,113 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-11-10 01:56:14,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:14,115 INFO L225 Difference]: With dead ends: 976 [2024-11-10 01:56:14,115 INFO L226 Difference]: Without dead ends: 606 [2024-11-10 01:56:14,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:14,117 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 516 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:14,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 899 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:14,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-10 01:56:14,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-10 01:56:14,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 598 states have (on average 1.391304347826087) internal successors, (832), 598 states have internal predecessors, (832), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:56:14,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 844 transitions. [2024-11-10 01:56:14,138 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 844 transitions. Word has length 323 [2024-11-10 01:56:14,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:14,138 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 844 transitions. [2024-11-10 01:56:14,139 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-11-10 01:56:14,139 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 844 transitions. [2024-11-10 01:56:14,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-11-10 01:56:14,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:14,144 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-11-10 01:56:14,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 01:56:14,144 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:14,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:14,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1572214917, now seen corresponding path program 1 times [2024-11-10 01:56:14,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:14,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035753847] [2024-11-10 01:56:14,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:14,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:14,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:14,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:14,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:56:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:14,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-10 01:56:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:14,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-10 01:56:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:14,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-10 01:56:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:14,936 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:14,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:14,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035753847] [2024-11-10 01:56:14,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035753847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:14,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:14,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:14,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717235922] [2024-11-10 01:56:14,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:14,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:14,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:14,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:14,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:14,940 INFO L87 Difference]: Start difference. First operand 606 states and 844 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-11-10 01:56:15,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:15,185 INFO L93 Difference]: Finished difference Result 976 states and 1363 transitions. [2024-11-10 01:56:15,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:15,186 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-11-10 01:56:15,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:15,189 INFO L225 Difference]: With dead ends: 976 [2024-11-10 01:56:15,189 INFO L226 Difference]: Without dead ends: 606 [2024-11-10 01:56:15,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:15,192 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 508 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:15,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 899 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:15,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-10 01:56:15,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-10 01:56:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 598 states have (on average 1.3896321070234114) internal successors, (831), 598 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-11-10 01:56:15,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 843 transitions. [2024-11-10 01:56:15,217 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 843 transitions. Word has length 324 [2024-11-10 01:56:15,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:15,217 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 843 transitions. [2024-11-10 01:56:15,217 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-11-10 01:56:15,217 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 843 transitions. [2024-11-10 01:56:15,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-11-10 01:56:15,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:15,222 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-11-10 01:56:15,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 01:56:15,222 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:15,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:15,223 INFO L85 PathProgramCache]: Analyzing trace with hash 494999090, now seen corresponding path program 1 times [2024-11-10 01:56:15,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:15,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796037415] [2024-11-10 01:56:15,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:15,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:56:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-10 01:56:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-10 01:56:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-10 01:56:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,942 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:15,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:15,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796037415] [2024-11-10 01:56:15,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796037415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:15,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:15,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:15,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773188633] [2024-11-10 01:56:15,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:15,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:15,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:15,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:15,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:15,945 INFO L87 Difference]: Start difference. First operand 606 states and 843 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-11-10 01:56:16,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:16,170 INFO L93 Difference]: Finished difference Result 976 states and 1361 transitions. [2024-11-10 01:56:16,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:16,171 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-11-10 01:56:16,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:16,174 INFO L225 Difference]: With dead ends: 976 [2024-11-10 01:56:16,174 INFO L226 Difference]: Without dead ends: 606 [2024-11-10 01:56:16,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:16,175 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 500 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:16,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 899 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:16,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-10 01:56:16,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-10 01:56:16,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 598 states have (on average 1.3879598662207357) internal successors, (830), 598 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-11-10 01:56:16,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 842 transitions. [2024-11-10 01:56:16,192 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 842 transitions. Word has length 325 [2024-11-10 01:56:16,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:16,192 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 842 transitions. [2024-11-10 01:56:16,193 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-11-10 01:56:16,193 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 842 transitions. [2024-11-10 01:56:16,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-11-10 01:56:16,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:16,197 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-11-10 01:56:16,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 01:56:16,197 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:16,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:16,198 INFO L85 PathProgramCache]: Analyzing trace with hash -482205068, now seen corresponding path program 1 times [2024-11-10 01:56:16,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:16,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271487360] [2024-11-10 01:56:16,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:16,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:16,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:16,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:16,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:56:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:16,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-10 01:56:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:16,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-10 01:56:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:16,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-10 01:56:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:16,941 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:16,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:16,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271487360] [2024-11-10 01:56:16,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271487360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:16,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:16,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:16,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110337615] [2024-11-10 01:56:16,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:16,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:16,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:16,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:16,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:16,947 INFO L87 Difference]: Start difference. First operand 606 states and 842 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-11-10 01:56:17,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:17,185 INFO L93 Difference]: Finished difference Result 976 states and 1359 transitions. [2024-11-10 01:56:17,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:17,186 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-11-10 01:56:17,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:17,188 INFO L225 Difference]: With dead ends: 976 [2024-11-10 01:56:17,189 INFO L226 Difference]: Without dead ends: 606 [2024-11-10 01:56:17,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:17,190 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 893 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:17,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 892 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:17,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-10 01:56:17,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-10 01:56:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 598 states have (on average 1.3862876254180603) internal successors, (829), 598 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-11-10 01:56:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 841 transitions. [2024-11-10 01:56:17,208 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 841 transitions. Word has length 326 [2024-11-10 01:56:17,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:17,209 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 841 transitions. [2024-11-10 01:56:17,209 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-11-10 01:56:17,209 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 841 transitions. [2024-11-10 01:56:17,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-11-10 01:56:17,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:17,213 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-11-10 01:56:17,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 01:56:17,214 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:17,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:17,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1031543297, now seen corresponding path program 1 times [2024-11-10 01:56:17,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:17,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928502164] [2024-11-10 01:56:17,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:17,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:17,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:17,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:17,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:56:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:17,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-10 01:56:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:17,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-10 01:56:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:17,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-11-10 01:56:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:17,974 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:17,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:17,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928502164] [2024-11-10 01:56:17,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928502164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:17,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:17,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:17,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81565364] [2024-11-10 01:56:17,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:17,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:17,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:17,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:17,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:17,982 INFO L87 Difference]: Start difference. First operand 606 states and 841 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-11-10 01:56:18,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:18,199 INFO L93 Difference]: Finished difference Result 976 states and 1357 transitions. [2024-11-10 01:56:18,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:18,200 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-11-10 01:56:18,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:18,203 INFO L225 Difference]: With dead ends: 976 [2024-11-10 01:56:18,203 INFO L226 Difference]: Without dead ends: 606 [2024-11-10 01:56:18,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:18,204 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 477 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:18,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 915 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:18,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-10 01:56:18,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-10 01:56:18,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 598 states have (on average 1.3846153846153846) internal successors, (828), 598 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-11-10 01:56:18,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 840 transitions. [2024-11-10 01:56:18,222 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 840 transitions. Word has length 327 [2024-11-10 01:56:18,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:18,223 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 840 transitions. [2024-11-10 01:56:18,223 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-11-10 01:56:18,223 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 840 transitions. [2024-11-10 01:56:18,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-11-10 01:56:18,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:18,228 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-11-10 01:56:18,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 01:56:18,229 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:18,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:18,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1673930467, now seen corresponding path program 1 times [2024-11-10 01:56:18,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:18,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807600977] [2024-11-10 01:56:18,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:18,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:18,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:18,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:18,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:56:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:18,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-10 01:56:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:18,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-10 01:56:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:18,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-10 01:56:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:18,983 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:18,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:18,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807600977] [2024-11-10 01:56:18,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807600977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:18,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:18,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:18,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983945771] [2024-11-10 01:56:18,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:18,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:18,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:18,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:18,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:18,987 INFO L87 Difference]: Start difference. First operand 606 states and 840 transitions. Second operand has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 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-11-10 01:56:19,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:19,195 INFO L93 Difference]: Finished difference Result 976 states and 1355 transitions. [2024-11-10 01:56:19,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:19,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 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-11-10 01:56:19,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:19,199 INFO L225 Difference]: With dead ends: 976 [2024-11-10 01:56:19,199 INFO L226 Difference]: Without dead ends: 606 [2024-11-10 01:56:19,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:19,201 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 469 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:19,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 915 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:19,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-10 01:56:19,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-10 01:56:19,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 598 states have (on average 1.382943143812709) internal successors, (827), 598 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-11-10 01:56:19,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 839 transitions. [2024-11-10 01:56:19,226 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 839 transitions. Word has length 328 [2024-11-10 01:56:19,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:19,227 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 839 transitions. [2024-11-10 01:56:19,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 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-11-10 01:56:19,228 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 839 transitions. [2024-11-10 01:56:19,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-11-10 01:56:19,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:19,230 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-11-10 01:56:19,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 01:56:19,231 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:19,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:19,232 INFO L85 PathProgramCache]: Analyzing trace with hash 314626128, now seen corresponding path program 1 times [2024-11-10 01:56:19,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:19,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027674681] [2024-11-10 01:56:19,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:19,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:20,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:20,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:20,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:56:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:20,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-10 01:56:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:20,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-10 01:56:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:20,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-10 01:56:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:20,106 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:20,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:20,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027674681] [2024-11-10 01:56:20,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027674681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:20,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:20,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:20,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79135944] [2024-11-10 01:56:20,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:20,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:20,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:20,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:20,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:20,111 INFO L87 Difference]: Start difference. First operand 606 states and 839 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-11-10 01:56:20,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:20,492 INFO L93 Difference]: Finished difference Result 976 states and 1353 transitions. [2024-11-10 01:56:20,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:20,496 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-11-10 01:56:20,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:20,499 INFO L225 Difference]: With dead ends: 976 [2024-11-10 01:56:20,500 INFO L226 Difference]: Without dead ends: 606 [2024-11-10 01:56:20,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:20,502 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 832 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:20,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 680 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:56:20,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-10 01:56:20,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-10 01:56:20,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 598 states have (on average 1.3812709030100334) internal successors, (826), 598 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-11-10 01:56:20,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 838 transitions. [2024-11-10 01:56:20,525 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 838 transitions. Word has length 329 [2024-11-10 01:56:20,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:20,525 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 838 transitions. [2024-11-10 01:56:20,526 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-11-10 01:56:20,526 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 838 transitions. [2024-11-10 01:56:20,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-10 01:56:20,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:20,528 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-11-10 01:56:20,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 01:56:20,528 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:20,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:20,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1841489362, now seen corresponding path program 1 times [2024-11-10 01:56:20,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:20,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29936291] [2024-11-10 01:56:20,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:20,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:21,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:21,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:21,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:56:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:21,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-10 01:56:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:21,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-10 01:56:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:21,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-11-10 01:56:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:21,904 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:21,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:21,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29936291] [2024-11-10 01:56:21,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29936291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:21,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:21,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:56:21,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633394260] [2024-11-10 01:56:21,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:21,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:56:21,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:21,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:56:21,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:56:21,909 INFO L87 Difference]: Start difference. First operand 606 states and 838 transitions. Second operand has 4 states, 4 states have (on average 75.75) internal successors, (303), 4 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-11-10 01:56:22,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:22,098 INFO L93 Difference]: Finished difference Result 976 states and 1351 transitions. [2024-11-10 01:56:22,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:22,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.75) internal successors, (303), 4 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-11-10 01:56:22,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:22,102 INFO L225 Difference]: With dead ends: 976 [2024-11-10 01:56:22,102 INFO L226 Difference]: Without dead ends: 606 [2024-11-10 01:56:22,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:22,104 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 384 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:22,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 906 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:22,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-10 01:56:22,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-10 01:56:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 598 states have (on average 1.379598662207358) internal successors, (825), 598 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-11-10 01:56:22,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 837 transitions. [2024-11-10 01:56:22,121 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 837 transitions. Word has length 330 [2024-11-10 01:56:22,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:22,122 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 837 transitions. [2024-11-10 01:56:22,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.75) internal successors, (303), 4 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-11-10 01:56:22,122 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 837 transitions. [2024-11-10 01:56:22,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-11-10 01:56:22,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:22,124 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-11-10 01:56:22,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 01:56:22,125 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:22,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:22,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1467570682, now seen corresponding path program 1 times [2024-11-10 01:56:22,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:22,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388729078] [2024-11-10 01:56:22,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:22,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:23,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:23,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:23,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:56:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:23,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-10 01:56:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:23,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-10 01:56:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:23,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-10 01:56:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:23,290 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:23,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:23,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388729078] [2024-11-10 01:56:23,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388729078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:23,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:23,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:23,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32083176] [2024-11-10 01:56:23,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:23,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:23,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:23,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:23,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:23,292 INFO L87 Difference]: Start difference. First operand 606 states and 837 transitions. Second operand has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 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-11-10 01:56:23,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:23,560 INFO L93 Difference]: Finished difference Result 976 states and 1349 transitions. [2024-11-10 01:56:23,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:23,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 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-11-10 01:56:23,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:23,564 INFO L225 Difference]: With dead ends: 976 [2024-11-10 01:56:23,564 INFO L226 Difference]: Without dead ends: 606 [2024-11-10 01:56:23,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:23,565 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 867 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:23,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 884 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:23,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-10 01:56:23,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-10 01:56:23,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 598 states have (on average 1.3779264214046822) internal successors, (824), 598 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-11-10 01:56:23,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 836 transitions. [2024-11-10 01:56:23,585 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 836 transitions. Word has length 331 [2024-11-10 01:56:23,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:23,586 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 836 transitions. [2024-11-10 01:56:23,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 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-11-10 01:56:23,586 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 836 transitions. [2024-11-10 01:56:23,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-11-10 01:56:23,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:23,592 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-11-10 01:56:23,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 01:56:23,593 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:23,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:23,593 INFO L85 PathProgramCache]: Analyzing trace with hash 2144012665, now seen corresponding path program 1 times [2024-11-10 01:56:23,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:23,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821374158] [2024-11-10 01:56:23,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:23,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:24,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:24,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:24,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:56:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:24,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-10 01:56:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:24,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-11-10 01:56:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:24,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-11-10 01:56:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:24,725 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:24,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:24,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821374158] [2024-11-10 01:56:24,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821374158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:24,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:24,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:24,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122372570] [2024-11-10 01:56:24,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:24,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:24,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:24,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:24,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:24,729 INFO L87 Difference]: Start difference. First operand 606 states and 836 transitions. Second operand has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:24,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:24,982 INFO L93 Difference]: Finished difference Result 976 states and 1347 transitions. [2024-11-10 01:56:24,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:24,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 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-11-10 01:56:24,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:24,986 INFO L225 Difference]: With dead ends: 976 [2024-11-10 01:56:24,986 INFO L226 Difference]: Without dead ends: 606 [2024-11-10 01:56:24,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:24,987 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 857 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:24,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 884 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:24,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-10 01:56:25,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-10 01:56:25,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 598 states have (on average 1.3762541806020068) internal successors, (823), 598 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-11-10 01:56:25,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 835 transitions. [2024-11-10 01:56:25,003 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 835 transitions. Word has length 332 [2024-11-10 01:56:25,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:25,004 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 835 transitions. [2024-11-10 01:56:25,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:25,004 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 835 transitions. [2024-11-10 01:56:25,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-11-10 01:56:25,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:25,006 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] [2024-11-10 01:56:25,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 01:56:25,007 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:25,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:25,007 INFO L85 PathProgramCache]: Analyzing trace with hash 549822014, now seen corresponding path program 1 times [2024-11-10 01:56:25,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:25,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781607444] [2024-11-10 01:56:25,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:25,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:26,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:26,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:26,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:56:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:26,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-10 01:56:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:26,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-11-10 01:56:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:26,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-10 01:56:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:26,142 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:26,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:26,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781607444] [2024-11-10 01:56:26,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781607444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:26,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:26,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:56:26,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961751840] [2024-11-10 01:56:26,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:26,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:56:26,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:26,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:56:26,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:56:26,145 INFO L87 Difference]: Start difference. First operand 606 states and 835 transitions. Second operand has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:26,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:26,399 INFO L93 Difference]: Finished difference Result 976 states and 1345 transitions. [2024-11-10 01:56:26,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:26,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 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 333 [2024-11-10 01:56:26,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:26,403 INFO L225 Difference]: With dead ends: 976 [2024-11-10 01:56:26,403 INFO L226 Difference]: Without dead ends: 606 [2024-11-10 01:56:26,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:26,404 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 393 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:26,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 884 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:26,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-10 01:56:26,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-10 01:56:26,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 598 states have (on average 1.374581939799331) internal successors, (822), 598 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-11-10 01:56:26,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 834 transitions. [2024-11-10 01:56:26,423 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 834 transitions. Word has length 333 [2024-11-10 01:56:26,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:26,424 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 834 transitions. [2024-11-10 01:56:26,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:26,424 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 834 transitions. [2024-11-10 01:56:26,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-11-10 01:56:26,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:26,427 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] [2024-11-10 01:56:26,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 01:56:26,428 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:26,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:26,428 INFO L85 PathProgramCache]: Analyzing trace with hash 752803126, now seen corresponding path program 1 times [2024-11-10 01:56:26,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:26,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543250726] [2024-11-10 01:56:26,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:26,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:28,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:28,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:28,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:56:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:28,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-10 01:56:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:28,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-10 01:56:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:28,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-10 01:56:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:28,559 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-10 01:56:28,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:28,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543250726] [2024-11-10 01:56:28,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543250726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:28,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:28,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:28,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333348558] [2024-11-10 01:56:28,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:28,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:28,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:28,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:28,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:28,563 INFO L87 Difference]: Start difference. First operand 606 states and 834 transitions. Second operand has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 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-11-10 01:56:29,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:29,007 INFO L93 Difference]: Finished difference Result 1056 states and 1439 transitions. [2024-11-10 01:56:29,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:56:29,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 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 334 [2024-11-10 01:56:29,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:29,011 INFO L225 Difference]: With dead ends: 1056 [2024-11-10 01:56:29,011 INFO L226 Difference]: Without dead ends: 614 [2024-11-10 01:56:29,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:29,012 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 471 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:29,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1013 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:56:29,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-10 01:56:29,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 610. [2024-11-10 01:56:29,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 602 states have (on average 1.372093023255814) internal successors, (826), 602 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-11-10 01:56:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 838 transitions. [2024-11-10 01:56:29,030 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 838 transitions. Word has length 334 [2024-11-10 01:56:29,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:29,031 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 838 transitions. [2024-11-10 01:56:29,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 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-11-10 01:56:29,031 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 838 transitions. [2024-11-10 01:56:29,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-11-10 01:56:29,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:29,036 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] [2024-11-10 01:56:29,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 01:56:29,036 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:29,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:29,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1820609322, now seen corresponding path program 1 times [2024-11-10 01:56:29,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:29,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372566087] [2024-11-10 01:56:29,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:29,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:30,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:30,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:30,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:56:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:30,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-10 01:56:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:30,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-10 01:56:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:30,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-10 01:56:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:30,232 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:30,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:30,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372566087] [2024-11-10 01:56:30,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372566087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:30,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:30,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:56:30,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92375919] [2024-11-10 01:56:30,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:30,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:56:30,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:30,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:56:30,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:30,236 INFO L87 Difference]: Start difference. First operand 610 states and 838 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-11-10 01:56:30,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:30,899 INFO L93 Difference]: Finished difference Result 1429 states and 1970 transitions. [2024-11-10 01:56:30,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:56:30,900 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-11-10 01:56:30,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:30,904 INFO L225 Difference]: With dead ends: 1429 [2024-11-10 01:56:30,905 INFO L226 Difference]: Without dead ends: 1057 [2024-11-10 01:56:30,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:56:30,906 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 555 mSDsluCounter, 1389 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:30,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1838 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 01:56:30,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2024-11-10 01:56:30,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 937. [2024-11-10 01:56:30,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 926 states have (on average 1.3682505399568035) internal successors, (1267), 926 states have internal predecessors, (1267), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 01:56:30,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1285 transitions. [2024-11-10 01:56:30,932 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1285 transitions. Word has length 334 [2024-11-10 01:56:30,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:30,933 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1285 transitions. [2024-11-10 01:56:30,933 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-11-10 01:56:30,933 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1285 transitions. [2024-11-10 01:56:30,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-11-10 01:56:30,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:30,937 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] [2024-11-10 01:56:30,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 01:56:30,937 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:30,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:30,938 INFO L85 PathProgramCache]: Analyzing trace with hash 5612746, now seen corresponding path program 1 times [2024-11-10 01:56:30,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:30,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006136787] [2024-11-10 01:56:30,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:30,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:32,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:32,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:32,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:56:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:32,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-10 01:56:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:32,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-11-10 01:56:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:32,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-10 01:56:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:32,567 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-10 01:56:32,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:32,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006136787] [2024-11-10 01:56:32,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006136787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:32,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:32,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:56:32,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093945521] [2024-11-10 01:56:32,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:32,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:56:32,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:32,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:56:32,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:32,574 INFO L87 Difference]: Start difference. First operand 937 states and 1285 transitions. Second operand has 6 states, 6 states have (on average 46.166666666666664) internal successors, (277), 6 states have internal predecessors, (277), 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-11-10 01:56:33,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:33,043 INFO L93 Difference]: Finished difference Result 1601 states and 2167 transitions. [2024-11-10 01:56:33,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:56:33,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 46.166666666666664) internal successors, (277), 6 states have internal predecessors, (277), 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 335 [2024-11-10 01:56:33,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:33,048 INFO L225 Difference]: With dead ends: 1601 [2024-11-10 01:56:33,048 INFO L226 Difference]: Without dead ends: 943 [2024-11-10 01:56:33,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:56:33,049 INFO L432 NwaCegarLoop]: 447 mSDtfsCounter, 512 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:33,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1663 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:56:33,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2024-11-10 01:56:33,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 937. [2024-11-10 01:56:33,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 926 states have (on average 1.3617710583153348) internal successors, (1261), 926 states have internal predecessors, (1261), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 01:56:33,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1279 transitions. [2024-11-10 01:56:33,074 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1279 transitions. Word has length 335 [2024-11-10 01:56:33,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:33,074 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1279 transitions. [2024-11-10 01:56:33,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.166666666666664) internal successors, (277), 6 states have internal predecessors, (277), 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-11-10 01:56:33,074 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1279 transitions. [2024-11-10 01:56:33,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-11-10 01:56:33,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:33,078 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] [2024-11-10 01:56:33,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-10 01:56:33,078 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:33,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:33,078 INFO L85 PathProgramCache]: Analyzing trace with hash 756457402, now seen corresponding path program 1 times [2024-11-10 01:56:33,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:33,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204179644] [2024-11-10 01:56:33,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:33,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:34,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:56:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:34,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:56:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:34,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:56:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:34,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-10 01:56:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:34,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-10 01:56:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:34,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-10 01:56:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:34,426 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-10 01:56:34,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:34,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204179644] [2024-11-10 01:56:34,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204179644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:34,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:34,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 01:56:34,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198757702] [2024-11-10 01:56:34,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:34,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 01:56:34,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:34,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 01:56:34,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:56:34,429 INFO L87 Difference]: Start difference. First operand 937 states and 1279 transitions. Second operand has 7 states, 7 states have (on average 39.285714285714285) internal successors, (275), 7 states have internal predecessors, (275), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:34,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:34,877 INFO L93 Difference]: Finished difference Result 1989 states and 2714 transitions. [2024-11-10 01:56:34,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 01:56:34,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.285714285714285) internal successors, (275), 7 states have internal predecessors, (275), 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 337 [2024-11-10 01:56:34,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:34,882 INFO L225 Difference]: With dead ends: 1989 [2024-11-10 01:56:34,882 INFO L226 Difference]: Without dead ends: 949 [2024-11-10 01:56:34,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-10 01:56:34,884 INFO L432 NwaCegarLoop]: 439 mSDtfsCounter, 631 mSDsluCounter, 1648 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 2087 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:34,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 2087 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:56:34,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2024-11-10 01:56:34,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 943. [2024-11-10 01:56:34,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 932 states have (on average 1.3562231759656653) internal successors, (1264), 932 states have internal predecessors, (1264), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 01:56:34,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1282 transitions. [2024-11-10 01:56:34,906 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1282 transitions. Word has length 337 [2024-11-10 01:56:34,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:34,906 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1282 transitions. [2024-11-10 01:56:34,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.285714285714285) internal successors, (275), 7 states have internal predecessors, (275), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:34,906 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1282 transitions. [2024-11-10 01:56:34,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-10 01:56:34,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:34,909 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] [2024-11-10 01:56:34,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-10 01:56:34,909 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:34,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:34,910 INFO L85 PathProgramCache]: Analyzing trace with hash -99214924, now seen corresponding path program 1 times [2024-11-10 01:56:34,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:34,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872026621] [2024-11-10 01:56:34,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:34,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:36,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:56:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:36,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:56:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:36,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:56:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:36,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-10 01:56:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:36,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-10 01:56:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:36,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-11-10 01:56:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:36,124 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:36,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:36,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872026621] [2024-11-10 01:56:36,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872026621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:36,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:36,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:56:36,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044692942] [2024-11-10 01:56:36,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:36,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:56:36,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:36,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:56:36,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:36,127 INFO L87 Difference]: Start difference. First operand 943 states and 1282 transitions. Second operand has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:36,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:36,759 INFO L93 Difference]: Finished difference Result 1340 states and 1826 transitions. [2024-11-10 01:56:36,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:56:36,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 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 339 [2024-11-10 01:56:36,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:36,764 INFO L225 Difference]: With dead ends: 1340 [2024-11-10 01:56:36,764 INFO L226 Difference]: Without dead ends: 966 [2024-11-10 01:56:36,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:56:36,765 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 764 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:36,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 1317 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 01:56:36,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2024-11-10 01:56:36,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 944. [2024-11-10 01:56:36,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 933 states have (on average 1.3558413719185423) internal successors, (1265), 933 states have internal predecessors, (1265), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 01:56:36,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1283 transitions. [2024-11-10 01:56:36,789 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1283 transitions. Word has length 339 [2024-11-10 01:56:36,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:36,790 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1283 transitions. [2024-11-10 01:56:36,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:36,790 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1283 transitions. [2024-11-10 01:56:36,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-10 01:56:36,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:36,793 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] [2024-11-10 01:56:36,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-10 01:56:36,793 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:36,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:36,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1993776678, now seen corresponding path program 1 times [2024-11-10 01:56:36,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:36,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840101467] [2024-11-10 01:56:36,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:36,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:38,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 01:56:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:38,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 01:56:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:38,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 01:56:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:38,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-10 01:56:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:38,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-10 01:56:38,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:38,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-11-10 01:56:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:38,165 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-10 01:56:38,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:38,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840101467] [2024-11-10 01:56:38,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840101467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:38,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:38,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:56:38,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223520258] [2024-11-10 01:56:38,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:38,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:56:38,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:38,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:56:38,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:56:38,167 INFO L87 Difference]: Start difference. First operand 944 states and 1283 transitions. Second operand has 8 states, 8 states have (on average 32.625) internal successors, (261), 8 states have internal predecessors, (261), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:38,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:38,942 INFO L93 Difference]: Finished difference Result 2128 states and 2885 transitions. [2024-11-10 01:56:38,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:56:38,942 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.625) internal successors, (261), 8 states have internal predecessors, (261), 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 339 [2024-11-10 01:56:38,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:38,947 INFO L225 Difference]: With dead ends: 2128 [2024-11-10 01:56:38,948 INFO L226 Difference]: Without dead ends: 1636 [2024-11-10 01:56:38,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:56:38,949 INFO L432 NwaCegarLoop]: 1065 mSDtfsCounter, 779 mSDsluCounter, 5462 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 6527 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:38,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 6527 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1531 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 01:56:38,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2024-11-10 01:56:38,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1013. [2024-11-10 01:56:38,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 999 states have (on average 1.3583583583583583) internal successors, (1357), 999 states have internal predecessors, (1357), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 01:56:38,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1381 transitions. [2024-11-10 01:56:38,978 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1381 transitions. Word has length 339 [2024-11-10 01:56:38,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:38,978 INFO L471 AbstractCegarLoop]: Abstraction has 1013 states and 1381 transitions. [2024-11-10 01:56:38,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.625) internal successors, (261), 8 states have internal predecessors, (261), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1381 transitions. [2024-11-10 01:56:38,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-11-10 01:56:38,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:38,981 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] [2024-11-10 01:56:38,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-10 01:56:38,982 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:38,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:38,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1541446851, now seen corresponding path program 1 times [2024-11-10 01:56:38,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:38,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172131752] [2024-11-10 01:56:38,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:38,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:40,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:56:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:40,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:56:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:40,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:56:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:40,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-10 01:56:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:40,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-11-10 01:56:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:40,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-10 01:56:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 4 proven. 81 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:40,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:40,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172131752] [2024-11-10 01:56:40,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172131752] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 01:56:40,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474090969] [2024-11-10 01:56:40,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:40,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 01:56:40,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:56:40,930 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 01:56:40,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 01:56:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:42,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 2046 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-10 01:56:42,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:56:42,473 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-10 01:56:42,473 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 01:56:42,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474090969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:42,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 01:56:42,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2024-11-10 01:56:42,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874552267] [2024-11-10 01:56:42,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:42,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 01:56:42,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:42,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 01:56:42,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-10 01:56:42,476 INFO L87 Difference]: Start difference. First operand 1013 states and 1381 transitions. Second operand has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 7 states have internal predecessors, (262), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 01:56:43,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:43,101 INFO L93 Difference]: Finished difference Result 1806 states and 2446 transitions. [2024-11-10 01:56:43,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 01:56:43,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 7 states have internal predecessors, (262), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 340 [2024-11-10 01:56:43,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:43,106 INFO L225 Difference]: With dead ends: 1806 [2024-11-10 01:56:43,106 INFO L226 Difference]: Without dead ends: 1029 [2024-11-10 01:56:43,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-10 01:56:43,108 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 490 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:43,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 1597 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 01:56:43,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2024-11-10 01:56:43,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1025. [2024-11-10 01:56:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1011 states have (on average 1.3501483679525224) internal successors, (1365), 1011 states have internal predecessors, (1365), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 01:56:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1389 transitions. [2024-11-10 01:56:43,136 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1389 transitions. Word has length 340 [2024-11-10 01:56:43,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:43,137 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1389 transitions. [2024-11-10 01:56:43,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 7 states have internal predecessors, (262), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 01:56:43,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1389 transitions. [2024-11-10 01:56:43,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-11-10 01:56:43,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:43,141 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, 1, 1] [2024-11-10 01:56:43,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 01:56:43,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-10 01:56:43,343 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:43,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:43,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1106155901, now seen corresponding path program 1 times [2024-11-10 01:56:43,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:43,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514374378] [2024-11-10 01:56:43,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:43,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:44,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:56:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:44,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:56:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:44,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 01:56:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:44,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-10 01:56:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:44,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-10 01:56:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:44,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2024-11-10 01:56:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:44,336 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-10 01:56:44,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:44,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514374378] [2024-11-10 01:56:44,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514374378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:44,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:44,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 01:56:44,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749468928] [2024-11-10 01:56:44,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:44,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 01:56:44,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:44,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 01:56:44,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:56:44,340 INFO L87 Difference]: Start difference. First operand 1025 states and 1389 transitions. Second operand has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 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-11-10 01:56:44,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:44,854 INFO L93 Difference]: Finished difference Result 1872 states and 2525 transitions. [2024-11-10 01:56:44,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:56:44,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 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 344 [2024-11-10 01:56:44,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:44,857 INFO L225 Difference]: With dead ends: 1872 [2024-11-10 01:56:44,858 INFO L226 Difference]: Without dead ends: 1041 [2024-11-10 01:56:44,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:56:44,859 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 539 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:44,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 1312 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:56:44,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2024-11-10 01:56:44,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1033. [2024-11-10 01:56:44,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1019 states have (on average 1.3434739941118743) internal successors, (1369), 1019 states have internal predecessors, (1369), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 01:56:44,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1393 transitions. [2024-11-10 01:56:44,882 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1393 transitions. Word has length 344 [2024-11-10 01:56:44,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:44,883 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1393 transitions. [2024-11-10 01:56:44,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 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-11-10 01:56:44,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1393 transitions. [2024-11-10 01:56:44,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2024-11-10 01:56:44,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:44,886 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, 1, 1] [2024-11-10 01:56:44,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-10 01:56:44,887 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:44,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:44,887 INFO L85 PathProgramCache]: Analyzing trace with hash -2030793023, now seen corresponding path program 1 times [2024-11-10 01:56:44,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:44,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232062118] [2024-11-10 01:56:44,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:44,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:46,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:56:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:46,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 01:56:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:46,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:56:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:46,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-10 01:56:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:46,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-10 01:56:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:46,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-11-10 01:56:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-11-10 01:56:46,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:46,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232062118] [2024-11-10 01:56:46,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232062118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:46,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:46,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:56:46,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194351968] [2024-11-10 01:56:46,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:46,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:56:46,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:46,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:56:46,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:46,132 INFO L87 Difference]: Start difference. First operand 1033 states and 1393 transitions. Second operand has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:46,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:46,682 INFO L93 Difference]: Finished difference Result 1922 states and 2578 transitions. [2024-11-10 01:56:46,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:56:46,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 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 346 [2024-11-10 01:56:46,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:46,686 INFO L225 Difference]: With dead ends: 1922 [2024-11-10 01:56:46,686 INFO L226 Difference]: Without dead ends: 1041 [2024-11-10 01:56:46,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 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-11-10 01:56:46,688 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 510 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:46,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1305 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:56:46,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2024-11-10 01:56:46,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1037. [2024-11-10 01:56:46,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 1023 states have (on average 1.3421309872922775) internal successors, (1373), 1023 states have internal predecessors, (1373), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 01:56:46,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1397 transitions. [2024-11-10 01:56:46,712 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1397 transitions. Word has length 346 [2024-11-10 01:56:46,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:46,712 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1397 transitions. [2024-11-10 01:56:46,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:46,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1397 transitions. [2024-11-10 01:56:46,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-11-10 01:56:46,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:46,716 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:46,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-10 01:56:46,717 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:46,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:46,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1765127837, now seen corresponding path program 1 times [2024-11-10 01:56:46,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:46,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265776260] [2024-11-10 01:56:46,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:46,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:48,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 01:56:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:49,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 01:56:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:49,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 01:56:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:49,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-10 01:56:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:49,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-10 01:56:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:49,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2024-11-10 01:56:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-10 01:56:49,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:49,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265776260] [2024-11-10 01:56:49,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265776260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:49,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:49,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 01:56:49,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245800418] [2024-11-10 01:56:49,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:49,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 01:56:49,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:49,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 01:56:49,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-10 01:56:49,014 INFO L87 Difference]: Start difference. First operand 1037 states and 1397 transitions. Second operand has 12 states, 12 states have (on average 22.833333333333332) internal successors, (274), 12 states have internal predecessors, (274), 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-11-10 01:56:51,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:51,011 INFO L93 Difference]: Finished difference Result 2008 states and 2702 transitions. [2024-11-10 01:56:51,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 01:56:51,012 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 22.833333333333332) internal successors, (274), 12 states have internal predecessors, (274), 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 348 [2024-11-10 01:56:51,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:51,016 INFO L225 Difference]: With dead ends: 2008 [2024-11-10 01:56:51,016 INFO L226 Difference]: Without dead ends: 1379 [2024-11-10 01:56:51,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-11-10 01:56:51,017 INFO L432 NwaCegarLoop]: 512 mSDtfsCounter, 1256 mSDsluCounter, 3996 mSDsCounter, 0 mSdLazyCounter, 3680 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 4508 SdHoareTripleChecker+Invalid, 3686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:51,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1261 Valid, 4508 Invalid, 3686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3680 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 01:56:51,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2024-11-10 01:56:51,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1081. [2024-11-10 01:56:51,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1065 states have (on average 1.3417840375586854) internal successors, (1429), 1065 states have internal predecessors, (1429), 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-11-10 01:56:51,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1457 transitions. [2024-11-10 01:56:51,045 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1457 transitions. Word has length 348 [2024-11-10 01:56:51,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:51,046 INFO L471 AbstractCegarLoop]: Abstraction has 1081 states and 1457 transitions. [2024-11-10 01:56:51,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.833333333333332) internal successors, (274), 12 states have internal predecessors, (274), 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-11-10 01:56:51,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1457 transitions. [2024-11-10 01:56:51,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-11-10 01:56:51,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:51,050 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, 1, 1, 1, 1] [2024-11-10 01:56:51,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-10 01:56:51,050 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:51,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:51,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1304726528, now seen corresponding path program 1 times [2024-11-10 01:56:51,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:51,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158574526] [2024-11-10 01:56:51,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:51,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:52,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 01:56:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:52,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 01:56:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:52,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 01:56:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:52,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-10 01:56:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:52,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-10 01:56:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:52,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2024-11-10 01:56:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:52,645 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:52,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:52,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158574526] [2024-11-10 01:56:52,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158574526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:52,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:52,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:56:52,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72449760] [2024-11-10 01:56:52,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:52,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:56:52,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:52,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:56:52,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:56:52,651 INFO L87 Difference]: Start difference. First operand 1081 states and 1457 transitions. Second operand has 8 states, 8 states have (on average 40.125) internal successors, (321), 8 states have internal predecessors, (321), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:53,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:53,695 INFO L93 Difference]: Finished difference Result 1820 states and 2458 transitions. [2024-11-10 01:56:53,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:56:53,696 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 40.125) internal successors, (321), 8 states have internal predecessors, (321), 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 348 [2024-11-10 01:56:53,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:53,701 INFO L225 Difference]: With dead ends: 1820 [2024-11-10 01:56:53,701 INFO L226 Difference]: Without dead ends: 1440 [2024-11-10 01:56:53,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:56:53,703 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 754 mSDsluCounter, 2598 mSDsCounter, 0 mSdLazyCounter, 2215 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 3180 SdHoareTripleChecker+Invalid, 2216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:53,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 3180 Invalid, 2216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2215 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 01:56:53,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2024-11-10 01:56:53,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1421. [2024-11-10 01:56:53,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 1402 states have (on average 1.340941512125535) internal successors, (1880), 1402 states have internal predecessors, (1880), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 01:56:53,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 1914 transitions. [2024-11-10 01:56:53,756 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 1914 transitions. Word has length 348 [2024-11-10 01:56:53,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:53,756 INFO L471 AbstractCegarLoop]: Abstraction has 1421 states and 1914 transitions. [2024-11-10 01:56:53,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.125) internal successors, (321), 8 states have internal predecessors, (321), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:53,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1914 transitions. [2024-11-10 01:56:53,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-11-10 01:56:53,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:53,760 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:53,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-10 01:56:53,761 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:53,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:53,761 INFO L85 PathProgramCache]: Analyzing trace with hash -577078473, now seen corresponding path program 1 times [2024-11-10 01:56:53,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:53,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548208327] [2024-11-10 01:56:53,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:53,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:54,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 01:56:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:54,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 01:56:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:54,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 01:56:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:54,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-10 01:56:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:54,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-10 01:56:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:54,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2024-11-10 01:56:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:54,968 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 85 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:54,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:54,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548208327] [2024-11-10 01:56:54,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548208327] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 01:56:54,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949728696] [2024-11-10 01:56:54,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:54,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 01:56:54,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:56:54,970 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-11-10 01:56:55,002 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-11-10 01:56:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:56,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 2062 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-10 01:56:56,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:56:56,855 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-10 01:56:56,855 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 01:56:56,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949728696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:56,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 01:56:56,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2024-11-10 01:56:56,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716567433] [2024-11-10 01:56:56,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:56,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:56:56,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:56,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:56:56,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:56:56,858 INFO L87 Difference]: Start difference. First operand 1421 states and 1914 transitions. Second operand has 9 states, 9 states have (on average 34.333333333333336) internal successors, (309), 9 states have internal predecessors, (309), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 01:56:57,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:57,502 INFO L93 Difference]: Finished difference Result 2576 states and 3457 transitions. [2024-11-10 01:56:57,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:56:57,503 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 34.333333333333336) internal successors, (309), 9 states have internal predecessors, (309), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 348 [2024-11-10 01:56:57,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted.