./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.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 c075bf31c8a61d5818086da4c01a54dc9522c53729e14bb5c6eb6f9ba650fc63 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:50:15,521 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:50:15,607 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 05:50:15,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:50:15,613 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:50:15,635 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:50:15,636 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:50:15,637 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:50:15,637 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:50:15,638 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:50:15,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:50:15,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:50:15,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:50:15,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:50:15,640 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:50:15,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:50:15,640 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:50:15,641 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:50:15,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 05:50:15,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:50:15,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:50:15,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:50:15,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:50:15,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:50:15,643 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:50:15,644 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:50:15,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:50:15,644 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:50:15,645 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:50:15,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:50:15,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:50:15,646 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:50:15,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:50:15,646 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:50:15,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:50:15,647 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:50:15,647 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 05:50:15,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 05:50:15,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:50:15,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:50:15,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:50:15,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:50:15,649 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 -> c075bf31c8a61d5818086da4c01a54dc9522c53729e14bb5c6eb6f9ba650fc63 [2024-10-24 05:50:15,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:50:15,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:50:15,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:50:15,932 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:50:15,933 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:50:15,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2024-10-24 05:50:17,410 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:50:17,638 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:50:17,639 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2024-10-24 05:50:17,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9bf684b2/ec0407bd0ba6409cbfbc7a8b3192f23c/FLAGd86022ca3 [2024-10-24 05:50:17,671 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9bf684b2/ec0407bd0ba6409cbfbc7a8b3192f23c [2024-10-24 05:50:17,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:50:17,677 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:50:17,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:50:17,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:50:17,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:50:17,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:50:17" (1/1) ... [2024-10-24 05:50:17,688 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14af4324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:17, skipping insertion in model container [2024-10-24 05:50:17,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:50:17" (1/1) ... [2024-10-24 05:50:17,731 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:50:17,908 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i[916,929] [2024-10-24 05:50:18,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:50:18,034 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:50:18,050 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i[916,929] [2024-10-24 05:50:18,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:50:18,118 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:50:18,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:18 WrapperNode [2024-10-24 05:50:18,118 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:50:18,120 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:50:18,120 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:50:18,120 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:50:18,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:18" (1/1) ... [2024-10-24 05:50:18,142 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:18" (1/1) ... [2024-10-24 05:50:18,184 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 318 [2024-10-24 05:50:18,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:50:18,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:50:18,186 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:50:18,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:50:18,198 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:18" (1/1) ... [2024-10-24 05:50:18,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:18" (1/1) ... [2024-10-24 05:50:18,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:18" (1/1) ... [2024-10-24 05:50:18,232 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 05:50:18,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:18" (1/1) ... [2024-10-24 05:50:18,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:18" (1/1) ... [2024-10-24 05:50:18,244 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:18" (1/1) ... [2024-10-24 05:50:18,249 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:18" (1/1) ... [2024-10-24 05:50:18,252 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:18" (1/1) ... [2024-10-24 05:50:18,255 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:18" (1/1) ... [2024-10-24 05:50:18,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:50:18,263 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:50:18,263 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:50:18,263 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:50:18,264 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:18" (1/1) ... [2024-10-24 05:50:18,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:50:18,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:50:18,307 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 05:50:18,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:50:18,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:50:18,364 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:50:18,364 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:50:18,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 05:50:18,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:50:18,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:50:18,491 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:50:18,493 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:50:19,148 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-24 05:50:19,148 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:50:19,209 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:50:19,210 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:50:19,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:50:19 BoogieIcfgContainer [2024-10-24 05:50:19,211 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:50:19,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:50:19,213 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:50:19,216 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:50:19,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:50:17" (1/3) ... [2024-10-24 05:50:19,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c767b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:50:19, skipping insertion in model container [2024-10-24 05:50:19,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:18" (2/3) ... [2024-10-24 05:50:19,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c767b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:50:19, skipping insertion in model container [2024-10-24 05:50:19,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:50:19" (3/3) ... [2024-10-24 05:50:19,220 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2024-10-24 05:50:19,233 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:50:19,233 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:50:19,303 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:50:19,309 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;@482cda36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:50:19,309 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:50:19,313 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 85 states have (on average 1.576470588235294) internal successors, (134), 86 states have internal predecessors, (134), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-24 05:50:19,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-24 05:50:19,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:50:19,333 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:50:19,333 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:50:19,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:50:19,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1103932151, now seen corresponding path program 1 times [2024-10-24 05:50:19,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:50:19,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548682339] [2024-10-24 05:50:19,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:50:19,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:50:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:50:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:50:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:50:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:50:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:50:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:50:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:50:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:50:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:50:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:50:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:50:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:50:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:50:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:50:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:50:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:50:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:50:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:50:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:50:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:50:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:50:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:50:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:50:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:50:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:50:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:50:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:50:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:50:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:50:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:50:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 05:50:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 05:50:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 05:50:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 05:50:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 05:50:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-24 05:50:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-24 05:50:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 05:50:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-24 05:50:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:20,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-24 05:50:20,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:50:20,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548682339] [2024-10-24 05:50:20,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548682339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:50:20,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:50:20,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:50:20,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177510277] [2024-10-24 05:50:20,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:50:20,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 05:50:20,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:50:20,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 05:50:20,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:50:20,425 INFO L87 Difference]: Start difference. First operand has 127 states, 85 states have (on average 1.576470588235294) internal successors, (134), 86 states have internal predecessors, (134), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:20,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:50:20,563 INFO L93 Difference]: Finished difference Result 317 states and 607 transitions. [2024-10-24 05:50:20,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 05:50:20,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 246 [2024-10-24 05:50:20,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:50:20,586 INFO L225 Difference]: With dead ends: 317 [2024-10-24 05:50:20,586 INFO L226 Difference]: Without dead ends: 191 [2024-10-24 05:50:20,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 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-10-24 05:50:20,598 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 198 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:50:20,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 395 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:50:20,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-24 05:50:20,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 125. [2024-10-24 05:50:20,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 84 states have (on average 1.5) internal successors, (126), 84 states have internal predecessors, (126), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-24 05:50:20,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 204 transitions. [2024-10-24 05:50:20,664 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 204 transitions. Word has length 246 [2024-10-24 05:50:20,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:50:20,669 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 204 transitions. [2024-10-24 05:50:20,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:20,672 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 204 transitions. [2024-10-24 05:50:20,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-24 05:50:20,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:50:20,682 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:50:20,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:50:20,683 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:50:20,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:50:20,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1796965249, now seen corresponding path program 1 times [2024-10-24 05:50:20,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:50:20,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968869680] [2024-10-24 05:50:20,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:50:20,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:50:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:50:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:50:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:50:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:50:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:50:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:50:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:50:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:50:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:50:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:50:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:50:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:50:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:50:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:50:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:50:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:50:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:50:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:50:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:50:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:50:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:50:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:50:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:50:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:50:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:50:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:50:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:50:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:50:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:50:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:50:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 05:50:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 05:50:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 05:50:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 05:50:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 05:50:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-24 05:50:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-24 05:50:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 05:50:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-24 05:50:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-24 05:50:21,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:50:21,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968869680] [2024-10-24 05:50:21,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968869680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:50:21,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:50:21,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 05:50:21,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034687086] [2024-10-24 05:50:21,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:50:21,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 05:50:21,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:50:21,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 05:50:21,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:50:21,277 INFO L87 Difference]: Start difference. First operand 125 states and 204 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:21,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:50:21,585 INFO L93 Difference]: Finished difference Result 343 states and 559 transitions. [2024-10-24 05:50:21,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 05:50:21,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 247 [2024-10-24 05:50:21,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:50:21,589 INFO L225 Difference]: With dead ends: 343 [2024-10-24 05:50:21,590 INFO L226 Difference]: Without dead ends: 219 [2024-10-24 05:50:21,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:50:21,592 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 318 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 05:50:21,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 583 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 05:50:21,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-24 05:50:21,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 145. [2024-10-24 05:50:21,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 103 states have (on average 1.5145631067961165) internal successors, (156), 103 states have internal predecessors, (156), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-24 05:50:21,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 234 transitions. [2024-10-24 05:50:21,619 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 234 transitions. Word has length 247 [2024-10-24 05:50:21,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:50:21,620 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 234 transitions. [2024-10-24 05:50:21,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:21,620 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 234 transitions. [2024-10-24 05:50:21,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-24 05:50:21,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:50:21,627 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:50:21,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 05:50:21,627 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:50:21,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:50:21,629 INFO L85 PathProgramCache]: Analyzing trace with hash 946612612, now seen corresponding path program 1 times [2024-10-24 05:50:21,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:50:21,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086327235] [2024-10-24 05:50:21,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:50:21,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:50:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:50:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:50:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:50:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:50:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:50:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:50:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:50:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:50:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:50:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:50:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:50:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:50:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:50:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:50:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:50:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:50:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:50:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:50:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:50:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:50:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:50:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:50:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:50:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:50:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:50:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:50:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:50:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:50:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:50:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:50:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 05:50:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 05:50:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 05:50:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 05:50:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 05:50:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-24 05:50:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-24 05:50:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 05:50:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-24 05:50:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:21,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-24 05:50:21,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:50:21,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086327235] [2024-10-24 05:50:21,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086327235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:50:21,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:50:21,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:50:21,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598319956] [2024-10-24 05:50:21,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:50:21,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 05:50:21,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:50:21,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 05:50:21,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:50:21,947 INFO L87 Difference]: Start difference. First operand 145 states and 234 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:21,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:50:21,986 INFO L93 Difference]: Finished difference Result 290 states and 469 transitions. [2024-10-24 05:50:21,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 05:50:21,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 248 [2024-10-24 05:50:21,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:50:21,990 INFO L225 Difference]: With dead ends: 290 [2024-10-24 05:50:21,990 INFO L226 Difference]: Without dead ends: 146 [2024-10-24 05:50:21,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 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-10-24 05:50:21,996 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:50:21,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 395 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:50:21,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-24 05:50:22,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-10-24 05:50:22,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 104 states have (on average 1.5096153846153846) internal successors, (157), 104 states have internal predecessors, (157), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-24 05:50:22,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 235 transitions. [2024-10-24 05:50:22,012 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 235 transitions. Word has length 248 [2024-10-24 05:50:22,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:50:22,013 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 235 transitions. [2024-10-24 05:50:22,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:22,013 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 235 transitions. [2024-10-24 05:50:22,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-24 05:50:22,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:50:22,017 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:50:22,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 05:50:22,017 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:50:22,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:50:22,018 INFO L85 PathProgramCache]: Analyzing trace with hash -641735290, now seen corresponding path program 1 times [2024-10-24 05:50:22,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:50:22,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378824309] [2024-10-24 05:50:22,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:50:22,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:50:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:50:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:50:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:50:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:50:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:50:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:50:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:50:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:50:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:50:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:50:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:50:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:50:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:50:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:50:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:50:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:50:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:50:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:50:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:50:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:50:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:50:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:50:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:50:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:50:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:50:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:50:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:50:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:50:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:50:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:50:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 05:50:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 05:50:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 05:50:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 05:50:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 05:50:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-24 05:50:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-24 05:50:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 05:50:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-24 05:50:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-24 05:50:22,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:50:22,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378824309] [2024-10-24 05:50:22,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378824309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:50:22,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:50:22,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:50:22,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247957572] [2024-10-24 05:50:22,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:50:22,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 05:50:22,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:50:22,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 05:50:22,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:50:22,243 INFO L87 Difference]: Start difference. First operand 146 states and 235 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:22,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:50:22,293 INFO L93 Difference]: Finished difference Result 400 states and 643 transitions. [2024-10-24 05:50:22,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 05:50:22,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 248 [2024-10-24 05:50:22,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:50:22,297 INFO L225 Difference]: With dead ends: 400 [2024-10-24 05:50:22,297 INFO L226 Difference]: Without dead ends: 255 [2024-10-24 05:50:22,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 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-10-24 05:50:22,299 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 136 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:50:22,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 483 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:50:22,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-24 05:50:22,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2024-10-24 05:50:22,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 186 states have (on average 1.5161290322580645) internal successors, (282), 187 states have internal predecessors, (282), 61 states have call successors, (61), 4 states have call predecessors, (61), 4 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-24 05:50:22,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 404 transitions. [2024-10-24 05:50:22,343 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 404 transitions. Word has length 248 [2024-10-24 05:50:22,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:50:22,344 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 404 transitions. [2024-10-24 05:50:22,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:22,345 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 404 transitions. [2024-10-24 05:50:22,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-24 05:50:22,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:50:22,350 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:50:22,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 05:50:22,351 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:50:22,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:50:22,351 INFO L85 PathProgramCache]: Analyzing trace with hash -579695676, now seen corresponding path program 1 times [2024-10-24 05:50:22,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:50:22,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983567655] [2024-10-24 05:50:22,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:50:22,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:50:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:50:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:50:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:50:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:50:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:50:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:50:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:50:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:50:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:50:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:50:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:50:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:50:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:50:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:50:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:50:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:50:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:50:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:50:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:50:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:50:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:50:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:50:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:50:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:50:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:50:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:50:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:50:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:50:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:50:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:50:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 05:50:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 05:50:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 05:50:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 05:50:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 05:50:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-24 05:50:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-24 05:50:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 05:50:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-24 05:50:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:22,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-24 05:50:22,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:50:22,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983567655] [2024-10-24 05:50:22,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983567655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:50:22,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:50:22,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 05:50:22,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811434545] [2024-10-24 05:50:22,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:50:22,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 05:50:22,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:50:22,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 05:50:22,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 05:50:22,803 INFO L87 Difference]: Start difference. First operand 252 states and 404 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:23,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:50:23,084 INFO L93 Difference]: Finished difference Result 657 states and 1057 transitions. [2024-10-24 05:50:23,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 05:50:23,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 248 [2024-10-24 05:50:23,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:50:23,092 INFO L225 Difference]: With dead ends: 657 [2024-10-24 05:50:23,093 INFO L226 Difference]: Without dead ends: 406 [2024-10-24 05:50:23,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-10-24 05:50:23,096 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 285 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 05:50:23,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 671 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 05:50:23,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-10-24 05:50:23,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 254. [2024-10-24 05:50:23,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 188 states have (on average 1.5212765957446808) internal successors, (286), 189 states have internal predecessors, (286), 61 states have call successors, (61), 4 states have call predecessors, (61), 4 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-24 05:50:23,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 408 transitions. [2024-10-24 05:50:23,135 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 408 transitions. Word has length 248 [2024-10-24 05:50:23,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:50:23,136 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 408 transitions. [2024-10-24 05:50:23,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:23,136 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 408 transitions. [2024-10-24 05:50:23,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-24 05:50:23,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:50:23,141 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:50:23,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 05:50:23,142 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:50:23,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:50:23,142 INFO L85 PathProgramCache]: Analyzing trace with hash -360840958, now seen corresponding path program 1 times [2024-10-24 05:50:23,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:50:23,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136620224] [2024-10-24 05:50:23,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:50:23,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:50:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:50:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:50:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:50:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:50:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:50:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:50:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:50:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:50:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:50:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:50:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:50:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:50:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:50:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:50:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:50:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:50:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:50:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:50:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:50:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:50:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:50:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:50:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:50:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:50:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:50:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:50:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:50:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:50:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:50:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:50:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 05:50:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 05:50:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 05:50:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 05:50:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 05:50:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-24 05:50:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-24 05:50:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 05:50:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-24 05:50:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:23,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-24 05:50:23,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:50:23,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136620224] [2024-10-24 05:50:23,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136620224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:50:23,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:50:23,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 05:50:23,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906305032] [2024-10-24 05:50:23,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:50:23,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 05:50:23,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:50:23,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 05:50:23,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 05:50:23,750 INFO L87 Difference]: Start difference. First operand 254 states and 408 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:24,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:50:24,464 INFO L93 Difference]: Finished difference Result 944 states and 1504 transitions. [2024-10-24 05:50:24,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 05:50:24,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 248 [2024-10-24 05:50:24,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:50:24,475 INFO L225 Difference]: With dead ends: 944 [2024-10-24 05:50:24,476 INFO L226 Difference]: Without dead ends: 691 [2024-10-24 05:50:24,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-10-24 05:50:24,480 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 413 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 05:50:24,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1118 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 05:50:24,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-10-24 05:50:24,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 254. [2024-10-24 05:50:24,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 188 states have (on average 1.5106382978723405) internal successors, (284), 189 states have internal predecessors, (284), 61 states have call successors, (61), 4 states have call predecessors, (61), 4 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-24 05:50:24,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 406 transitions. [2024-10-24 05:50:24,530 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 406 transitions. Word has length 248 [2024-10-24 05:50:24,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:50:24,532 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 406 transitions. [2024-10-24 05:50:24,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:24,534 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 406 transitions. [2024-10-24 05:50:24,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-24 05:50:24,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:50:24,540 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:50:24,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 05:50:24,540 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:50:24,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:50:24,541 INFO L85 PathProgramCache]: Analyzing trace with hash -2008600770, now seen corresponding path program 1 times [2024-10-24 05:50:24,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:50:24,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853048417] [2024-10-24 05:50:24,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:50:24,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:50:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:50:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:50:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:50:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:50:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:50:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:50:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:50:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:50:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:50:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:50:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:50:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:50:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:50:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:50:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:50:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:50:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:50:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:50:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:50:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:50:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:50:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:50:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:50:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:50:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:50:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:50:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:50:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:50:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:24,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:50:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:25,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:50:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:25,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 05:50:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:25,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 05:50:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:25,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 05:50:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:25,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 05:50:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:25,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 05:50:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:25,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-24 05:50:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:25,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-24 05:50:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:25,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 05:50:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:25,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-24 05:50:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:25,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-24 05:50:25,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:50:25,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853048417] [2024-10-24 05:50:25,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853048417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:50:25,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:50:25,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 05:50:25,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345468182] [2024-10-24 05:50:25,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:50:25,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 05:50:25,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:50:25,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 05:50:25,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 05:50:25,060 INFO L87 Difference]: Start difference. First operand 254 states and 406 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:26,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:50:26,170 INFO L93 Difference]: Finished difference Result 948 states and 1505 transitions. [2024-10-24 05:50:26,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 05:50:26,171 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 248 [2024-10-24 05:50:26,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:50:26,176 INFO L225 Difference]: With dead ends: 948 [2024-10-24 05:50:26,176 INFO L226 Difference]: Without dead ends: 695 [2024-10-24 05:50:26,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-10-24 05:50:26,178 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 677 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 05:50:26,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 1047 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 05:50:26,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2024-10-24 05:50:26,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 474. [2024-10-24 05:50:26,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 343 states have (on average 1.4839650145772594) internal successors, (509), 345 states have internal predecessors, (509), 122 states have call successors, (122), 8 states have call predecessors, (122), 8 states have return successors, (122), 120 states have call predecessors, (122), 122 states have call successors, (122) [2024-10-24 05:50:26,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 753 transitions. [2024-10-24 05:50:26,256 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 753 transitions. Word has length 248 [2024-10-24 05:50:26,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:50:26,258 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 753 transitions. [2024-10-24 05:50:26,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:26,258 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 753 transitions. [2024-10-24 05:50:26,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-24 05:50:26,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:50:26,262 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:50:26,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 05:50:26,262 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:50:26,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:50:26,263 INFO L85 PathProgramCache]: Analyzing trace with hash 597422784, now seen corresponding path program 1 times [2024-10-24 05:50:26,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:50:26,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669483570] [2024-10-24 05:50:26,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:50:26,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:50:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:50:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:50:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:50:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:50:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:50:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:50:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:50:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:50:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:50:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:50:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:50:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:50:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:50:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:50:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:50:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:50:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:50:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:50:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:50:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:50:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:50:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:50:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:50:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:50:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:50:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:50:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:50:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:50:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:50:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:50:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 05:50:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 05:50:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 05:50:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 05:50:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 05:50:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-24 05:50:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-24 05:50:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 05:50:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-24 05:50:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:26,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-24 05:50:26,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:50:26,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669483570] [2024-10-24 05:50:26,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669483570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:50:26,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:50:26,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 05:50:26,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175976432] [2024-10-24 05:50:26,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:50:26,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 05:50:26,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:50:26,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 05:50:26,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:50:26,934 INFO L87 Difference]: Start difference. First operand 474 states and 753 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:27,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:50:27,017 INFO L93 Difference]: Finished difference Result 981 states and 1554 transitions. [2024-10-24 05:50:27,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 05:50:27,018 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 248 [2024-10-24 05:50:27,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:50:27,022 INFO L225 Difference]: With dead ends: 981 [2024-10-24 05:50:27,022 INFO L226 Difference]: Without dead ends: 508 [2024-10-24 05:50:27,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:50:27,025 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 26 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:50:27,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 575 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:50:27,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-10-24 05:50:27,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 490. [2024-10-24 05:50:27,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 359 states have (on average 1.4846796657381616) internal successors, (533), 361 states have internal predecessors, (533), 122 states have call successors, (122), 8 states have call predecessors, (122), 8 states have return successors, (122), 120 states have call predecessors, (122), 122 states have call successors, (122) [2024-10-24 05:50:27,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 777 transitions. [2024-10-24 05:50:27,105 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 777 transitions. Word has length 248 [2024-10-24 05:50:27,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:50:27,106 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 777 transitions. [2024-10-24 05:50:27,106 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:27,106 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 777 transitions. [2024-10-24 05:50:27,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-24 05:50:27,110 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:50:27,111 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:50:27,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 05:50:27,111 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:50:27,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:50:27,111 INFO L85 PathProgramCache]: Analyzing trace with hash 597482366, now seen corresponding path program 1 times [2024-10-24 05:50:27,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:50:27,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395162465] [2024-10-24 05:50:27,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:50:27,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:50:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:50:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:50:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:50:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:50:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:50:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:50:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:50:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:50:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:50:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:50:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:50:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:50:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:50:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:50:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:50:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:50:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:50:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:50:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:50:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:50:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:50:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:50:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:50:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:50:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:50:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:50:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:50:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:50:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:50:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:50:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 05:50:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 05:50:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 05:50:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 05:50:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 05:50:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-24 05:50:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-24 05:50:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 05:50:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-24 05:50:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:27,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-24 05:50:27,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:50:27,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395162465] [2024-10-24 05:50:27,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395162465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:50:27,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:50:27,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 05:50:27,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632181882] [2024-10-24 05:50:27,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:50:27,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 05:50:27,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:50:27,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 05:50:27,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:50:27,715 INFO L87 Difference]: Start difference. First operand 490 states and 777 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:28,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:50:28,013 INFO L93 Difference]: Finished difference Result 1305 states and 2076 transitions. [2024-10-24 05:50:28,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 05:50:28,014 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 248 [2024-10-24 05:50:28,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:50:28,019 INFO L225 Difference]: With dead ends: 1305 [2024-10-24 05:50:28,020 INFO L226 Difference]: Without dead ends: 816 [2024-10-24 05:50:28,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 05:50:28,022 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 186 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 05:50:28,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 711 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 05:50:28,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2024-10-24 05:50:28,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 738. [2024-10-24 05:50:28,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 566 states have (on average 1.5070671378091873) internal successors, (853), 568 states have internal predecessors, (853), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161) [2024-10-24 05:50:28,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1175 transitions. [2024-10-24 05:50:28,108 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1175 transitions. Word has length 248 [2024-10-24 05:50:28,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:50:28,109 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 1175 transitions. [2024-10-24 05:50:28,109 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:28,109 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1175 transitions. [2024-10-24 05:50:28,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-10-24 05:50:28,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:50:28,113 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:50:28,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 05:50:28,113 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:50:28,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:50:28,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1661596282, now seen corresponding path program 1 times [2024-10-24 05:50:28,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:50:28,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382691833] [2024-10-24 05:50:28,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:50:28,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:50:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:50:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:50:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:50:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:50:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:50:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:50:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:50:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:50:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:50:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:50:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:50:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:50:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:50:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:50:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:50:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:50:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:50:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:50:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:50:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:50:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:50:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:50:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:50:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:50:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:50:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:50:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:50:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:50:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:50:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:50:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 05:50:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 05:50:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 05:50:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 05:50:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 05:50:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-24 05:50:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-24 05:50:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 05:50:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-24 05:50:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:29,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-24 05:50:29,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:50:29,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382691833] [2024-10-24 05:50:29,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382691833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:50:29,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:50:29,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 05:50:29,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808539766] [2024-10-24 05:50:29,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:50:29,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 05:50:29,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:50:29,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 05:50:29,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 05:50:29,590 INFO L87 Difference]: Start difference. First operand 738 states and 1175 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2024-10-24 05:50:31,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:50:31,186 INFO L93 Difference]: Finished difference Result 2488 states and 3964 transitions. [2024-10-24 05:50:31,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 05:50:31,187 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 249 [2024-10-24 05:50:31,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:50:31,201 INFO L225 Difference]: With dead ends: 2488 [2024-10-24 05:50:31,201 INFO L226 Difference]: Without dead ends: 1957 [2024-10-24 05:50:31,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2024-10-24 05:50:31,207 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 1107 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 593 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:50:31,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 742 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [593 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 05:50:31,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2024-10-24 05:50:31,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 784. [2024-10-24 05:50:31,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 612 states have (on average 1.4983660130718954) internal successors, (917), 614 states have internal predecessors, (917), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161) [2024-10-24 05:50:31,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1239 transitions. [2024-10-24 05:50:31,391 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1239 transitions. Word has length 249 [2024-10-24 05:50:31,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:50:31,391 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1239 transitions. [2024-10-24 05:50:31,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2024-10-24 05:50:31,392 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1239 transitions. [2024-10-24 05:50:31,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-10-24 05:50:31,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:50:31,396 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:50:31,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 05:50:31,397 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:50:31,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:50:31,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1527582776, now seen corresponding path program 1 times [2024-10-24 05:50:31,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:50:31,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144079396] [2024-10-24 05:50:31,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:50:31,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:50:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:50:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:50:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:50:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:50:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:50:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:50:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:50:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:50:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:50:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:50:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:50:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:50:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:50:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:50:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:50:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:50:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:50:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:50:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:50:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:50:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:50:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:50:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:50:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:50:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:50:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:50:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:50:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:50:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:50:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:50:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 05:50:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 05:50:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 05:50:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 05:50:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 05:50:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-24 05:50:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-24 05:50:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 05:50:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-24 05:50:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:31,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-24 05:50:31,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:50:31,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144079396] [2024-10-24 05:50:31,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144079396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:50:31,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:50:31,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 05:50:31,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683214547] [2024-10-24 05:50:31,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:50:31,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 05:50:31,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:50:31,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 05:50:31,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:50:31,643 INFO L87 Difference]: Start difference. First operand 784 states and 1239 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:31,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:50:31,945 INFO L93 Difference]: Finished difference Result 1509 states and 2386 transitions. [2024-10-24 05:50:31,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 05:50:31,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 249 [2024-10-24 05:50:31,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:50:31,952 INFO L225 Difference]: With dead ends: 1509 [2024-10-24 05:50:31,952 INFO L226 Difference]: Without dead ends: 926 [2024-10-24 05:50:31,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:50:31,954 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 138 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:50:31,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 727 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:50:31,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-10-24 05:50:32,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 770. [2024-10-24 05:50:32,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 598 states have (on average 1.4899665551839465) internal successors, (891), 600 states have internal predecessors, (891), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161) [2024-10-24 05:50:32,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1213 transitions. [2024-10-24 05:50:32,111 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1213 transitions. Word has length 249 [2024-10-24 05:50:32,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:50:32,112 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 1213 transitions. [2024-10-24 05:50:32,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:32,112 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1213 transitions. [2024-10-24 05:50:32,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-10-24 05:50:32,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:50:32,116 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:50:32,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 05:50:32,116 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:50:32,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:50:32,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1947649409, now seen corresponding path program 1 times [2024-10-24 05:50:32,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:50:32,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795039685] [2024-10-24 05:50:32,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:50:32,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:50:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:50:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:50:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:50:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:50:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:50:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:50:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:50:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:50:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:50:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:50:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:50:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:50:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:50:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:50:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:50:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:50:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:50:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:50:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:50:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:50:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:50:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:50:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:50:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:50:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:50:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:50:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:50:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:50:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:50:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:50:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 05:50:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 05:50:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 05:50:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 05:50:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 05:50:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-24 05:50:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-24 05:50:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 05:50:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-24 05:50:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:32,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-24 05:50:32,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:50:32,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795039685] [2024-10-24 05:50:32,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795039685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:50:32,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:50:32,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 05:50:32,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537970869] [2024-10-24 05:50:32,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:50:32,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 05:50:32,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:50:32,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 05:50:32,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 05:50:32,487 INFO L87 Difference]: Start difference. First operand 770 states and 1213 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:33,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:50:33,072 INFO L93 Difference]: Finished difference Result 1797 states and 2837 transitions. [2024-10-24 05:50:33,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 05:50:33,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 250 [2024-10-24 05:50:33,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:50:33,081 INFO L225 Difference]: With dead ends: 1797 [2024-10-24 05:50:33,081 INFO L226 Difference]: Without dead ends: 1474 [2024-10-24 05:50:33,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-24 05:50:33,083 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 303 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 05:50:33,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 700 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 05:50:33,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2024-10-24 05:50:33,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 790. [2024-10-24 05:50:33,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 618 states have (on average 1.493527508090615) internal successors, (923), 620 states have internal predecessors, (923), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161) [2024-10-24 05:50:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1245 transitions. [2024-10-24 05:50:33,221 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1245 transitions. Word has length 250 [2024-10-24 05:50:33,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:50:33,222 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1245 transitions. [2024-10-24 05:50:33,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:33,222 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1245 transitions. [2024-10-24 05:50:33,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-10-24 05:50:33,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:50:33,225 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:50:33,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 05:50:33,226 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:50:33,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:50:33,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1130000959, now seen corresponding path program 1 times [2024-10-24 05:50:33,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:50:33,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656199008] [2024-10-24 05:50:33,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:50:33,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:50:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:50:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:50:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:50:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:50:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:50:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:50:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:50:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:50:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:50:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:50:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:50:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:50:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:50:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:50:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:50:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:50:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:50:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:50:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:50:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:50:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:50:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:50:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:50:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:50:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:50:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:50:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:50:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:50:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:50:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:50:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 05:50:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 05:50:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 05:50:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 05:50:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 05:50:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-24 05:50:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-24 05:50:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 05:50:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-24 05:50:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:33,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-24 05:50:33,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:50:33,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656199008] [2024-10-24 05:50:33,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656199008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:50:33,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:50:33,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 05:50:33,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567195541] [2024-10-24 05:50:33,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:50:33,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 05:50:33,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:50:33,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 05:50:33,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:50:33,424 INFO L87 Difference]: Start difference. First operand 790 states and 1245 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:33,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:50:33,714 INFO L93 Difference]: Finished difference Result 1305 states and 2061 transitions. [2024-10-24 05:50:33,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 05:50:33,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 250 [2024-10-24 05:50:33,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:50:33,721 INFO L225 Difference]: With dead ends: 1305 [2024-10-24 05:50:33,721 INFO L226 Difference]: Without dead ends: 946 [2024-10-24 05:50:33,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:50:33,723 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 138 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:50:33,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 530 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:50:33,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2024-10-24 05:50:33,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 790. [2024-10-24 05:50:33,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 618 states have (on average 1.4805825242718447) internal successors, (915), 620 states have internal predecessors, (915), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161) [2024-10-24 05:50:33,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1237 transitions. [2024-10-24 05:50:33,846 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1237 transitions. Word has length 250 [2024-10-24 05:50:33,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:50:33,846 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1237 transitions. [2024-10-24 05:50:33,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:33,847 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1237 transitions. [2024-10-24 05:50:33,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-10-24 05:50:33,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:50:33,850 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:50:33,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 05:50:33,850 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:50:33,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:50:33,851 INFO L85 PathProgramCache]: Analyzing trace with hash 995987453, now seen corresponding path program 1 times [2024-10-24 05:50:33,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:50:33,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120727079] [2024-10-24 05:50:33,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:50:33,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:50:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:50:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:50:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:50:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:50:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:50:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:50:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:50:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:50:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:50:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:50:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:50:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:50:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:50:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:50:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:50:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:50:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:50:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:50:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:50:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:50:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:50:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:50:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:50:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:50:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:50:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:50:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:50:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:50:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:50:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:50:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 05:50:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 05:50:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 05:50:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 05:50:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 05:50:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-24 05:50:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-24 05:50:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 05:50:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-24 05:50:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:34,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-24 05:50:34,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:50:34,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120727079] [2024-10-24 05:50:34,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120727079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:50:34,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:50:34,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 05:50:34,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067292708] [2024-10-24 05:50:34,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:50:34,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 05:50:34,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:50:34,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 05:50:34,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:50:34,206 INFO L87 Difference]: Start difference. First operand 790 states and 1237 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:34,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:50:34,725 INFO L93 Difference]: Finished difference Result 1265 states and 1991 transitions. [2024-10-24 05:50:34,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 05:50:34,726 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 250 [2024-10-24 05:50:34,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:50:34,732 INFO L225 Difference]: With dead ends: 1265 [2024-10-24 05:50:34,732 INFO L226 Difference]: Without dead ends: 894 [2024-10-24 05:50:34,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 05:50:34,735 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 421 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 05:50:34,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 796 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 05:50:34,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-10-24 05:50:34,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 744. [2024-10-24 05:50:34,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 572 states have (on average 1.4737762237762237) internal successors, (843), 574 states have internal predecessors, (843), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161) [2024-10-24 05:50:34,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1165 transitions. [2024-10-24 05:50:34,843 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1165 transitions. Word has length 250 [2024-10-24 05:50:34,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:50:34,844 INFO L471 AbstractCegarLoop]: Abstraction has 744 states and 1165 transitions. [2024-10-24 05:50:34,844 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:34,844 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1165 transitions. [2024-10-24 05:50:34,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-10-24 05:50:34,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:50:34,848 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:50:34,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 05:50:34,849 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:50:34,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:50:34,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1505980648, now seen corresponding path program 1 times [2024-10-24 05:50:34,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:50:34,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458650396] [2024-10-24 05:50:34,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:50:34,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:50:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:50:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:50:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:50:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:50:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:50:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:50:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:50:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:50:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:50:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:50:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:50:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:50:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:50:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:50:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:50:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:50:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:50:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:50:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:50:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:50:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:50:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:50:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:50:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:50:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:50:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:50:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:50:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:50:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:50:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:50:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 05:50:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 05:50:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 05:50:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 05:50:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 05:50:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-24 05:50:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-24 05:50:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 05:50:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-24 05:50:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-24 05:50:35,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:50:35,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458650396] [2024-10-24 05:50:35,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458650396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:50:35,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:50:35,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 05:50:35,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328708197] [2024-10-24 05:50:35,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:50:35,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 05:50:35,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:50:35,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 05:50:35,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:50:35,130 INFO L87 Difference]: Start difference. First operand 744 states and 1165 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:35,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:50:35,403 INFO L93 Difference]: Finished difference Result 1723 states and 2722 transitions. [2024-10-24 05:50:35,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 05:50:35,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 250 [2024-10-24 05:50:35,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:50:35,410 INFO L225 Difference]: With dead ends: 1723 [2024-10-24 05:50:35,410 INFO L226 Difference]: Without dead ends: 1136 [2024-10-24 05:50:35,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:50:35,414 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 117 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:50:35,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 644 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:50:35,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2024-10-24 05:50:35,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 736. [2024-10-24 05:50:35,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 564 states have (on average 1.4627659574468086) internal successors, (825), 566 states have internal predecessors, (825), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161) [2024-10-24 05:50:35,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1147 transitions. [2024-10-24 05:50:35,527 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1147 transitions. Word has length 250 [2024-10-24 05:50:35,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:50:35,528 INFO L471 AbstractCegarLoop]: Abstraction has 736 states and 1147 transitions. [2024-10-24 05:50:35,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:35,528 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1147 transitions. [2024-10-24 05:50:35,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-10-24 05:50:35,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:50:35,532 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:50:35,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 05:50:35,532 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:50:35,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:50:35,540 INFO L85 PathProgramCache]: Analyzing trace with hash -78823936, now seen corresponding path program 1 times [2024-10-24 05:50:35,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:50:35,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776122743] [2024-10-24 05:50:35,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:50:35,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:50:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:50:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:50:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:50:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:50:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:50:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:50:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:50:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:50:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:50:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:50:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:50:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:50:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:50:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:50:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:50:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:50:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:50:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:50:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:50:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:50:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:50:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:50:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:50:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:50:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:50:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:50:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:50:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:50:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:50:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:50:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 05:50:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 05:50:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 05:50:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 05:50:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 05:50:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-24 05:50:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-24 05:50:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 05:50:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-24 05:50:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:35,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-24 05:50:35,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:50:35,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776122743] [2024-10-24 05:50:35,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776122743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:50:35,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:50:35,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 05:50:35,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447989028] [2024-10-24 05:50:35,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:50:35,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 05:50:35,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:50:35,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 05:50:35,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:50:35,836 INFO L87 Difference]: Start difference. First operand 736 states and 1147 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:36,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:50:36,320 INFO L93 Difference]: Finished difference Result 1518 states and 2365 transitions. [2024-10-24 05:50:36,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 05:50:36,321 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 250 [2024-10-24 05:50:36,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:50:36,328 INFO L225 Difference]: With dead ends: 1518 [2024-10-24 05:50:36,328 INFO L226 Difference]: Without dead ends: 979 [2024-10-24 05:50:36,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 05:50:36,330 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 277 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 05:50:36,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 617 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 05:50:36,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2024-10-24 05:50:36,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 973. [2024-10-24 05:50:36,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 749 states have (on average 1.4632843791722296) internal successors, (1096), 753 states have internal predecessors, (1096), 209 states have call successors, (209), 14 states have call predecessors, (209), 14 states have return successors, (209), 205 states have call predecessors, (209), 209 states have call successors, (209) [2024-10-24 05:50:36,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1514 transitions. [2024-10-24 05:50:36,492 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1514 transitions. Word has length 250 [2024-10-24 05:50:36,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:50:36,492 INFO L471 AbstractCegarLoop]: Abstraction has 973 states and 1514 transitions. [2024-10-24 05:50:36,493 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:36,493 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1514 transitions. [2024-10-24 05:50:36,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-10-24 05:50:36,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:50:36,496 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:50:36,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 05:50:36,496 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:50:36,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:50:36,497 INFO L85 PathProgramCache]: Analyzing trace with hash -896472386, now seen corresponding path program 1 times [2024-10-24 05:50:36,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:50:36,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086141930] [2024-10-24 05:50:36,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:50:36,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:50:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:50:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:50:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:50:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:50:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:50:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:50:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:50:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:50:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:50:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:50:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:50:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:50:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:50:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:50:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:50:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:50:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:50:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:50:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:50:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:50:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:50:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:50:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:50:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:50:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:50:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:50:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:50:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:50:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:50:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:50:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 05:50:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 05:50:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 05:50:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 05:50:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 05:50:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-24 05:50:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-24 05:50:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 05:50:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-24 05:50:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 9 proven. 105 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2024-10-24 05:50:37,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:50:37,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086141930] [2024-10-24 05:50:37,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086141930] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 05:50:37,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524598924] [2024-10-24 05:50:37,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:50:37,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:50:37,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:50:37,204 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 05:50:37,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 05:50:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:37,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 05:50:37,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:50:38,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1508 proven. 51 refuted. 0 times theorem prover too weak. 1405 trivial. 0 not checked. [2024-10-24 05:50:38,035 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:50:38,140 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-10-24 05:50:38,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 05:50:38,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-24 05:50:38,346 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: Modulus must be strictly greater one but is 0 at de.uni_freiburg.informatik.ultimate.util.ArithmeticUtils.multiplicativeInverse(ArithmeticUtils.java:89) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDml.findAllDmlPossibilities(DualJunctionDml.java:162) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDml.tryToEliminate(DualJunctionDml.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-24 05:50:38,353 INFO L158 Benchmark]: Toolchain (without parser) took 20676.39ms. Allocated memory was 184.5MB in the beginning and 474.0MB in the end (delta: 289.4MB). Free memory was 114.0MB in the beginning and 298.0MB in the end (delta: -184.0MB). Peak memory consumption was 106.9MB. Max. memory is 16.1GB. [2024-10-24 05:50:38,354 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 138.4MB. Free memory is still 99.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:50:38,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.93ms. Allocated memory is still 184.5MB. Free memory was 114.0MB in the beginning and 95.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 05:50:38,354 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.16ms. Allocated memory is still 184.5MB. Free memory was 95.1MB in the beginning and 91.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:50:38,354 INFO L158 Benchmark]: Boogie Preprocessor took 76.35ms. Allocated memory is still 184.5MB. Free memory was 91.0MB in the beginning and 85.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:50:38,355 INFO L158 Benchmark]: RCFGBuilder took 948.10ms. Allocated memory is still 184.5MB. Free memory was 85.8MB in the beginning and 132.8MB in the end (delta: -47.0MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. [2024-10-24 05:50:38,355 INFO L158 Benchmark]: TraceAbstraction took 19140.22ms. Allocated memory was 184.5MB in the beginning and 474.0MB in the end (delta: 289.4MB). Free memory was 131.8MB in the beginning and 298.0MB in the end (delta: -166.2MB). Peak memory consumption was 125.2MB. Max. memory is 16.1GB. [2024-10-24 05:50:38,356 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 138.4MB. Free memory is still 99.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 438.93ms. Allocated memory is still 184.5MB. Free memory was 114.0MB in the beginning and 95.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.16ms. Allocated memory is still 184.5MB. Free memory was 95.1MB in the beginning and 91.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.35ms. Allocated memory is still 184.5MB. Free memory was 91.0MB in the beginning and 85.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 948.10ms. Allocated memory is still 184.5MB. Free memory was 85.8MB in the beginning and 132.8MB in the end (delta: -47.0MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. * TraceAbstraction took 19140.22ms. Allocated memory was 184.5MB in the beginning and 474.0MB in the end (delta: 289.4MB). Free memory was 131.8MB in the beginning and 298.0MB in the end (delta: -166.2MB). Peak memory consumption was 125.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalArgumentException: Modulus must be strictly greater one but is 0 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: Modulus must be strictly greater one but is 0: de.uni_freiburg.informatik.ultimate.util.ArithmeticUtils.multiplicativeInverse(ArithmeticUtils.java:89) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-24 05:50:38,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 c075bf31c8a61d5818086da4c01a54dc9522c53729e14bb5c6eb6f9ba650fc63 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:50:40,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:50:40,952 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 05:50:40,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:50:40,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:50:40,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:50:40,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:50:40,999 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:50:41,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:50:41,001 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:50:41,001 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:50:41,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:50:41,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:50:41,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:50:41,005 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:50:41,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:50:41,006 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:50:41,006 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:50:41,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:50:41,007 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:50:41,007 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:50:41,008 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:50:41,009 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:50:41,009 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 05:50:41,009 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 05:50:41,010 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:50:41,010 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 05:50:41,010 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:50:41,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:50:41,011 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:50:41,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:50:41,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:50:41,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:50:41,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:50:41,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:50:41,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:50:41,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:50:41,014 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:50:41,014 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 05:50:41,014 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 05:50:41,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:50:41,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:50:41,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:50:41,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:50:41,016 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 05:50:41,016 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 -> c075bf31c8a61d5818086da4c01a54dc9522c53729e14bb5c6eb6f9ba650fc63 [2024-10-24 05:50:41,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:50:41,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:50:41,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:50:41,423 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:50:41,424 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:50:41,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2024-10-24 05:50:43,027 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:50:43,245 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:50:43,246 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2024-10-24 05:50:43,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb128a802/e850de518c9a4764becaf970b02751f6/FLAGd96ce174c [2024-10-24 05:50:43,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb128a802/e850de518c9a4764becaf970b02751f6 [2024-10-24 05:50:43,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:50:43,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:50:43,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:50:43,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:50:43,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:50:43,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:50:43" (1/1) ... [2024-10-24 05:50:43,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b4752ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:43, skipping insertion in model container [2024-10-24 05:50:43,292 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:50:43" (1/1) ... [2024-10-24 05:50:43,333 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:50:43,539 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i[916,929] [2024-10-24 05:50:43,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:50:43,718 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:50:43,732 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i[916,929] [2024-10-24 05:50:43,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:50:43,826 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:50:43,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:43 WrapperNode [2024-10-24 05:50:43,827 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:50:43,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:50:43,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:50:43,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:50:43,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:43" (1/1) ... [2024-10-24 05:50:43,857 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:43" (1/1) ... [2024-10-24 05:50:43,906 INFO L138 Inliner]: procedures = 27, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 253 [2024-10-24 05:50:43,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:50:43,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:50:43,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:50:43,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:50:43,923 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:43" (1/1) ... [2024-10-24 05:50:43,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:43" (1/1) ... [2024-10-24 05:50:43,933 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:43" (1/1) ... [2024-10-24 05:50:43,963 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 05:50:43,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:43" (1/1) ... [2024-10-24 05:50:43,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:43" (1/1) ... [2024-10-24 05:50:43,984 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:43" (1/1) ... [2024-10-24 05:50:43,995 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:43" (1/1) ... [2024-10-24 05:50:43,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:43" (1/1) ... [2024-10-24 05:50:44,000 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:43" (1/1) ... [2024-10-24 05:50:44,008 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:50:44,010 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:50:44,010 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:50:44,010 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:50:44,011 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:43" (1/1) ... [2024-10-24 05:50:44,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:50:44,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:50:44,059 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 05:50:44,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:50:44,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:50:44,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 05:50:44,109 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:50:44,109 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:50:44,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:50:44,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:50:44,248 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:50:44,250 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:50:45,150 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 05:50:45,150 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:50:45,229 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:50:45,230 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:50:45,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:50:45 BoogieIcfgContainer [2024-10-24 05:50:45,231 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:50:45,233 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:50:45,233 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:50:45,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:50:45,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:50:43" (1/3) ... [2024-10-24 05:50:45,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65ea5173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:50:45, skipping insertion in model container [2024-10-24 05:50:45,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:50:43" (2/3) ... [2024-10-24 05:50:45,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65ea5173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:50:45, skipping insertion in model container [2024-10-24 05:50:45,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:50:45" (3/3) ... [2024-10-24 05:50:45,244 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2024-10-24 05:50:45,264 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:50:45,265 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:50:45,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:50:45,349 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;@4f6fbcf9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:50:45,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:50:45,354 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 67 states have internal predecessors, (102), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-24 05:50:45,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-24 05:50:45,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:50:45,372 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:50:45,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:50:45,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:50:45,377 INFO L85 PathProgramCache]: Analyzing trace with hash -34283185, now seen corresponding path program 1 times [2024-10-24 05:50:45,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:50:45,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [124282905] [2024-10-24 05:50:45,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:50:45,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:50:45,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:50:45,396 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:50:45,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 05:50:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:45,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 05:50:45,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:50:45,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1324 proven. 0 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2024-10-24 05:50:45,957 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:50:45,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:50:45,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [124282905] [2024-10-24 05:50:45,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [124282905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:50:45,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:50:45,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:50:45,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743090565] [2024-10-24 05:50:45,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:50:45,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:50:45,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:50:46,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:50:46,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:50:46,004 INFO L87 Difference]: Start difference. First operand has 108 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 67 states have internal predecessors, (102), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-24 05:50:46,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:50:46,091 INFO L93 Difference]: Finished difference Result 213 states and 397 transitions. [2024-10-24 05:50:46,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:50:46,098 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 242 [2024-10-24 05:50:46,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:50:46,110 INFO L225 Difference]: With dead ends: 213 [2024-10-24 05:50:46,110 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 05:50:46,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:50:46,121 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:50:46,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:50:46,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 05:50:46,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-24 05:50:46,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 65 states have internal predecessors, (95), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-24 05:50:46,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 173 transitions. [2024-10-24 05:50:46,181 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 173 transitions. Word has length 242 [2024-10-24 05:50:46,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:50:46,181 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 173 transitions. [2024-10-24 05:50:46,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-24 05:50:46,182 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 173 transitions. [2024-10-24 05:50:46,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-24 05:50:46,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:50:46,191 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:50:46,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 05:50:46,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:50:46,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:50:46,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:50:46,394 INFO L85 PathProgramCache]: Analyzing trace with hash -981239791, now seen corresponding path program 1 times [2024-10-24 05:50:46,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:50:46,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910735163] [2024-10-24 05:50:46,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:50:46,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:50:46,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:50:46,400 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:50:46,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 05:50:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:46,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 05:50:46,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:50:46,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-24 05:50:46,849 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:50:46,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:50:46,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910735163] [2024-10-24 05:50:46,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910735163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:50:46,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:50:46,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:50:46,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618891668] [2024-10-24 05:50:46,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:50:46,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 05:50:46,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:50:46,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 05:50:46,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:50:46,857 INFO L87 Difference]: Start difference. First operand 106 states and 173 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:47,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:50:47,095 INFO L93 Difference]: Finished difference Result 282 states and 461 transitions. [2024-10-24 05:50:47,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 05:50:47,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 242 [2024-10-24 05:50:47,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:50:47,102 INFO L225 Difference]: With dead ends: 282 [2024-10-24 05:50:47,102 INFO L226 Difference]: Without dead ends: 177 [2024-10-24 05:50:47,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 240 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-10-24 05:50:47,105 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 110 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 05:50:47,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 415 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 05:50:47,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-24 05:50:47,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2024-10-24 05:50:47,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 110 states have (on average 1.4727272727272727) internal successors, (162), 111 states have internal predecessors, (162), 61 states have call successors, (61), 2 states have call predecessors, (61), 2 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-24 05:50:47,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 284 transitions. [2024-10-24 05:50:47,136 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 284 transitions. Word has length 242 [2024-10-24 05:50:47,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:50:47,138 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 284 transitions. [2024-10-24 05:50:47,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:47,138 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 284 transitions. [2024-10-24 05:50:47,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-24 05:50:47,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:50:47,142 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:50:47,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 05:50:47,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:50:47,344 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:50:47,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:50:47,345 INFO L85 PathProgramCache]: Analyzing trace with hash -558537965, now seen corresponding path program 1 times [2024-10-24 05:50:47,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:50:47,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521517618] [2024-10-24 05:50:47,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:50:47,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:50:47,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:50:47,349 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:50:47,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 05:50:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:47,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 05:50:47,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:50:49,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-24 05:50:49,165 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:50:49,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:50:49,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521517618] [2024-10-24 05:50:49,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521517618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:50:49,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:50:49,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 05:50:49,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641966148] [2024-10-24 05:50:49,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:50:49,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 05:50:49,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:50:49,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 05:50:49,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:50:49,169 INFO L87 Difference]: Start difference. First operand 174 states and 284 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:49,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:50:49,680 INFO L93 Difference]: Finished difference Result 485 states and 794 transitions. [2024-10-24 05:50:49,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 05:50:49,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 242 [2024-10-24 05:50:49,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:50:49,689 INFO L225 Difference]: With dead ends: 485 [2024-10-24 05:50:49,689 INFO L226 Difference]: Without dead ends: 312 [2024-10-24 05:50:49,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 05:50:49,692 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 129 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 05:50:49,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 587 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 05:50:49,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-10-24 05:50:49,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 280. [2024-10-24 05:50:49,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 176 states have (on average 1.4772727272727273) internal successors, (260), 177 states have internal predecessors, (260), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-24 05:50:49,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 460 transitions. [2024-10-24 05:50:49,740 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 460 transitions. Word has length 242 [2024-10-24 05:50:49,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:50:49,743 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 460 transitions. [2024-10-24 05:50:49,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:49,744 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 460 transitions. [2024-10-24 05:50:49,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-10-24 05:50:49,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:50:49,751 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:50:49,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 05:50:49,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:50:49,952 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:50:49,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:50:49,953 INFO L85 PathProgramCache]: Analyzing trace with hash 186491772, now seen corresponding path program 1 times [2024-10-24 05:50:49,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:50:49,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283229241] [2024-10-24 05:50:49,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:50:49,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:50:49,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:50:49,955 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:50:49,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 05:50:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:50,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 05:50:50,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:50:50,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 464 proven. 105 refuted. 0 times theorem prover too weak. 2395 trivial. 0 not checked. [2024-10-24 05:50:50,707 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:50:51,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 9 proven. 105 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2024-10-24 05:50:51,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:50:51,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283229241] [2024-10-24 05:50:51,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283229241] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 05:50:51,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 05:50:51,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-10-24 05:50:51,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308680129] [2024-10-24 05:50:51,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 05:50:51,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 05:50:51,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:50:51,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 05:50:51,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 05:50:51,072 INFO L87 Difference]: Start difference. First operand 280 states and 460 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (74), 2 states have call predecessors, (74), 4 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) [2024-10-24 05:50:52,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:50:52,167 INFO L93 Difference]: Finished difference Result 477 states and 764 transitions. [2024-10-24 05:50:52,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 05:50:52,171 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (74), 2 states have call predecessors, (74), 4 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) Word has length 243 [2024-10-24 05:50:52,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:50:52,178 INFO L225 Difference]: With dead ends: 477 [2024-10-24 05:50:52,179 INFO L226 Difference]: Without dead ends: 304 [2024-10-24 05:50:52,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 477 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-10-24 05:50:52,181 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 303 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:50:52,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 290 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 05:50:52,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-24 05:50:52,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 292. [2024-10-24 05:50:52,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 185 states have (on average 1.4324324324324325) internal successors, (265), 186 states have internal predecessors, (265), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-24 05:50:52,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 465 transitions. [2024-10-24 05:50:52,237 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 465 transitions. Word has length 243 [2024-10-24 05:50:52,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:50:52,240 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 465 transitions. [2024-10-24 05:50:52,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (74), 2 states have call predecessors, (74), 4 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) [2024-10-24 05:50:52,240 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 465 transitions. [2024-10-24 05:50:52,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-10-24 05:50:52,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:50:52,244 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:50:52,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 05:50:52,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:50:52,445 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:50:52,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:50:52,446 INFO L85 PathProgramCache]: Analyzing trace with hash 675536760, now seen corresponding path program 1 times [2024-10-24 05:50:52,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:50:52,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879719350] [2024-10-24 05:50:52,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:50:52,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:50:52,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:50:52,451 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:50:52,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 05:50:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:52,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 05:50:52,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:50:53,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-24 05:50:53,316 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:50:53,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:50:53,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879719350] [2024-10-24 05:50:53,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1879719350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:50:53,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:50:53,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:50:53,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961851094] [2024-10-24 05:50:53,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:50:53,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 05:50:53,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:50:53,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 05:50:53,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:50:53,322 INFO L87 Difference]: Start difference. First operand 292 states and 465 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:54,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:50:54,329 INFO L93 Difference]: Finished difference Result 481 states and 762 transitions. [2024-10-24 05:50:54,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 05:50:54,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 244 [2024-10-24 05:50:54,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:50:54,334 INFO L225 Difference]: With dead ends: 481 [2024-10-24 05:50:54,334 INFO L226 Difference]: Without dead ends: 300 [2024-10-24 05:50:54,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:50:54,336 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 136 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 05:50:54,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 426 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 05:50:54,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-24 05:50:54,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 292. [2024-10-24 05:50:54,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 185 states have (on average 1.4108108108108108) internal successors, (261), 186 states have internal predecessors, (261), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-24 05:50:54,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 461 transitions. [2024-10-24 05:50:54,376 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 461 transitions. Word has length 244 [2024-10-24 05:50:54,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:50:54,377 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 461 transitions. [2024-10-24 05:50:54,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-24 05:50:54,378 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 461 transitions. [2024-10-24 05:50:54,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-24 05:50:54,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:50:54,385 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:50:54,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 05:50:54,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:50:54,586 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:50:54,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:50:54,586 INFO L85 PathProgramCache]: Analyzing trace with hash 620461943, now seen corresponding path program 1 times [2024-10-24 05:50:54,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:50:54,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049376937] [2024-10-24 05:50:54,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:50:54,588 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:50:54,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:50:54,591 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:50:54,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 05:50:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:50:54,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 05:50:54,926 INFO L278 TraceCheckSpWp]: Computing forward predicates...