./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-63.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 032103455c965390b2cd90e1021eb4797074287a2ad4fda3336b307fb716d96d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:05:44,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:05:44,544 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:05:44,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:05:44,550 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:05:44,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:05:44,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:05:44,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:05:44,586 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:05:44,587 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:05:44,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:05:44,588 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:05:44,588 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:05:44,589 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:05:44,591 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:05:44,591 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:05:44,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:05:44,592 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:05:44,592 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:05:44,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:05:44,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:05:44,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:05:44,598 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:05:44,598 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:05:44,598 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:05:44,599 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:05:44,599 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:05:44,605 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:05:44,606 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:05:44,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:05:44,606 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:05:44,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:05:44,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:05:44,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:05:44,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:05:44,607 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:05:44,607 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:05:44,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:05:44,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:05:44,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:05:44,608 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:05:44,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:05:44,609 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 032103455c965390b2cd90e1021eb4797074287a2ad4fda3336b307fb716d96d [2024-11-10 07:05:44,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:05:44,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:05:44,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:05:44,928 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:05:44,929 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:05:44,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-63.i [2024-11-10 07:05:46,431 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:05:46,702 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:05:46,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-63.i [2024-11-10 07:05:46,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86a42bb14/f47e7a8b51044000b2a72c2a4e1ece45/FLAGa36a4e249 [2024-11-10 07:05:47,015 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86a42bb14/f47e7a8b51044000b2a72c2a4e1ece45 [2024-11-10 07:05:47,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:05:47,020 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:05:47,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:05:47,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:05:47,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:05:47,030 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:05:47" (1/1) ... [2024-11-10 07:05:47,031 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74916eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:47, skipping insertion in model container [2024-11-10 07:05:47,031 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:05:47" (1/1) ... [2024-11-10 07:05:47,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:05:47,248 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/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-63.i[916,929] [2024-11-10 07:05:47,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:05:47,410 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:05:47,424 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/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-63.i[916,929] [2024-11-10 07:05:47,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:05:47,516 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:05:47,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:47 WrapperNode [2024-11-10 07:05:47,517 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:05:47,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:05:47,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:05:47,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:05:47,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:47" (1/1) ... [2024-11-10 07:05:47,543 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:47" (1/1) ... [2024-11-10 07:05:47,605 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2024-11-10 07:05:47,606 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:05:47,607 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:05:47,607 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:05:47,607 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:05:47,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:47" (1/1) ... [2024-11-10 07:05:47,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:47" (1/1) ... [2024-11-10 07:05:47,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:47" (1/1) ... [2024-11-10 07:05:47,663 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 07:05:47,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:47" (1/1) ... [2024-11-10 07:05:47,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:47" (1/1) ... [2024-11-10 07:05:47,678 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:47" (1/1) ... [2024-11-10 07:05:47,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:47" (1/1) ... [2024-11-10 07:05:47,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:47" (1/1) ... [2024-11-10 07:05:47,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:47" (1/1) ... [2024-11-10 07:05:47,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:05:47,700 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:05:47,700 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:05:47,700 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:05:47,701 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:47" (1/1) ... [2024-11-10 07:05:47,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:05:47,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:05:47,740 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 07:05:47,743 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 07:05:47,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:05:47,792 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:05:47,793 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:05:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:05:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:05:47,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:05:47,903 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:05:47,905 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:05:48,399 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc property_#t~bitwise17#1;havoc property_#t~short18#1;havoc property_#t~short19#1; [2024-11-10 07:05:48,440 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-10 07:05:48,440 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:05:48,465 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:05:48,465 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:05:48,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:05:48 BoogieIcfgContainer [2024-11-10 07:05:48,466 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:05:48,468 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:05:48,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:05:48,474 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:05:48,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:05:47" (1/3) ... [2024-11-10 07:05:48,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378b4f8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:05:48, skipping insertion in model container [2024-11-10 07:05:48,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:47" (2/3) ... [2024-11-10 07:05:48,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378b4f8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:05:48, skipping insertion in model container [2024-11-10 07:05:48,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:05:48" (3/3) ... [2024-11-10 07:05:48,477 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-63.i [2024-11-10 07:05:48,503 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:05:48,505 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:05:48,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:05:48,626 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;@6242fe4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:05:48,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:05:48,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 69 states have (on average 1.463768115942029) internal successors, (101), 70 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 07:05:48,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 07:05:48,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:05:48,651 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:48,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:05:48,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:05:48,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1828462599, now seen corresponding path program 1 times [2024-11-10 07:05:48,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:05:48,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709960290] [2024-11-10 07:05:48,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:05:48,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:05:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:49,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:05:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:49,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:05:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:49,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:05:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:49,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:05:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:49,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:05:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:49,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:05:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:49,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:05:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:49,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:05:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:49,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:05:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:49,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:05:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:49,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:05:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:49,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:05:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:49,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:05:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:49,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:05:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:49,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:05:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:49,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:05:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:49,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:05:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:49,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:05:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:49,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 07:05:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:49,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:05:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:49,185 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 07:05:49,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:05:49,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709960290] [2024-11-10 07:05:49,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709960290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:05:49,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:05:49,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:05:49,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095895105] [2024-11-10 07:05:49,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:05:49,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:05:49,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:05:49,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:05:49,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:05:49,234 INFO L87 Difference]: Start difference. First operand has 92 states, 69 states have (on average 1.463768115942029) internal successors, (101), 70 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 07:05:49,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:05:49,272 INFO L93 Difference]: Finished difference Result 178 states and 296 transitions. [2024-11-10 07:05:49,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:05:49,274 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 145 [2024-11-10 07:05:49,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:05:49,283 INFO L225 Difference]: With dead ends: 178 [2024-11-10 07:05:49,284 INFO L226 Difference]: Without dead ends: 85 [2024-11-10 07:05:49,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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 07:05:49,293 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:05:49,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:05:49,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-10 07:05:49,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-10 07:05:49,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.380952380952381) internal successors, (87), 63 states have internal predecessors, (87), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 07:05:49,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2024-11-10 07:05:49,350 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 145 [2024-11-10 07:05:49,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:05:49,351 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2024-11-10 07:05:49,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 07:05:49,352 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2024-11-10 07:05:49,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 07:05:49,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:05:49,358 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:49,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:05:49,359 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:05:49,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:05:49,360 INFO L85 PathProgramCache]: Analyzing trace with hash 29110231, now seen corresponding path program 1 times [2024-11-10 07:05:49,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:05:49,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348644405] [2024-11-10 07:05:49,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:05:49,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:05:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:50,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:05:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:50,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:05:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:50,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:05:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:50,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:05:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:50,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:05:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:50,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:05:50,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:50,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:05:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:50,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:05:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:50,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:05:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:50,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:05:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:50,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:05:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:50,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:05:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:50,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:05:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:50,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:05:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:50,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:05:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:50,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:05:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:50,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:05:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:50,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:05:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:50,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 07:05:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:50,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:05:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:50,293 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 07:05:50,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:05:50,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348644405] [2024-11-10 07:05:50,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348644405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:05:50,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:05:50,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:05:50,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140641529] [2024-11-10 07:05:50,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:05:50,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:05:50,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:05:50,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:05:50,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:05:50,301 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:05:50,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:05:50,528 INFO L93 Difference]: Finished difference Result 251 states and 377 transitions. [2024-11-10 07:05:50,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:05:50,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-11-10 07:05:50,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:05:50,531 INFO L225 Difference]: With dead ends: 251 [2024-11-10 07:05:50,531 INFO L226 Difference]: Without dead ends: 169 [2024-11-10 07:05:50,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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 07:05:50,538 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 95 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:05:50,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 356 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:05:50,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-10 07:05:50,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 132. [2024-11-10 07:05:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 89 states have (on average 1.3370786516853932) internal successors, (119), 89 states have internal predecessors, (119), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-10 07:05:50,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 199 transitions. [2024-11-10 07:05:50,581 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 199 transitions. Word has length 145 [2024-11-10 07:05:50,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:05:50,582 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 199 transitions. [2024-11-10 07:05:50,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:05:50,583 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 199 transitions. [2024-11-10 07:05:50,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 07:05:50,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:05:50,585 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:50,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:05:50,585 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:05:50,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:05:50,586 INFO L85 PathProgramCache]: Analyzing trace with hash -2048099112, now seen corresponding path program 1 times [2024-11-10 07:05:50,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:05:50,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092284888] [2024-11-10 07:05:50,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:05:50,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:05:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:51,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:05:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:51,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:05:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:51,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:05:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:51,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:05:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:51,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:05:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:51,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:05:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:51,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:05:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:51,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:05:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:51,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:05:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:51,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:05:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:51,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:05:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:51,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:05:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:51,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:05:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:51,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:05:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:51,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:05:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:51,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:05:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:51,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:05:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:51,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:05:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:51,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 07:05:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:51,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:05:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 07:05:51,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:05:51,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092284888] [2024-11-10 07:05:51,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092284888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:05:51,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:05:51,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:05:51,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030050852] [2024-11-10 07:05:51,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:05:51,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:05:51,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:05:51,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:05:51,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:05:51,156 INFO L87 Difference]: Start difference. First operand 132 states and 199 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:05:51,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:05:51,351 INFO L93 Difference]: Finished difference Result 319 states and 473 transitions. [2024-11-10 07:05:51,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:05:51,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-11-10 07:05:51,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:05:51,355 INFO L225 Difference]: With dead ends: 319 [2024-11-10 07:05:51,356 INFO L226 Difference]: Without dead ends: 237 [2024-11-10 07:05:51,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:05:51,361 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 194 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:05:51,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 296 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:05:51,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-10 07:05:51,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 186. [2024-11-10 07:05:51,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 134 states have (on average 1.3582089552238805) internal successors, (182), 135 states have internal predecessors, (182), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 07:05:51,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 278 transitions. [2024-11-10 07:05:51,398 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 278 transitions. Word has length 145 [2024-11-10 07:05:51,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:05:51,399 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 278 transitions. [2024-11-10 07:05:51,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:05:51,400 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 278 transitions. [2024-11-10 07:05:51,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 07:05:51,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:05:51,403 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:51,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 07:05:51,403 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:05:51,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:05:51,404 INFO L85 PathProgramCache]: Analyzing trace with hash 360451130, now seen corresponding path program 1 times [2024-11-10 07:05:51,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:05:51,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493226877] [2024-11-10 07:05:51,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:05:51,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:05:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:57,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:05:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:57,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:05:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:57,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:05:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:57,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:05:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:57,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:05:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:57,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:05:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:57,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:05:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:57,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:05:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:57,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:05:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:58,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:05:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:58,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:05:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:58,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:05:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:58,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:05:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:58,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:05:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:58,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:05:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:58,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:05:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:58,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:05:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:58,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:05:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:58,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 07:05:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:58,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:05:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:58,089 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 07:05:58,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:05:58,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493226877] [2024-11-10 07:05:58,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493226877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:05:58,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:05:58,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 07:05:58,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757227925] [2024-11-10 07:05:58,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:05:58,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 07:05:58,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:05:58,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 07:05:58,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:05:58,094 INFO L87 Difference]: Start difference. First operand 186 states and 278 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:05:59,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:05:59,968 INFO L93 Difference]: Finished difference Result 680 states and 990 transitions. [2024-11-10 07:05:59,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 07:05:59,969 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-11-10 07:05:59,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:05:59,978 INFO L225 Difference]: With dead ends: 680 [2024-11-10 07:05:59,978 INFO L226 Difference]: Without dead ends: 545 [2024-11-10 07:05:59,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-10 07:05:59,981 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 619 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:05:59,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 535 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 07:05:59,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-11-10 07:06:00,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 222. [2024-11-10 07:06:00,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 170 states have (on average 1.388235294117647) internal successors, (236), 171 states have internal predecessors, (236), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 07:06:00,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 332 transitions. [2024-11-10 07:06:00,037 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 332 transitions. Word has length 145 [2024-11-10 07:06:00,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:06:00,038 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 332 transitions. [2024-11-10 07:06:00,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:06:00,038 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 332 transitions. [2024-11-10 07:06:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 07:06:00,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:06:00,040 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:06:00,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 07:06:00,041 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:06:00,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:06:00,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1447003333, now seen corresponding path program 1 times [2024-11-10 07:06:00,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:06:00,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375853952] [2024-11-10 07:06:00,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:00,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:06:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:09,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:06:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:09,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:06:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:09,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:06:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:09,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:06:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:09,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:06:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:09,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:06:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:09,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:06:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:09,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:06:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:09,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:06:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:09,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:06:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:09,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:06:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:09,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:06:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:09,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:06:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:09,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:06:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:09,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:06:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:09,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:06:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:09,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:06:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:09,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:06:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:09,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 07:06:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:09,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:06:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:09,178 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 07:06:09,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:06:09,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375853952] [2024-11-10 07:06:09,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375853952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:06:09,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:06:09,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 07:06:09,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524724747] [2024-11-10 07:06:09,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:06:09,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 07:06:09,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:06:09,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 07:06:09,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-10 07:06:09,183 INFO L87 Difference]: Start difference. First operand 222 states and 332 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:06:11,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:06:11,196 INFO L93 Difference]: Finished difference Result 924 states and 1347 transitions. [2024-11-10 07:06:11,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 07:06:11,197 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-11-10 07:06:11,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:06:11,201 INFO L225 Difference]: With dead ends: 924 [2024-11-10 07:06:11,201 INFO L226 Difference]: Without dead ends: 753 [2024-11-10 07:06:11,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=221, Invalid=591, Unknown=0, NotChecked=0, Total=812 [2024-11-10 07:06:11,203 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 707 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:06:11,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 891 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 07:06:11,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-11-10 07:06:11,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 289. [2024-11-10 07:06:11,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 237 states have (on average 1.4261603375527425) internal successors, (338), 238 states have internal predecessors, (338), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 07:06:11,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 434 transitions. [2024-11-10 07:06:11,231 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 434 transitions. Word has length 145 [2024-11-10 07:06:11,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:06:11,232 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 434 transitions. [2024-11-10 07:06:11,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:06:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 434 transitions. [2024-11-10 07:06:11,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 07:06:11,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:06:11,234 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:06:11,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 07:06:11,235 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:06:11,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:06:11,235 INFO L85 PathProgramCache]: Analyzing trace with hash 208811895, now seen corresponding path program 1 times [2024-11-10 07:06:11,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:06:11,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027622755] [2024-11-10 07:06:11,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:11,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:06:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:11,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:06:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:11,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:06:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:11,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:06:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:11,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:06:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:11,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:06:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:11,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:06:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:11,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:06:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:11,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:06:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:11,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:06:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:11,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:06:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:11,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:06:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:11,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:06:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:11,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:06:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:11,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:06:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:11,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:06:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:11,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:06:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:11,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:06:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:11,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:06:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:11,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 07:06:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:11,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:06:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:11,579 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 07:06:11,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:06:11,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027622755] [2024-11-10 07:06:11,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027622755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:06:11,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:06:11,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 07:06:11,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774411002] [2024-11-10 07:06:11,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:06:11,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:06:11,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:06:11,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:06:11,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:06:11,581 INFO L87 Difference]: Start difference. First operand 289 states and 434 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:06:11,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:06:11,793 INFO L93 Difference]: Finished difference Result 713 states and 1064 transitions. [2024-11-10 07:06:11,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:06:11,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-11-10 07:06:11,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:06:11,797 INFO L225 Difference]: With dead ends: 713 [2024-11-10 07:06:11,799 INFO L226 Difference]: Without dead ends: 494 [2024-11-10 07:06:11,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:06:11,802 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 168 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:06:11,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 459 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:06:11,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-11-10 07:06:11,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 312. [2024-11-10 07:06:11,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 259 states have (on average 1.4247104247104247) internal successors, (369), 260 states have internal predecessors, (369), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 07:06:11,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 465 transitions. [2024-11-10 07:06:11,835 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 465 transitions. Word has length 145 [2024-11-10 07:06:11,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:06:11,838 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 465 transitions. [2024-11-10 07:06:11,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:06:11,839 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 465 transitions. [2024-11-10 07:06:11,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 07:06:11,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:06:11,843 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:06:11,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 07:06:11,843 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:06:11,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:06:11,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1598642568, now seen corresponding path program 1 times [2024-11-10 07:06:11,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:06:11,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708292209] [2024-11-10 07:06:11,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:11,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:06:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:16,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:06:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:16,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:06:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:16,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:06:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:16,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:06:16,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:16,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:06:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:16,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:06:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:16,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:06:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:16,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:06:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:16,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:06:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:16,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:06:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:16,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:06:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:16,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:06:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:16,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:06:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:16,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:06:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:16,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:06:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:16,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:06:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:16,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:06:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:16,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:06:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:16,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 07:06:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:16,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:06:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:16,918 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 07:06:16,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:06:16,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708292209] [2024-11-10 07:06:16,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708292209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:06:16,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:06:16,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 07:06:16,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814068556] [2024-11-10 07:06:16,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:06:16,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 07:06:16,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:06:16,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 07:06:16,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-10 07:06:16,920 INFO L87 Difference]: Start difference. First operand 312 states and 465 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:06:18,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:06:18,552 INFO L93 Difference]: Finished difference Result 853 states and 1254 transitions. [2024-11-10 07:06:18,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 07:06:18,554 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-11-10 07:06:18,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:06:18,557 INFO L225 Difference]: With dead ends: 853 [2024-11-10 07:06:18,557 INFO L226 Difference]: Without dead ends: 628 [2024-11-10 07:06:18,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=167, Invalid=433, Unknown=0, NotChecked=0, Total=600 [2024-11-10 07:06:18,560 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 599 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 07:06:18,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 675 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 07:06:18,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-11-10 07:06:18,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 327. [2024-11-10 07:06:18,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 274 states have (on average 1.4233576642335766) internal successors, (390), 275 states have internal predecessors, (390), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 07:06:18,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 486 transitions. [2024-11-10 07:06:18,592 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 486 transitions. Word has length 145 [2024-11-10 07:06:18,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:06:18,593 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 486 transitions. [2024-11-10 07:06:18,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:06:18,593 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 486 transitions. [2024-11-10 07:06:18,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 07:06:18,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:06:18,595 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:06:18,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 07:06:18,595 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:06:18,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:06:18,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1677605159, now seen corresponding path program 1 times [2024-11-10 07:06:18,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:06:18,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819095107] [2024-11-10 07:06:18,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:18,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:06:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:18,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:06:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:18,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:06:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:18,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:06:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:18,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:06:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:18,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:06:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:18,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:06:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:18,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:06:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:18,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:06:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:18,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:06:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:18,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:06:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:18,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:06:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:18,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:06:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:18,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:06:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:18,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:06:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:18,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:06:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:18,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:06:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:18,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:06:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:18,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:06:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:18,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 07:06:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:18,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:06:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 07:06:18,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:06:18,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819095107] [2024-11-10 07:06:18,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819095107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:06:18,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:06:18,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:06:18,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921232437] [2024-11-10 07:06:18,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:06:18,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:06:18,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:06:18,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:06:18,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:06:18,830 INFO L87 Difference]: Start difference. First operand 327 states and 486 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:06:18,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:06:18,974 INFO L93 Difference]: Finished difference Result 664 states and 977 transitions. [2024-11-10 07:06:18,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:06:18,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-11-10 07:06:18,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:06:18,977 INFO L225 Difference]: With dead ends: 664 [2024-11-10 07:06:18,977 INFO L226 Difference]: Without dead ends: 411 [2024-11-10 07:06:18,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:06:18,979 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 138 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:06:18,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 437 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:06:18,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-10 07:06:18,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 309. [2024-11-10 07:06:19,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 256 states have (on average 1.41015625) internal successors, (361), 257 states have internal predecessors, (361), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 07:06:19,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 457 transitions. [2024-11-10 07:06:19,002 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 457 transitions. Word has length 145 [2024-11-10 07:06:19,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:06:19,003 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 457 transitions. [2024-11-10 07:06:19,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:06:19,003 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 457 transitions. [2024-11-10 07:06:19,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 07:06:19,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:06:19,005 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:06:19,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 07:06:19,005 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:06:19,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:06:19,005 INFO L85 PathProgramCache]: Analyzing trace with hash -815612489, now seen corresponding path program 1 times [2024-11-10 07:06:19,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:06:19,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130459012] [2024-11-10 07:06:19,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:19,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:06:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:19,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:06:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:19,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:06:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:19,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:06:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:19,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:06:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:19,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:06:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:19,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:06:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:19,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:06:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:19,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:06:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:19,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:06:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:19,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:06:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:19,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:06:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:19,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:06:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:19,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:06:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:19,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:06:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:19,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:06:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:19,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:06:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:19,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:06:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:19,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:06:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:19,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 07:06:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:19,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:06:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:19,096 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 07:06:19,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:06:19,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130459012] [2024-11-10 07:06:19,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130459012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:06:19,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:06:19,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:06:19,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167264575] [2024-11-10 07:06:19,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:06:19,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:06:19,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:06:19,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:06:19,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:06:19,098 INFO L87 Difference]: Start difference. First operand 309 states and 457 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:06:19,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:06:19,123 INFO L93 Difference]: Finished difference Result 548 states and 815 transitions. [2024-11-10 07:06:19,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:06:19,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-11-10 07:06:19,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:06:19,127 INFO L225 Difference]: With dead ends: 548 [2024-11-10 07:06:19,127 INFO L226 Difference]: Without dead ends: 311 [2024-11-10 07:06:19,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:06:19,128 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:06:19,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 246 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:06:19,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-10 07:06:19,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2024-11-10 07:06:19,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 258 states have (on average 1.4069767441860466) internal successors, (363), 259 states have internal predecessors, (363), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 07:06:19,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 459 transitions. [2024-11-10 07:06:19,150 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 459 transitions. Word has length 145 [2024-11-10 07:06:19,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:06:19,150 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 459 transitions. [2024-11-10 07:06:19,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:06:19,151 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 459 transitions. [2024-11-10 07:06:19,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-10 07:06:19,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:06:19,152 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:06:19,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 07:06:19,153 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:06:19,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:06:19,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1418248224, now seen corresponding path program 1 times [2024-11-10 07:06:19,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:06:19,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639028761] [2024-11-10 07:06:19,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:19,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:06:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:25,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:06:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:25,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:06:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:25,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:06:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:25,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:06:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:25,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:06:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:25,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:06:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:25,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:06:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:25,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:06:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:25,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:06:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:25,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:06:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:25,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:06:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:25,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:06:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:25,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:06:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:25,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:06:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:25,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:06:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:25,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:06:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:25,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:06:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:25,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:06:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:25,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 07:06:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:25,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:06:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:25,594 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 07:06:25,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:06:25,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639028761] [2024-11-10 07:06:25,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639028761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:06:25,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:06:25,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 07:06:25,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076884396] [2024-11-10 07:06:25,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:06:25,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 07:06:25,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:06:25,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 07:06:25,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-10 07:06:25,597 INFO L87 Difference]: Start difference. First operand 311 states and 459 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:06:27,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:06:27,891 INFO L93 Difference]: Finished difference Result 1046 states and 1514 transitions. [2024-11-10 07:06:27,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 07:06:27,892 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2024-11-10 07:06:27,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:06:27,896 INFO L225 Difference]: With dead ends: 1046 [2024-11-10 07:06:27,896 INFO L226 Difference]: Without dead ends: 811 [2024-11-10 07:06:27,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2024-11-10 07:06:27,898 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 741 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 07:06:27,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 826 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 07:06:27,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2024-11-10 07:06:27,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 319. [2024-11-10 07:06:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 266 states have (on average 1.413533834586466) internal successors, (376), 267 states have internal predecessors, (376), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 07:06:27,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 472 transitions. [2024-11-10 07:06:27,927 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 472 transitions. Word has length 146 [2024-11-10 07:06:27,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:06:27,928 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 472 transitions. [2024-11-10 07:06:27,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:06:27,928 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 472 transitions. [2024-11-10 07:06:27,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-10 07:06:27,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:06:27,931 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:06:27,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 07:06:27,931 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:06:27,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:06:27,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1155994627, now seen corresponding path program 1 times [2024-11-10 07:06:27,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:06:27,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719530841] [2024-11-10 07:06:27,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:27,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:06:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:28,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:06:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:28,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:06:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:28,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:06:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:28,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:06:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:28,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:06:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:28,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:06:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:28,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:06:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:28,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:06:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:28,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:06:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:28,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:06:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:28,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:06:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:28,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:06:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:28,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:06:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:28,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:06:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:28,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:06:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:29,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:06:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:29,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:06:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:29,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:06:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:29,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 07:06:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:29,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:06:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:29,009 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 07:06:29,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:06:29,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719530841] [2024-11-10 07:06:29,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719530841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:06:29,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:06:29,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 07:06:29,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676580882] [2024-11-10 07:06:29,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:06:29,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 07:06:29,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:06:29,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 07:06:29,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-10 07:06:29,012 INFO L87 Difference]: Start difference. First operand 319 states and 472 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:06:30,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:06:30,295 INFO L93 Difference]: Finished difference Result 1072 states and 1556 transitions. [2024-11-10 07:06:30,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 07:06:30,295 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2024-11-10 07:06:30,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:06:30,301 INFO L225 Difference]: With dead ends: 1072 [2024-11-10 07:06:30,301 INFO L226 Difference]: Without dead ends: 828 [2024-11-10 07:06:30,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2024-11-10 07:06:30,303 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 688 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 07:06:30,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 856 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 07:06:30,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2024-11-10 07:06:30,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 637. [2024-11-10 07:06:30,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 545 states have (on average 1.4275229357798165) internal successors, (778), 549 states have internal predecessors, (778), 82 states have call successors, (82), 9 states have call predecessors, (82), 9 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-10 07:06:30,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 942 transitions. [2024-11-10 07:06:30,358 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 942 transitions. Word has length 146 [2024-11-10 07:06:30,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:06:30,358 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 942 transitions. [2024-11-10 07:06:30,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:06:30,359 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 942 transitions. [2024-11-10 07:06:30,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-10 07:06:30,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:06:30,360 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:06:30,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 07:06:30,361 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:06:30,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:06:30,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1449397634, now seen corresponding path program 1 times [2024-11-10 07:06:30,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:06:30,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228822597] [2024-11-10 07:06:30,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:30,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:06:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:30,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:06:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:30,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:06:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:30,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:06:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:30,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:06:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:30,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:06:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:30,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:06:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:30,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:06:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:30,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:06:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:30,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:06:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:30,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:06:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:30,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:06:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:30,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:06:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:30,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:06:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:30,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:06:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:30,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:06:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:30,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:06:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:30,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:06:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:30,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:06:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:30,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 07:06:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:30,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:06:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:30,681 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 07:06:30,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:06:30,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228822597] [2024-11-10 07:06:30,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228822597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:06:30,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:06:30,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 07:06:30,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087834999] [2024-11-10 07:06:30,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:06:30,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:06:30,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:06:30,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:06:30,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:06:30,684 INFO L87 Difference]: Start difference. First operand 637 states and 942 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:06:30,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:06:30,985 INFO L93 Difference]: Finished difference Result 1819 states and 2690 transitions. [2024-11-10 07:06:30,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 07:06:30,987 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2024-11-10 07:06:30,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:06:30,995 INFO L225 Difference]: With dead ends: 1819 [2024-11-10 07:06:30,995 INFO L226 Difference]: Without dead ends: 1263 [2024-11-10 07:06:30,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 07:06:30,998 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 322 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:06:30,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 493 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:06:30,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2024-11-10 07:06:31,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1126. [2024-11-10 07:06:31,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 971 states have (on average 1.4335736354273945) internal successors, (1392), 978 states have internal predecessors, (1392), 140 states have call successors, (140), 14 states have call predecessors, (140), 14 states have return successors, (140), 133 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-10 07:06:31,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1672 transitions. [2024-11-10 07:06:31,084 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1672 transitions. Word has length 146 [2024-11-10 07:06:31,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:06:31,085 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1672 transitions. [2024-11-10 07:06:31,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:06:31,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1672 transitions. [2024-11-10 07:06:31,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-10 07:06:31,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:06:31,087 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:06:31,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 07:06:31,087 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:06:31,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:06:31,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1922805305, now seen corresponding path program 1 times [2024-11-10 07:06:31,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:06:31,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194010935] [2024-11-10 07:06:31,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:31,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:06:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:06:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:06:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:06:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:06:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:06:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:06:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:06:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:06:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:06:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:06:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:06:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:06:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:06:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:06:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:06:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:06:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:06:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:06:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 07:06:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:06:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,202 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 07:06:31,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:06:31,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194010935] [2024-11-10 07:06:31,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194010935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:06:31,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:06:31,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:06:31,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466065322] [2024-11-10 07:06:31,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:06:31,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:06:31,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:06:31,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:06:31,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:06:31,204 INFO L87 Difference]: Start difference. First operand 1126 states and 1672 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:06:31,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:06:31,361 INFO L93 Difference]: Finished difference Result 2764 states and 4076 transitions. [2024-11-10 07:06:31,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:06:31,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2024-11-10 07:06:31,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:06:31,369 INFO L225 Difference]: With dead ends: 2764 [2024-11-10 07:06:31,369 INFO L226 Difference]: Without dead ends: 1719 [2024-11-10 07:06:31,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:06:31,373 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 118 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:06:31,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 231 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:06:31,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2024-11-10 07:06:31,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1708. [2024-11-10 07:06:31,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1708 states, 1484 states have (on average 1.408355795148248) internal successors, (2090), 1502 states have internal predecessors, (2090), 196 states have call successors, (196), 27 states have call predecessors, (196), 27 states have return successors, (196), 178 states have call predecessors, (196), 196 states have call successors, (196) [2024-11-10 07:06:31,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2482 transitions. [2024-11-10 07:06:31,498 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2482 transitions. Word has length 146 [2024-11-10 07:06:31,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:06:31,498 INFO L471 AbstractCegarLoop]: Abstraction has 1708 states and 2482 transitions. [2024-11-10 07:06:31,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:06:31,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2482 transitions. [2024-11-10 07:06:31,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-10 07:06:31,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:06:31,501 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:06:31,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 07:06:31,501 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:06:31,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:06:31,501 INFO L85 PathProgramCache]: Analyzing trace with hash 2141900316, now seen corresponding path program 1 times [2024-11-10 07:06:31,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:06:31,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190580385] [2024-11-10 07:06:31,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:31,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:06:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:06:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:06:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:06:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:06:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:06:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:06:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:06:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:06:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:06:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:06:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:06:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:06:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:06:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:06:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:06:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:06:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:06:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:06:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 07:06:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:06:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:31,767 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 07:06:31,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:06:31,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190580385] [2024-11-10 07:06:31,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190580385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:06:31,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:06:31,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 07:06:31,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729369699] [2024-11-10 07:06:31,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:06:31,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 07:06:31,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:06:31,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 07:06:31,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 07:06:31,770 INFO L87 Difference]: Start difference. First operand 1708 states and 2482 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:06:32,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:06:32,675 INFO L93 Difference]: Finished difference Result 5628 states and 7851 transitions. [2024-11-10 07:06:32,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 07:06:32,676 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2024-11-10 07:06:32,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:06:32,699 INFO L225 Difference]: With dead ends: 5628 [2024-11-10 07:06:32,699 INFO L226 Difference]: Without dead ends: 4779 [2024-11-10 07:06:32,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 07:06:32,703 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 229 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 07:06:32,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 669 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 07:06:32,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4779 states. [2024-11-10 07:06:33,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4779 to 3619. [2024-11-10 07:06:33,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3619 states, 3231 states have (on average 1.3890436397400185) internal successors, (4488), 3293 states have internal predecessors, (4488), 316 states have call successors, (316), 71 states have call predecessors, (316), 71 states have return successors, (316), 254 states have call predecessors, (316), 316 states have call successors, (316) [2024-11-10 07:06:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3619 states to 3619 states and 5120 transitions. [2024-11-10 07:06:33,131 INFO L78 Accepts]: Start accepts. Automaton has 3619 states and 5120 transitions. Word has length 146 [2024-11-10 07:06:33,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:06:33,132 INFO L471 AbstractCegarLoop]: Abstraction has 3619 states and 5120 transitions. [2024-11-10 07:06:33,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:06:33,132 INFO L276 IsEmpty]: Start isEmpty. Operand 3619 states and 5120 transitions. [2024-11-10 07:06:33,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-10 07:06:33,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:06:33,137 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:06:33,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 07:06:33,137 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:06:33,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:06:33,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1564818852, now seen corresponding path program 1 times [2024-11-10 07:06:33,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:06:33,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219761940] [2024-11-10 07:06:33,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:33,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:06:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:39,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:06:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:39,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:06:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:39,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:06:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:39,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:06:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:39,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:06:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:39,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:06:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:39,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:06:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:39,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:06:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:39,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:06:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:39,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:06:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:39,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:06:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:39,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:06:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:39,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:06:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:39,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:06:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:39,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:06:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:39,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:06:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:39,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:06:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:39,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:06:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:39,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 07:06:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:39,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:06:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:39,593 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 07:06:39,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:06:39,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219761940] [2024-11-10 07:06:39,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219761940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:06:39,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:06:39,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 07:06:39,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493354230] [2024-11-10 07:06:39,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:06:39,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 07:06:39,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:06:39,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 07:06:39,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-10 07:06:39,595 INFO L87 Difference]: Start difference. First operand 3619 states and 5120 transitions. Second operand has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 07:06:41,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:06:41,655 INFO L93 Difference]: Finished difference Result 6103 states and 8613 transitions. [2024-11-10 07:06:41,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 07:06:41,656 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 146 [2024-11-10 07:06:41,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:06:41,675 INFO L225 Difference]: With dead ends: 6103 [2024-11-10 07:06:41,676 INFO L226 Difference]: Without dead ends: 4267 [2024-11-10 07:06:41,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2024-11-10 07:06:41,683 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 651 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:06:41,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1038 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 07:06:41,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4267 states. [2024-11-10 07:06:41,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4267 to 3620. [2024-11-10 07:06:41,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3620 states, 3232 states have (on average 1.3892326732673268) internal successors, (4490), 3294 states have internal predecessors, (4490), 316 states have call successors, (316), 71 states have call predecessors, (316), 71 states have return successors, (316), 254 states have call predecessors, (316), 316 states have call successors, (316) [2024-11-10 07:06:42,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3620 states to 3620 states and 5122 transitions. [2024-11-10 07:06:42,009 INFO L78 Accepts]: Start accepts. Automaton has 3620 states and 5122 transitions. Word has length 146 [2024-11-10 07:06:42,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:06:42,009 INFO L471 AbstractCegarLoop]: Abstraction has 3620 states and 5122 transitions. [2024-11-10 07:06:42,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 07:06:42,010 INFO L276 IsEmpty]: Start isEmpty. Operand 3620 states and 5122 transitions. [2024-11-10 07:06:42,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-10 07:06:42,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:06:42,013 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:06:42,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 07:06:42,014 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:06:42,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:06:42,014 INFO L85 PathProgramCache]: Analyzing trace with hash -81286878, now seen corresponding path program 1 times [2024-11-10 07:06:42,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:06:42,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851498831] [2024-11-10 07:06:42,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:42,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:06:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:46,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:06:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:46,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:06:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:46,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:06:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:46,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:06:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:46,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:06:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:46,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:06:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:46,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:06:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:46,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:06:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:46,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:06:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:46,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:06:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:46,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:06:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:46,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:06:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:46,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:06:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:46,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:06:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:46,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:06:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:46,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:06:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:46,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:06:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:46,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:06:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:46,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 07:06:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:46,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:06:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:46,550 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 07:06:46,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:06:46,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851498831] [2024-11-10 07:06:46,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851498831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:06:46,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:06:46,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 07:06:46,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812914611] [2024-11-10 07:06:46,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:06:46,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 07:06:46,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:06:46,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 07:06:46,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-10 07:06:46,555 INFO L87 Difference]: Start difference. First operand 3620 states and 5122 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:06:47,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:06:47,909 INFO L93 Difference]: Finished difference Result 6622 states and 9336 transitions. [2024-11-10 07:06:47,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 07:06:47,910 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2024-11-10 07:06:47,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:06:47,934 INFO L225 Difference]: With dead ends: 6622 [2024-11-10 07:06:47,935 INFO L226 Difference]: Without dead ends: 4807 [2024-11-10 07:06:47,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2024-11-10 07:06:47,942 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 347 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 07:06:47,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 656 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 07:06:47,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4807 states. [2024-11-10 07:06:48,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4807 to 3641. [2024-11-10 07:06:48,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3641 states, 3253 states have (on average 1.3891792191822934) internal successors, (4519), 3315 states have internal predecessors, (4519), 316 states have call successors, (316), 71 states have call predecessors, (316), 71 states have return successors, (316), 254 states have call predecessors, (316), 316 states have call successors, (316) [2024-11-10 07:06:48,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 5151 transitions. [2024-11-10 07:06:48,287 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 5151 transitions. Word has length 146 [2024-11-10 07:06:48,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:06:48,288 INFO L471 AbstractCegarLoop]: Abstraction has 3641 states and 5151 transitions. [2024-11-10 07:06:48,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:06:48,288 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 5151 transitions. [2024-11-10 07:06:48,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-10 07:06:48,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:06:48,292 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:06:48,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 07:06:48,293 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:06:48,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:06:48,293 INFO L85 PathProgramCache]: Analyzing trace with hash -589450119, now seen corresponding path program 1 times [2024-11-10 07:06:48,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:06:48,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102100207] [2024-11-10 07:06:48,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:48,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:06:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:49,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:06:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:49,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:06:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:49,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:06:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:49,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:06:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:49,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:06:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:49,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:06:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:49,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:06:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:49,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:06:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:49,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:06:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:49,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:06:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:49,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:06:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:49,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:06:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:49,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:06:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:49,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:06:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:49,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:06:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:49,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:06:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:49,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:06:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:49,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:06:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:49,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 07:06:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:49,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:06:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:49,394 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 07:06:49,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:06:49,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102100207] [2024-11-10 07:06:49,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102100207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:06:49,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:06:49,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 07:06:49,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585855697] [2024-11-10 07:06:49,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:06:49,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 07:06:49,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:06:49,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 07:06:49,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:06:49,396 INFO L87 Difference]: Start difference. First operand 3641 states and 5151 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:06:51,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:06:51,056 INFO L93 Difference]: Finished difference Result 9105 states and 12778 transitions. [2024-11-10 07:06:51,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 07:06:51,056 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2024-11-10 07:06:51,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:06:51,092 INFO L225 Difference]: With dead ends: 9105 [2024-11-10 07:06:51,093 INFO L226 Difference]: Without dead ends: 5544 [2024-11-10 07:06:51,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2024-11-10 07:06:51,102 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 445 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 07:06:51,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1000 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 07:06:51,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5544 states. [2024-11-10 07:06:51,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5544 to 4316. [2024-11-10 07:06:51,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4316 states, 3927 states have (on average 1.4064171122994653) internal successors, (5523), 3989 states have internal predecessors, (5523), 316 states have call successors, (316), 72 states have call predecessors, (316), 72 states have return successors, (316), 254 states have call predecessors, (316), 316 states have call successors, (316) [2024-11-10 07:06:51,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4316 states to 4316 states and 6155 transitions. [2024-11-10 07:06:51,479 INFO L78 Accepts]: Start accepts. Automaton has 4316 states and 6155 transitions. Word has length 146 [2024-11-10 07:06:51,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:06:51,480 INFO L471 AbstractCegarLoop]: Abstraction has 4316 states and 6155 transitions. [2024-11-10 07:06:51,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:06:51,480 INFO L276 IsEmpty]: Start isEmpty. Operand 4316 states and 6155 transitions. [2024-11-10 07:06:51,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-10 07:06:51,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:06:51,484 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:06:51,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 07:06:51,484 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:06:51,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:06:51,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1819100123, now seen corresponding path program 1 times [2024-11-10 07:06:51,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:06:51,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44969865] [2024-11-10 07:06:51,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:51,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:06:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:51,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:06:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:51,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:06:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:51,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:06:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:51,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:06:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:51,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:06:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:51,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:06:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:51,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:06:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:51,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:06:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:51,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:06:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:51,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:06:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:51,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:06:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:51,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:06:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:51,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:06:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:51,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:06:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:51,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:06:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:51,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:06:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:51,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:06:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:51,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:06:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:51,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 07:06:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:51,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:06:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:51,744 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 07:06:51,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:06:51,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44969865] [2024-11-10 07:06:51,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44969865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:06:51,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:06:51,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:06:51,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615957746] [2024-11-10 07:06:51,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:06:51,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:06:51,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:06:51,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:06:51,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:06:51,746 INFO L87 Difference]: Start difference. First operand 4316 states and 6155 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)