./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-67.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-while_file-67.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 83ed3ec8bcd09c585992790b95e2966a76e5b0e36e2946c8579c171a77252508 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:17:20,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:17:20,537 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:17:20,542 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:17:20,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:17:20,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:17:20,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:17:20,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:17:20,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:17:20,568 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:17:20,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:17:20,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:17:20,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:17:20,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:17:20,569 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:17:20,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:17:20,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:17:20,570 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:17:20,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:17:20,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:17:20,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:17:20,574 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:17:20,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:17:20,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:17:20,574 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:17:20,575 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:17:20,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:17:20,575 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:17:20,575 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:17:20,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:17:20,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:17:20,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:17:20,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:17:20,576 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:17:20,576 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:17:20,576 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:17:20,576 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:17:20,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:17:20,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:17:20,577 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:17:20,577 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:17:20,578 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:17:20,578 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 -> 83ed3ec8bcd09c585992790b95e2966a76e5b0e36e2946c8579c171a77252508 [2024-11-10 07:17:20,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:17:20,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:17:20,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:17:20,837 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:17:20,837 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:17:20,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-67.i [2024-11-10 07:17:22,047 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:17:22,211 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:17:22,212 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-67.i [2024-11-10 07:17:22,226 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c1650639/892e878025d74030a3e9e10684dd0f31/FLAGc2548799f [2024-11-10 07:17:22,595 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c1650639/892e878025d74030a3e9e10684dd0f31 [2024-11-10 07:17:22,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:17:22,598 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:17:22,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:17:22,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:17:22,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:17:22,604 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:17:22" (1/1) ... [2024-11-10 07:17:22,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc30534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:22, skipping insertion in model container [2024-11-10 07:17:22,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:17:22" (1/1) ... [2024-11-10 07:17:22,635 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:17:22,769 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-while_file-67.i[916,929] [2024-11-10 07:17:22,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:17:22,841 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:17:22,849 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-while_file-67.i[916,929] [2024-11-10 07:17:22,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:17:22,920 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:17:22,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:22 WrapperNode [2024-11-10 07:17:22,921 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:17:22,922 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:17:22,922 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:17:22,922 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:17:22,934 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:17:22" (1/1) ... [2024-11-10 07:17:22,945 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:17:22" (1/1) ... [2024-11-10 07:17:22,981 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 235 [2024-11-10 07:17:22,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:17:22,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:17:22,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:17:22,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:17:22,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:22" (1/1) ... [2024-11-10 07:17:22,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:22" (1/1) ... [2024-11-10 07:17:22,996 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:22" (1/1) ... [2024-11-10 07:17:23,016 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:17:23,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:22" (1/1) ... [2024-11-10 07:17:23,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:22" (1/1) ... [2024-11-10 07:17:23,029 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:22" (1/1) ... [2024-11-10 07:17:23,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:22" (1/1) ... [2024-11-10 07:17:23,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:22" (1/1) ... [2024-11-10 07:17:23,038 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:22" (1/1) ... [2024-11-10 07:17:23,043 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:17:23,044 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:17:23,044 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:17:23,044 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:17:23,045 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:22" (1/1) ... [2024-11-10 07:17:23,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:17:23,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:17:23,078 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:17:23,080 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:17:23,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:17:23,120 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:17:23,121 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:17:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:17:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:17:23,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:17:23,235 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:17:23,237 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:17:23,578 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L209: havoc property_#t~bitwise22#1; [2024-11-10 07:17:23,610 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-10 07:17:23,611 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:17:23,625 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:17:23,627 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:17:23,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:17:23 BoogieIcfgContainer [2024-11-10 07:17:23,627 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:17:23,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:17:23,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:17:23,632 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:17:23,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:17:22" (1/3) ... [2024-11-10 07:17:23,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f45b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:17:23, skipping insertion in model container [2024-11-10 07:17:23,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:22" (2/3) ... [2024-11-10 07:17:23,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f45b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:17:23, skipping insertion in model container [2024-11-10 07:17:23,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:17:23" (3/3) ... [2024-11-10 07:17:23,638 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-67.i [2024-11-10 07:17:23,651 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:17:23,652 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:17:23,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:17:23,706 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;@7c24ebc1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:17:23,706 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:17:23,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 74 states have (on average 1.445945945945946) internal successors, (107), 75 states have internal predecessors, (107), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-10 07:17:23,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-10 07:17:23,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:17:23,721 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:23,721 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:17:23,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:17:23,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1171267496, now seen corresponding path program 1 times [2024-11-10 07:17:23,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:17:23,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163698787] [2024-11-10 07:17:23,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:17:23,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:17:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:17:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:17:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:17:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 07:17:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 07:17:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 07:17:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 07:17:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:17:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 07:17:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:17:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:17:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:17:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 07:17:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 07:17:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 07:17:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 07:17:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 07:17:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:17:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:17:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:17:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:17:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 07:17:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:17:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 07:17:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:17:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 07:17:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:17:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 07:17:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 07:17:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 07:17:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 07:17:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 07:17:24,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:17:24,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163698787] [2024-11-10 07:17:24,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163698787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:17:24,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:17:24,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:17:24,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255345261] [2024-11-10 07:17:24,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:17:24,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:17:24,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:17:24,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:17:24,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:17:24,224 INFO L87 Difference]: Start difference. First operand has 108 states, 74 states have (on average 1.445945945945946) internal successors, (107), 75 states have internal predecessors, (107), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-10 07:17:24,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:17:24,260 INFO L93 Difference]: Finished difference Result 208 states and 362 transitions. [2024-11-10 07:17:24,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:17:24,264 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 205 [2024-11-10 07:17:24,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:17:24,271 INFO L225 Difference]: With dead ends: 208 [2024-11-10 07:17:24,271 INFO L226 Difference]: Without dead ends: 103 [2024-11-10 07:17:24,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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:17:24,277 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:17:24,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:17:24,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-10 07:17:24,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-10 07:17:24,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 70 states have internal predecessors, (99), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-10 07:17:24,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 161 transitions. [2024-11-10 07:17:24,315 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 161 transitions. Word has length 205 [2024-11-10 07:17:24,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:17:24,315 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 161 transitions. [2024-11-10 07:17:24,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-10 07:17:24,316 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 161 transitions. [2024-11-10 07:17:24,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-10 07:17:24,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:17:24,320 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:24,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:17:24,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:17:24,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:17:24,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1357499747, now seen corresponding path program 1 times [2024-11-10 07:17:24,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:17:24,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784170924] [2024-11-10 07:17:24,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:17:24,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:17:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:17:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:17:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:17:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 07:17:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 07:17:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 07:17:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 07:17:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:17:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 07:17:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:17:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:17:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:17:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 07:17:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 07:17:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 07:17:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 07:17:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 07:17:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:17:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:17:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:17:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:17:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 07:17:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:17:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 07:17:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:17:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 07:17:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:17:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 07:17:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 07:17:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 07:17:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 07:17:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:24,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 07:17:24,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:17:24,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784170924] [2024-11-10 07:17:24,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784170924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:17:24,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:17:24,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:17:24,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363262617] [2024-11-10 07:17:24,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:17:24,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:17:24,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:17:24,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:17:24,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:17:24,688 INFO L87 Difference]: Start difference. First operand 103 states and 161 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 07:17:24,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:17:24,796 INFO L93 Difference]: Finished difference Result 299 states and 469 transitions. [2024-11-10 07:17:24,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:17:24,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2024-11-10 07:17:24,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:17:24,802 INFO L225 Difference]: With dead ends: 299 [2024-11-10 07:17:24,802 INFO L226 Difference]: Without dead ends: 199 [2024-11-10 07:17:24,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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:17:24,804 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 139 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:17:24,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 384 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:17:24,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-10 07:17:24,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2024-11-10 07:17:24,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 131 states have (on average 1.366412213740458) internal successors, (179), 131 states have internal predecessors, (179), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-10 07:17:24,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 303 transitions. [2024-11-10 07:17:24,839 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 303 transitions. Word has length 205 [2024-11-10 07:17:24,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:17:24,840 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 303 transitions. [2024-11-10 07:17:24,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 07:17:24,840 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 303 transitions. [2024-11-10 07:17:24,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-10 07:17:24,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:17:24,843 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:24,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:17:24,843 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:17:24,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:17:24,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1310868015, now seen corresponding path program 1 times [2024-11-10 07:17:24,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:17:24,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350338331] [2024-11-10 07:17:24,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:17:24,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:17:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:17:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:17:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:17:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 07:17:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 07:17:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 07:17:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 07:17:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:17:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 07:17:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:17:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:17:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:17:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 07:17:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 07:17:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 07:17:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 07:17:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 07:17:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:17:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:17:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:17:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:17:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 07:17:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:17:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 07:17:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:17:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 07:17:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:17:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 07:17:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 07:17:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 07:17:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 07:17:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:25,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 07:17:25,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:17:25,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350338331] [2024-11-10 07:17:25,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350338331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:17:25,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:17:25,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:17:25,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061129452] [2024-11-10 07:17:25,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:17:25,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:17:25,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:17:25,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:17:25,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:17:25,680 INFO L87 Difference]: Start difference. First operand 196 states and 303 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 07:17:25,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:17:25,956 INFO L93 Difference]: Finished difference Result 617 states and 950 transitions. [2024-11-10 07:17:25,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:17:25,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2024-11-10 07:17:25,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:17:25,960 INFO L225 Difference]: With dead ends: 617 [2024-11-10 07:17:25,960 INFO L226 Difference]: Without dead ends: 424 [2024-11-10 07:17:25,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 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:17:25,966 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 172 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:17:25,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 450 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:17:25,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-10 07:17:26,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 402. [2024-11-10 07:17:26,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 273 states have (on average 1.3626373626373627) internal successors, (372), 273 states have internal predecessors, (372), 124 states have call successors, (124), 4 states have call predecessors, (124), 4 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-10 07:17:26,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 620 transitions. [2024-11-10 07:17:26,032 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 620 transitions. Word has length 206 [2024-11-10 07:17:26,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:17:26,034 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 620 transitions. [2024-11-10 07:17:26,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 07:17:26,034 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 620 transitions. [2024-11-10 07:17:26,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-10 07:17:26,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:17:26,040 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:26,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 07:17:26,041 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:17:26,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:17:26,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1086315043, now seen corresponding path program 1 times [2024-11-10 07:17:26,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:17:26,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144327023] [2024-11-10 07:17:26,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:17:26,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:17:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:17:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:17:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:17:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 07:17:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 07:17:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 07:17:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 07:17:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:17:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 07:17:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:17:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:17:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:17:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 07:17:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 07:17:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 07:17:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 07:17:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 07:17:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:17:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:17:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:17:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:17:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 07:17:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:17:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 07:17:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:17:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 07:17:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:17:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 07:17:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 07:17:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 07:17:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 07:17:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:31,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 07:17:31,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:17:31,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144327023] [2024-11-10 07:17:31,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144327023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:17:31,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:17:31,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 07:17:31,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024901232] [2024-11-10 07:17:31,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:17:31,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 07:17:31,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:17:31,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 07:17:31,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 07:17:31,810 INFO L87 Difference]: Start difference. First operand 402 states and 620 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 07:17:32,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:17:32,853 INFO L93 Difference]: Finished difference Result 1205 states and 1848 transitions. [2024-11-10 07:17:32,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 07:17:32,853 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2024-11-10 07:17:32,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:17:32,863 INFO L225 Difference]: With dead ends: 1205 [2024-11-10 07:17:32,863 INFO L226 Difference]: Without dead ends: 1010 [2024-11-10 07:17:32,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-10 07:17:32,867 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 630 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 07:17:32,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 801 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 07:17:32,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2024-11-10 07:17:32,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 789. [2024-11-10 07:17:32,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 564 states have (on average 1.4095744680851063) internal successors, (795), 564 states have internal predecessors, (795), 217 states have call successors, (217), 7 states have call predecessors, (217), 7 states have return successors, (217), 217 states have call predecessors, (217), 217 states have call successors, (217) [2024-11-10 07:17:32,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1229 transitions. [2024-11-10 07:17:32,964 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1229 transitions. Word has length 208 [2024-11-10 07:17:32,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:17:32,965 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1229 transitions. [2024-11-10 07:17:32,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 07:17:32,966 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1229 transitions. [2024-11-10 07:17:32,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-10 07:17:32,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:17:32,968 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:32,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 07:17:32,968 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:17:32,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:17:32,969 INFO L85 PathProgramCache]: Analyzing trace with hash -710636316, now seen corresponding path program 1 times [2024-11-10 07:17:32,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:17:32,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461691852] [2024-11-10 07:17:32,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:17:32,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:17:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:17:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:17:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:17:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 07:17:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 07:17:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 07:17:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 07:17:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:17:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 07:17:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:17:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:17:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:17:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 07:17:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 07:17:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 07:17:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 07:17:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 07:17:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:17:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:17:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:17:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:17:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 07:17:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:17:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 07:17:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:17:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 07:17:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:17:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 07:17:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 07:17:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 07:17:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 07:17:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 07:17:33,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:17:33,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461691852] [2024-11-10 07:17:33,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461691852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:17:33,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:17:33,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 07:17:33,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729971542] [2024-11-10 07:17:33,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:17:33,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:17:33,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:17:33,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:17:33,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:17:33,216 INFO L87 Difference]: Start difference. First operand 789 states and 1229 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 07:17:33,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:17:33,373 INFO L93 Difference]: Finished difference Result 1866 states and 2911 transitions. [2024-11-10 07:17:33,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:17:33,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2024-11-10 07:17:33,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:17:33,380 INFO L225 Difference]: With dead ends: 1866 [2024-11-10 07:17:33,380 INFO L226 Difference]: Without dead ends: 1148 [2024-11-10 07:17:33,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 07:17:33,384 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 149 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:17:33,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 473 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:17:33,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2024-11-10 07:17:33,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1145. [2024-11-10 07:17:33,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 824 states have (on average 1.4077669902912622) internal successors, (1160), 824 states have internal predecessors, (1160), 310 states have call successors, (310), 10 states have call predecessors, (310), 10 states have return successors, (310), 310 states have call predecessors, (310), 310 states have call successors, (310) [2024-11-10 07:17:33,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1780 transitions. [2024-11-10 07:17:33,480 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1780 transitions. Word has length 208 [2024-11-10 07:17:33,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:17:33,481 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1780 transitions. [2024-11-10 07:17:33,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 07:17:33,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1780 transitions. [2024-11-10 07:17:33,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-10 07:17:33,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:17:33,482 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:33,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 07:17:33,483 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:17:33,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:17:33,484 INFO L85 PathProgramCache]: Analyzing trace with hash 575780866, now seen corresponding path program 1 times [2024-11-10 07:17:33,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:17:33,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140770321] [2024-11-10 07:17:33,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:17:33,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:17:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:17:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:17:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:17:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 07:17:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 07:17:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 07:17:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 07:17:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:17:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 07:17:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:17:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:17:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:17:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 07:17:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 07:17:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 07:17:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 07:17:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 07:17:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:17:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:17:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:17:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:17:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 07:17:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:17:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 07:17:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:17:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 07:17:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:17:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 07:17:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 07:17:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 07:17:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 07:17:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:33,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 07:17:33,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:17:33,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140770321] [2024-11-10 07:17:33,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140770321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:17:33,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:17:33,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:17:33,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106965909] [2024-11-10 07:17:33,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:17:33,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:17:33,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:17:33,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:17:33,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:17:33,984 INFO L87 Difference]: Start difference. First operand 1145 states and 1780 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 07:17:34,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:17:34,271 INFO L93 Difference]: Finished difference Result 2283 states and 3532 transitions. [2024-11-10 07:17:34,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:17:34,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2024-11-10 07:17:34,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:17:34,280 INFO L225 Difference]: With dead ends: 2283 [2024-11-10 07:17:34,280 INFO L226 Difference]: Without dead ends: 1199 [2024-11-10 07:17:34,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 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:17:34,284 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 166 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:17:34,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 452 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:17:34,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2024-11-10 07:17:34,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1151. [2024-11-10 07:17:34,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 830 states have (on average 1.3963855421686746) internal successors, (1159), 830 states have internal predecessors, (1159), 310 states have call successors, (310), 10 states have call predecessors, (310), 10 states have return successors, (310), 310 states have call predecessors, (310), 310 states have call successors, (310) [2024-11-10 07:17:34,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1779 transitions. [2024-11-10 07:17:34,440 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1779 transitions. Word has length 208 [2024-11-10 07:17:34,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:17:34,440 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1779 transitions. [2024-11-10 07:17:34,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 07:17:34,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1779 transitions. [2024-11-10 07:17:34,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-10 07:17:34,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:17:34,442 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:34,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 07:17:34,443 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:17:34,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:17:34,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2113651307, now seen corresponding path program 1 times [2024-11-10 07:17:34,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:17:34,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216902082] [2024-11-10 07:17:34,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:17:34,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:17:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:17:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:17:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:17:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 07:17:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 07:17:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 07:17:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 07:17:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:17:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 07:17:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:17:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:17:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:17:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 07:17:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 07:17:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 07:17:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 07:17:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 07:17:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:17:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:17:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:17:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:17:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 07:17:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:17:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 07:17:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:17:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 07:17:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:17:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 07:17:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 07:17:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 07:17:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 07:17:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:34,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 07:17:34,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:17:34,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216902082] [2024-11-10 07:17:34,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216902082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:17:34,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:17:34,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 07:17:34,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595420337] [2024-11-10 07:17:34,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:17:34,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:17:34,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:17:34,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:17:34,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:17:34,749 INFO L87 Difference]: Start difference. First operand 1151 states and 1779 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 07:17:34,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:17:34,953 INFO L93 Difference]: Finished difference Result 2171 states and 3329 transitions. [2024-11-10 07:17:34,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:17:34,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 210 [2024-11-10 07:17:34,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:17:34,963 INFO L225 Difference]: With dead ends: 2171 [2024-11-10 07:17:34,963 INFO L226 Difference]: Without dead ends: 1088 [2024-11-10 07:17:34,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:17:34,968 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 189 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:17:34,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 610 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:17:34,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2024-11-10 07:17:35,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1023. [2024-11-10 07:17:35,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 702 states have (on average 1.3504273504273505) internal successors, (948), 702 states have internal predecessors, (948), 310 states have call successors, (310), 10 states have call predecessors, (310), 10 states have return successors, (310), 310 states have call predecessors, (310), 310 states have call successors, (310) [2024-11-10 07:17:35,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1568 transitions. [2024-11-10 07:17:35,076 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1568 transitions. Word has length 210 [2024-11-10 07:17:35,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:17:35,077 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1568 transitions. [2024-11-10 07:17:35,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 07:17:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1568 transitions. [2024-11-10 07:17:35,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-10 07:17:35,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:17:35,079 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:35,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 07:17:35,079 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:17:35,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:17:35,080 INFO L85 PathProgramCache]: Analyzing trace with hash 550753479, now seen corresponding path program 1 times [2024-11-10 07:17:35,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:17:35,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866622401] [2024-11-10 07:17:35,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:17:35,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:17:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:45,073 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 07:17:54,421 WARN L286 SmtUtils]: Spent 5.32s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 07:18:02,442 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 07:18:18,512 WARN L286 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 07:18:34,557 WARN L286 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)