./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-97.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 e67445e12651560afd9610d5a103069fc2fc9d028994dc4bd874cfab54748c3d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:47:42,279 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:47:42,367 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:47:42,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:47:42,377 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:47:42,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:47:42,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:47:42,412 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:47:42,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:47:42,413 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:47:42,413 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:47:42,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:47:42,414 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:47:42,417 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:47:42,417 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:47:42,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:47:42,418 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:47:42,418 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:47:42,418 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:47:42,419 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:47:42,419 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:47:42,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:47:42,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:47:42,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:47:42,423 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:47:42,423 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:47:42,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:47:42,424 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:47:42,424 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:47:42,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:47:42,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:47:42,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:47:42,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:47:42,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:47:42,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:47:42,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:47:42,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:47:42,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:47:42,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:47:42,428 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:47:42,428 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:47:42,428 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:47:42,429 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 -> e67445e12651560afd9610d5a103069fc2fc9d028994dc4bd874cfab54748c3d [2024-11-12 07:47:42,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:47:42,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:47:42,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:47:42,715 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:47:42,716 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:47:42,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-97.i [2024-11-12 07:47:44,232 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:47:44,437 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:47:44,438 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-97.i [2024-11-12 07:47:44,447 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/231aaaf13/ca497330011c410a97a15a50ee4f6e17/FLAGce8fe0249 [2024-11-12 07:47:44,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/231aaaf13/ca497330011c410a97a15a50ee4f6e17 [2024-11-12 07:47:44,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:47:44,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:47:44,801 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:47:44,801 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:47:44,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:47:44,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:47:44" (1/1) ... [2024-11-12 07:47:44,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62ed2f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:47:44, skipping insertion in model container [2024-11-12 07:47:44,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:47:44" (1/1) ... [2024-11-12 07:47:44,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:47:45,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-97.i[916,929] [2024-11-12 07:47:45,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:47:45,063 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:47:45,072 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-97.i[916,929] [2024-11-12 07:47:45,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:47:45,137 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:47:45,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:47:45 WrapperNode [2024-11-12 07:47:45,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:47:45,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:47:45,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:47:45,139 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:47:45,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:47:45" (1/1) ... [2024-11-12 07:47:45,155 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:47:45" (1/1) ... [2024-11-12 07:47:45,191 INFO L138 Inliner]: procedures = 30, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 432 [2024-11-12 07:47:45,191 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:47:45,192 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:47:45,192 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:47:45,192 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:47:45,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:47:45" (1/1) ... [2024-11-12 07:47:45,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:47:45" (1/1) ... [2024-11-12 07:47:45,225 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:47:45" (1/1) ... [2024-11-12 07:47:45,232 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-12 07:47:45,233 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:47:45" (1/1) ... [2024-11-12 07:47:45,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:47:45" (1/1) ... [2024-11-12 07:47:45,251 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:47:45" (1/1) ... [2024-11-12 07:47:45,256 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:47:45" (1/1) ... [2024-11-12 07:47:45,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:47:45" (1/1) ... [2024-11-12 07:47:45,260 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:47:45" (1/1) ... [2024-11-12 07:47:45,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:47:45,266 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:47:45,266 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:47:45,266 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:47:45,267 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:47:45" (1/1) ... [2024-11-12 07:47:45,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:47:45,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:47:45,319 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 07:47:45,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 07:47:45,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:47:45,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-12 07:47:45,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-12 07:47:45,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-12 07:47:45,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 07:47:45,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-12 07:47:45,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 07:47:45,385 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:47:45,385 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:47:45,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 07:47:45,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:47:45,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:47:45,535 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:47:45,537 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:47:46,163 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-11-12 07:47:46,163 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:47:46,184 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:47:46,186 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:47:46,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:47:46 BoogieIcfgContainer [2024-11-12 07:47:46,187 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:47:46,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:47:46,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:47:46,194 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:47:46,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:47:44" (1/3) ... [2024-11-12 07:47:46,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60eb402b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:47:46, skipping insertion in model container [2024-11-12 07:47:46,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:47:45" (2/3) ... [2024-11-12 07:47:46,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60eb402b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:47:46, skipping insertion in model container [2024-11-12 07:47:46,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:47:46" (3/3) ... [2024-11-12 07:47:46,197 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-97.i [2024-11-12 07:47:46,216 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:47:46,216 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:47:46,279 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:47:46,285 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;@730e161c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:47:46,285 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:47:46,290 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 88 states have (on average 1.3977272727272727) internal successors, (123), 89 states have internal predecessors, (123), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:47:46,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-12 07:47:46,306 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:47:46,307 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:47:46,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:47:46,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:47:46,313 INFO L85 PathProgramCache]: Analyzing trace with hash 322779117, now seen corresponding path program 1 times [2024-11-12 07:47:46,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:47:46,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517617882] [2024-11-12 07:47:46,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:47:46,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:47:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:46,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:47:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:46,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:47:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:46,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:47:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:46,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:47:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:46,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:47:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:46,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:47:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:46,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:47:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:46,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:47:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:46,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:47:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:46,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:47:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:46,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:47:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:46,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:47:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:46,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:47:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:46,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:47:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:46,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:47:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:46,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:47:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:46,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:47:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:46,779 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:47:46,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:47:46,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517617882] [2024-11-12 07:47:46,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517617882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:47:46,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:47:46,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:47:46,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971605378] [2024-11-12 07:47:46,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:47:46,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:47:46,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:47:46,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:47:46,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:47:46,817 INFO L87 Difference]: Start difference. First operand has 108 states, 88 states have (on average 1.3977272727272727) internal successors, (123), 89 states have internal predecessors, (123), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:47:46,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:47:46,856 INFO L93 Difference]: Finished difference Result 209 states and 325 transitions. [2024-11-12 07:47:46,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:47:46,860 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2024-11-12 07:47:46,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:47:46,870 INFO L225 Difference]: With dead ends: 209 [2024-11-12 07:47:46,870 INFO L226 Difference]: Without dead ends: 104 [2024-11-12 07:47:46,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:47:46,878 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:47:46,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:47:46,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-12 07:47:46,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-12 07:47:46,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.3647058823529412) internal successors, (116), 85 states have internal predecessors, (116), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:47:46,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 150 transitions. [2024-11-12 07:47:46,935 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 150 transitions. Word has length 134 [2024-11-12 07:47:46,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:47:46,937 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 150 transitions. [2024-11-12 07:47:46,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:47:46,938 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 150 transitions. [2024-11-12 07:47:46,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-12 07:47:46,944 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:47:46,944 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:47:46,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:47:46,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:47:46,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:47:46,946 INFO L85 PathProgramCache]: Analyzing trace with hash 468796107, now seen corresponding path program 1 times [2024-11-12 07:47:46,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:47:46,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270960645] [2024-11-12 07:47:46,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:47:46,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:47:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:47:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:47:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:47:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:47:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:47:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:47:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:47:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:47:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:47:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:47:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:47:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:47:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:47:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:47:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:47:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:47:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:47:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,561 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:47:47,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:47:47,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270960645] [2024-11-12 07:47:47,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270960645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:47:47,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:47:47,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:47:47,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372265291] [2024-11-12 07:47:47,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:47:47,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:47:47,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:47:47,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:47:47,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:47:47,567 INFO L87 Difference]: Start difference. First operand 104 states and 150 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:47:47,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:47:47,622 INFO L93 Difference]: Finished difference Result 207 states and 300 transitions. [2024-11-12 07:47:47,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:47:47,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-11-12 07:47:47,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:47:47,627 INFO L225 Difference]: With dead ends: 207 [2024-11-12 07:47:47,629 INFO L226 Difference]: Without dead ends: 106 [2024-11-12 07:47:47,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:47:47,631 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:47:47,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:47:47,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-12 07:47:47,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-12 07:47:47,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 87 states have internal predecessors, (118), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:47:47,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 152 transitions. [2024-11-12 07:47:47,646 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 152 transitions. Word has length 134 [2024-11-12 07:47:47,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:47:47,648 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 152 transitions. [2024-11-12 07:47:47,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:47:47,649 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 152 transitions. [2024-11-12 07:47:47,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:47:47,652 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:47:47,652 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:47:47,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:47:47,653 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:47:47,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:47:47,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1684705181, now seen corresponding path program 1 times [2024-11-12 07:47:47,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:47:47,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228030129] [2024-11-12 07:47:47,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:47:47,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:47:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:47:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:47:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:47:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:47:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:47:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:47:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:47:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:47:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:47:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:47:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:47:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:47:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:47:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:47:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:47:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:47:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:47:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:47:47,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:47:47,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228030129] [2024-11-12 07:47:47,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228030129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:47:47,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:47:47,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:47:47,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341131333] [2024-11-12 07:47:47,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:47:47,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:47:47,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:47:47,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:47:47,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:47:47,940 INFO L87 Difference]: Start difference. First operand 106 states and 152 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:47:47,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:47:47,998 INFO L93 Difference]: Finished difference Result 212 states and 305 transitions. [2024-11-12 07:47:48,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:47:48,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-12 07:47:48,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:47:48,004 INFO L225 Difference]: With dead ends: 212 [2024-11-12 07:47:48,005 INFO L226 Difference]: Without dead ends: 109 [2024-11-12 07:47:48,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:47:48,009 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:47:48,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 430 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:47:48,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-12 07:47:48,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-12 07:47:48,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 89 states have (on average 1.348314606741573) internal successors, (120), 89 states have internal predecessors, (120), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:47:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2024-11-12 07:47:48,027 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 136 [2024-11-12 07:47:48,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:47:48,027 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2024-11-12 07:47:48,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:47:48,029 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2024-11-12 07:47:48,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:47:48,033 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:47:48,034 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:47:48,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:47:48,034 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:47:48,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:47:48,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1930203745, now seen corresponding path program 1 times [2024-11-12 07:47:48,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:47:48,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383518897] [2024-11-12 07:47:48,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:47:48,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:47:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:47:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:47:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:47:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:47:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:47:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:47:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:47:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:47:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:47:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:47:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:47:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:47:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:47:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:47:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:47:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:47:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:47:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,261 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:47:48,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:47:48,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383518897] [2024-11-12 07:47:48,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383518897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:47:48,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:47:48,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:47:48,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605478158] [2024-11-12 07:47:48,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:47:48,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:47:48,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:47:48,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:47:48,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:47:48,268 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:47:48,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:47:48,302 INFO L93 Difference]: Finished difference Result 216 states and 309 transitions. [2024-11-12 07:47:48,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:47:48,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-12 07:47:48,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:47:48,304 INFO L225 Difference]: With dead ends: 216 [2024-11-12 07:47:48,305 INFO L226 Difference]: Without dead ends: 111 [2024-11-12 07:47:48,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:47:48,308 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 431 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.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:47:48,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 431 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:47:48,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-12 07:47:48,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-12 07:47:48,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:47:48,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 156 transitions. [2024-11-12 07:47:48,322 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 156 transitions. Word has length 136 [2024-11-12 07:47:48,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:47:48,323 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 156 transitions. [2024-11-12 07:47:48,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:47:48,324 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2024-11-12 07:47:48,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:47:48,327 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:47:48,327 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:47:48,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:47:48,327 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:47:48,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:47:48,328 INFO L85 PathProgramCache]: Analyzing trace with hash -155196383, now seen corresponding path program 1 times [2024-11-12 07:47:48,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:47:48,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522346128] [2024-11-12 07:47:48,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:47:48,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:47:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:47:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:47:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:47:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:47:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:47:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:47:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:47:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:47:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:47:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:47:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:47:48,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:47:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:47:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:47:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:47:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:47:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:47:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:48,553 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:47:48,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:47:48,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522346128] [2024-11-12 07:47:48,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522346128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:47:48,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:47:48,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:47:48,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179923903] [2024-11-12 07:47:48,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:47:48,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:47:48,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:47:48,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:47:48,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:47:48,557 INFO L87 Difference]: Start difference. First operand 110 states and 156 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:47:48,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:47:48,582 INFO L93 Difference]: Finished difference Result 220 states and 313 transitions. [2024-11-12 07:47:48,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:47:48,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-12 07:47:48,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:47:48,584 INFO L225 Difference]: With dead ends: 220 [2024-11-12 07:47:48,584 INFO L226 Difference]: Without dead ends: 113 [2024-11-12 07:47:48,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:47:48,585 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:47:48,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 433 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:47:48,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-12 07:47:48,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-12 07:47:48,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:47:48,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 158 transitions. [2024-11-12 07:47:48,593 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 158 transitions. Word has length 136 [2024-11-12 07:47:48,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:47:48,594 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 158 transitions. [2024-11-12 07:47:48,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:47:48,594 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 158 transitions. [2024-11-12 07:47:48,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:47:48,596 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:47:48,596 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:47:48,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 07:47:48,596 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:47:48,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:47:48,597 INFO L85 PathProgramCache]: Analyzing trace with hash -153349341, now seen corresponding path program 1 times [2024-11-12 07:47:48,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:47:48,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212469684] [2024-11-12 07:47:48,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:47:48,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:47:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:49,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:47:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:49,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:47:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:49,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:47:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:49,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:47:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:49,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:47:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:49,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:47:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:49,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:47:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:49,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:47:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:49,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:47:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:49,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:47:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:49,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:47:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:49,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:47:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:49,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:47:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:49,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:47:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:49,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:47:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:49,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:47:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:49,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:47:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:49,127 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:47:49,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:47:49,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212469684] [2024-11-12 07:47:49,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212469684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:47:49,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:47:49,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:47:49,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362907589] [2024-11-12 07:47:49,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:47:49,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:47:49,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:47:49,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:47:49,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:47:49,129 INFO L87 Difference]: Start difference. First operand 112 states and 158 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:47:49,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:47:49,429 INFO L93 Difference]: Finished difference Result 332 states and 470 transitions. [2024-11-12 07:47:49,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:47:49,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-12 07:47:49,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:47:49,431 INFO L225 Difference]: With dead ends: 332 [2024-11-12 07:47:49,433 INFO L226 Difference]: Without dead ends: 223 [2024-11-12 07:47:49,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:47:49,435 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 130 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:47:49,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 519 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:47:49,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-12 07:47:49,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 123. [2024-11-12 07:47:49,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.3461538461538463) internal successors, (140), 104 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:47:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2024-11-12 07:47:49,454 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 136 [2024-11-12 07:47:49,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:47:49,455 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2024-11-12 07:47:49,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:47:49,455 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2024-11-12 07:47:49,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:47:49,457 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:47:49,457 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:47:49,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 07:47:49,457 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:47:49,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:47:49,458 INFO L85 PathProgramCache]: Analyzing trace with hash -287362847, now seen corresponding path program 1 times [2024-11-12 07:47:49,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:47:49,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849254788] [2024-11-12 07:47:49,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:47:49,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:47:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:50,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:47:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:50,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:47:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:50,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:47:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:50,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:47:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:50,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:47:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:50,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:47:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:50,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:47:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:50,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:47:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:50,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:47:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:50,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:47:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:50,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:47:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:50,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:47:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:50,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:47:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:50,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:47:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:50,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:47:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:50,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:47:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:50,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:47:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:50,185 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:47:50,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:47:50,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849254788] [2024-11-12 07:47:50,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849254788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:47:50,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:47:50,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:47:50,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605191957] [2024-11-12 07:47:50,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:47:50,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:47:50,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:47:50,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:47:50,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:47:50,187 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:47:50,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:47:50,848 INFO L93 Difference]: Finished difference Result 335 states and 472 transitions. [2024-11-12 07:47:50,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:47:50,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-12 07:47:50,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:47:50,851 INFO L225 Difference]: With dead ends: 335 [2024-11-12 07:47:50,851 INFO L226 Difference]: Without dead ends: 215 [2024-11-12 07:47:50,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:47:50,852 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 237 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:47:50,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 389 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:47:50,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-12 07:47:50,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 125. [2024-11-12 07:47:50,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 106 states have (on average 1.3396226415094339) internal successors, (142), 106 states have internal predecessors, (142), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:47:50,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 176 transitions. [2024-11-12 07:47:50,876 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 176 transitions. Word has length 136 [2024-11-12 07:47:50,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:47:50,877 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 176 transitions. [2024-11-12 07:47:50,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:47:50,877 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 176 transitions. [2024-11-12 07:47:50,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:47:50,880 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:47:50,880 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:47:50,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 07:47:50,881 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:47:50,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:47:50,881 INFO L85 PathProgramCache]: Analyzing trace with hash 638900394, now seen corresponding path program 1 times [2024-11-12 07:47:50,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:47:50,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146951961] [2024-11-12 07:47:50,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:47:50,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:47:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:52,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:47:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:52,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:47:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:52,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:47:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:52,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:47:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:52,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:47:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:52,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:47:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:52,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:47:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:52,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:47:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:52,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:47:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:52,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:47:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:52,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:47:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:52,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:47:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:52,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:47:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:52,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:47:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:52,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:47:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:52,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:47:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:52,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:47:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:52,281 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-12 07:47:52,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:47:52,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146951961] [2024-11-12 07:47:52,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146951961] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:47:52,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992328469] [2024-11-12 07:47:52,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:47:52,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:47:52,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:47:52,284 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 07:47:52,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 07:47:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:52,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 07:47:52,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:47:52,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-12 07:47:52,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-12 07:47:52,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-12 07:47:52,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:47:52,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 35 [2024-11-12 07:47:52,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:47:52,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 47 [2024-11-12 07:47:53,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 113 [2024-11-12 07:47:53,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:47:53,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 113 treesize of output 151 [2024-11-12 07:47:53,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 86 [2024-11-12 07:47:53,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:47:53,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 181 treesize of output 67 [2024-11-12 07:47:53,460 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 276 proven. 18 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-12 07:47:53,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:47:53,845 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-12 07:47:53,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992328469] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 07:47:53,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 07:47:53,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 21 [2024-11-12 07:47:53,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194095274] [2024-11-12 07:47:53,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 07:47:53,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-12 07:47:53,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:47:53,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-12 07:47:53,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-11-12 07:47:53,849 INFO L87 Difference]: Start difference. First operand 125 states and 176 transitions. Second operand has 21 states, 18 states have (on average 5.333333333333333) internal successors, (96), 21 states have internal predecessors, (96), 6 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 6 states have call successors, (35) [2024-11-12 07:47:56,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:47:56,490 INFO L93 Difference]: Finished difference Result 465 states and 643 transitions. [2024-11-12 07:47:56,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-12 07:47:56,491 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 5.333333333333333) internal successors, (96), 21 states have internal predecessors, (96), 6 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 6 states have call successors, (35) Word has length 136 [2024-11-12 07:47:56,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:47:56,493 INFO L225 Difference]: With dead ends: 465 [2024-11-12 07:47:56,495 INFO L226 Difference]: Without dead ends: 343 [2024-11-12 07:47:56,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 296 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=530, Invalid=2226, Unknown=0, NotChecked=0, Total=2756 [2024-11-12 07:47:56,499 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 878 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 1634 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 1634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:47:56,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 1087 Invalid, 1942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 1634 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-12 07:47:56,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-11-12 07:47:56,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 312. [2024-11-12 07:47:56,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 254 states have (on average 1.295275590551181) internal successors, (329), 257 states have internal predecessors, (329), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-12 07:47:56,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 429 transitions. [2024-11-12 07:47:56,528 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 429 transitions. Word has length 136 [2024-11-12 07:47:56,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:47:56,529 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 429 transitions. [2024-11-12 07:47:56,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 5.333333333333333) internal successors, (96), 21 states have internal predecessors, (96), 6 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 6 states have call successors, (35) [2024-11-12 07:47:56,529 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 429 transitions. [2024-11-12 07:47:56,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:47:56,531 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:47:56,531 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:47:56,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 07:47:56,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:47:56,732 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:47:56,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:47:56,733 INFO L85 PathProgramCache]: Analyzing trace with hash 278043843, now seen corresponding path program 1 times [2024-11-12 07:47:56,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:47:56,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770570170] [2024-11-12 07:47:56,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:47:56,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:47:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:57,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:47:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:57,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:47:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:57,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:47:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:57,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:47:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:57,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:47:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:57,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:47:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:57,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:47:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:57,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:47:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:57,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:47:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:57,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:47:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:57,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:47:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:57,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:47:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:57,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:47:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:57,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:47:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:57,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:47:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:57,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:47:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:57,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:47:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:57,808 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-12 07:47:57,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:47:57,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770570170] [2024-11-12 07:47:57,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770570170] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:47:57,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042933031] [2024-11-12 07:47:57,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:47:57,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:47:57,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:47:57,811 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 07:47:57,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 07:47:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:47:58,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-12 07:47:58,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:47:58,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-12 07:47:58,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-12 07:47:58,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:47:58,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 53 [2024-11-12 07:47:58,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:47:58,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2024-11-12 07:47:58,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 124 [2024-11-12 07:47:58,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:47:58,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 124 treesize of output 182 [2024-11-12 07:47:58,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 72 [2024-11-12 07:47:58,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:47:58,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 211 treesize of output 73 [2024-11-12 07:47:58,614 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 232 proven. 12 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-11-12 07:47:58,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:47:58,893 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-12 07:47:58,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042933031] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 07:47:58,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 07:47:58,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 19 [2024-11-12 07:47:58,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504622593] [2024-11-12 07:47:58,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 07:47:58,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 07:47:58,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:47:58,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 07:47:58,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2024-11-12 07:47:58,896 INFO L87 Difference]: Start difference. First operand 312 states and 429 transitions. Second operand has 19 states, 17 states have (on average 4.529411764705882) internal successors, (77), 19 states have internal predecessors, (77), 4 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) [2024-11-12 07:48:00,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:48:00,905 INFO L93 Difference]: Finished difference Result 838 states and 1134 transitions. [2024-11-12 07:48:00,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-12 07:48:00,906 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 4.529411764705882) internal successors, (77), 19 states have internal predecessors, (77), 4 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) Word has length 136 [2024-11-12 07:48:00,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:48:00,915 INFO L225 Difference]: With dead ends: 838 [2024-11-12 07:48:00,915 INFO L226 Difference]: Without dead ends: 550 [2024-11-12 07:48:00,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 294 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=315, Invalid=1245, Unknown=0, NotChecked=0, Total=1560 [2024-11-12 07:48:00,917 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 607 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 1941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:48:00,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 1032 Invalid, 1941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-12 07:48:00,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-12 07:48:00,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 274. [2024-11-12 07:48:00,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 225 states have (on average 1.2977777777777777) internal successors, (292), 227 states have internal predecessors, (292), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 07:48:00,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 372 transitions. [2024-11-12 07:48:00,948 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 372 transitions. Word has length 136 [2024-11-12 07:48:00,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:48:00,949 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 372 transitions. [2024-11-12 07:48:00,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 4.529411764705882) internal successors, (77), 19 states have internal predecessors, (77), 4 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) [2024-11-12 07:48:00,949 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 372 transitions. [2024-11-12 07:48:00,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:48:00,950 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:48:00,950 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:48:00,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 07:48:01,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-12 07:48:01,151 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:48:01,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:48:01,152 INFO L85 PathProgramCache]: Analyzing trace with hash 144030337, now seen corresponding path program 1 times [2024-11-12 07:48:01,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:48:01,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414604416] [2024-11-12 07:48:01,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:01,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:48:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:01,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:48:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:01,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:48:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:01,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:48:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:01,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:48:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:01,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:48:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:01,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:48:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:01,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:48:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:01,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:48:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:01,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:48:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:01,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:48:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:01,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:48:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:01,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:48:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:01,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:48:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:01,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:48:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:01,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:48:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:01,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:48:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:01,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:48:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:01,983 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-12 07:48:01,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:48:01,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414604416] [2024-11-12 07:48:01,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414604416] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:48:01,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391639286] [2024-11-12 07:48:01,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:01,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:48:01,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:48:01,986 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 07:48:01,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 07:48:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:02,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-12 07:48:02,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:48:02,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 83 [2024-11-12 07:48:02,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:48:02,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2024-11-12 07:48:02,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2024-11-12 07:48:02,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:48:02,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 269 treesize of output 113 [2024-11-12 07:48:02,528 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:48:02,528 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:48:02,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391639286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:48:02,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:48:02,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2024-11-12 07:48:02,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997478453] [2024-11-12 07:48:02,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:48:02,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:48:02,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:48:02,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:48:02,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-12 07:48:02,529 INFO L87 Difference]: Start difference. First operand 274 states and 372 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:03,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:48:03,074 INFO L93 Difference]: Finished difference Result 569 states and 774 transitions. [2024-11-12 07:48:03,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:48:03,074 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-12 07:48:03,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:48:03,076 INFO L225 Difference]: With dead ends: 569 [2024-11-12 07:48:03,076 INFO L226 Difference]: Without dead ends: 350 [2024-11-12 07:48:03,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-11-12 07:48:03,077 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 75 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:48:03,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 802 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:48:03,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-12 07:48:03,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 281. [2024-11-12 07:48:03,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 232 states have (on average 1.293103448275862) internal successors, (300), 234 states have internal predecessors, (300), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 07:48:03,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 380 transitions. [2024-11-12 07:48:03,107 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 380 transitions. Word has length 136 [2024-11-12 07:48:03,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:48:03,107 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 380 transitions. [2024-11-12 07:48:03,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:03,108 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 380 transitions. [2024-11-12 07:48:03,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-12 07:48:03,109 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:48:03,109 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:48:03,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 07:48:03,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:48:03,310 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:48:03,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:48:03,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1439137510, now seen corresponding path program 1 times [2024-11-12 07:48:03,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:48:03,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138672113] [2024-11-12 07:48:03,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:03,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:48:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:03,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:48:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:03,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:48:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:03,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:48:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:03,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:48:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:03,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:48:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:03,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:48:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:03,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:48:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:03,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:48:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:03,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:48:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:03,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:48:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:03,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:48:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:03,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:48:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:03,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:48:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:03,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:48:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:03,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:48:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:03,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:48:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:03,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:48:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:03,564 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:48:03,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:48:03,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138672113] [2024-11-12 07:48:03,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138672113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:48:03,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:48:03,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:48:03,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51211022] [2024-11-12 07:48:03,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:48:03,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:48:03,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:48:03,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:48:03,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:48:03,566 INFO L87 Difference]: Start difference. First operand 281 states and 380 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:03,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:48:03,968 INFO L93 Difference]: Finished difference Result 739 states and 1004 transitions. [2024-11-12 07:48:03,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:48:03,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2024-11-12 07:48:03,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:48:03,972 INFO L225 Difference]: With dead ends: 739 [2024-11-12 07:48:03,974 INFO L226 Difference]: Without dead ends: 513 [2024-11-12 07:48:03,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:48:03,976 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 131 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:48:03,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 973 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:48:03,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-11-12 07:48:04,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 293. [2024-11-12 07:48:04,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 244 states have (on average 1.2950819672131149) internal successors, (316), 246 states have internal predecessors, (316), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 07:48:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 396 transitions. [2024-11-12 07:48:04,008 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 396 transitions. Word has length 137 [2024-11-12 07:48:04,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:48:04,008 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 396 transitions. [2024-11-12 07:48:04,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:04,009 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 396 transitions. [2024-11-12 07:48:04,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-12 07:48:04,011 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:48:04,011 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:48:04,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 07:48:04,012 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:48:04,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:48:04,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1036036344, now seen corresponding path program 1 times [2024-11-12 07:48:04,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:48:04,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190065369] [2024-11-12 07:48:04,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:04,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:48:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:04,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:48:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:04,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:48:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:04,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:48:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:04,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:48:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:04,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:48:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:04,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:48:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:04,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:48:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:04,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:48:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:04,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:48:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:04,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:48:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:04,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:48:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:04,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:48:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:04,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:48:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:04,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:48:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:04,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:48:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:04,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:48:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:04,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:48:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:04,998 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:48:04,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:48:04,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190065369] [2024-11-12 07:48:04,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190065369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:48:04,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:48:04,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:48:04,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817375834] [2024-11-12 07:48:04,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:48:05,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:48:05,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:48:05,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:48:05,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:48:05,001 INFO L87 Difference]: Start difference. First operand 293 states and 396 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:48:05,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:48:05,570 INFO L93 Difference]: Finished difference Result 693 states and 932 transitions. [2024-11-12 07:48:05,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:48:05,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2024-11-12 07:48:05,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:48:05,573 INFO L225 Difference]: With dead ends: 693 [2024-11-12 07:48:05,573 INFO L226 Difference]: Without dead ends: 455 [2024-11-12 07:48:05,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:48:05,575 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 106 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:48:05,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 788 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:48:05,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-12 07:48:05,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 293. [2024-11-12 07:48:05,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 244 states have (on average 1.2868852459016393) internal successors, (314), 246 states have internal predecessors, (314), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 07:48:05,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 394 transitions. [2024-11-12 07:48:05,605 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 394 transitions. Word has length 138 [2024-11-12 07:48:05,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:48:05,605 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 394 transitions. [2024-11-12 07:48:05,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:48:05,606 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 394 transitions. [2024-11-12 07:48:05,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 07:48:05,607 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:48:05,607 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:48:05,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 07:48:05,607 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:48:05,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:48:05,608 INFO L85 PathProgramCache]: Analyzing trace with hash 822033323, now seen corresponding path program 1 times [2024-11-12 07:48:05,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:48:05,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294344589] [2024-11-12 07:48:05,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:05,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:48:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:06,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:48:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:06,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:48:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:06,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:48:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:06,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:48:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:06,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:48:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:06,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:48:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:06,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:48:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:06,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:48:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:06,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:48:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:06,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:48:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:06,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:48:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:06,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:48:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:06,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:48:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:06,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:48:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:06,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:48:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:06,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:48:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:06,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:48:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:06,424 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:48:06,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:48:06,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294344589] [2024-11-12 07:48:06,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294344589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:48:06,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:48:06,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:48:06,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045422986] [2024-11-12 07:48:06,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:48:06,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:48:06,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:48:06,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:48:06,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:48:06,427 INFO L87 Difference]: Start difference. First operand 293 states and 394 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:06,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:48:06,859 INFO L93 Difference]: Finished difference Result 683 states and 914 transitions. [2024-11-12 07:48:06,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:48:06,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2024-11-12 07:48:06,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:48:06,863 INFO L225 Difference]: With dead ends: 683 [2024-11-12 07:48:06,863 INFO L226 Difference]: Without dead ends: 445 [2024-11-12 07:48:06,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:48:06,864 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 105 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:48:06,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 481 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:48:06,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-12 07:48:06,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 293. [2024-11-12 07:48:06,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 244 states have (on average 1.278688524590164) internal successors, (312), 246 states have internal predecessors, (312), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 07:48:06,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 392 transitions. [2024-11-12 07:48:06,913 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 392 transitions. Word has length 139 [2024-11-12 07:48:06,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:48:06,913 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 392 transitions. [2024-11-12 07:48:06,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:06,914 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 392 transitions. [2024-11-12 07:48:06,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 07:48:06,916 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:48:06,916 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:48:06,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 07:48:06,917 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:48:06,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:48:06,917 INFO L85 PathProgramCache]: Analyzing trace with hash 2030698450, now seen corresponding path program 1 times [2024-11-12 07:48:06,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:48:06,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385224313] [2024-11-12 07:48:06,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:06,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:48:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:07,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:48:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:07,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:48:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:07,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:48:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:07,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:48:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:07,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:48:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:07,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:48:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:07,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:48:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:07,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:48:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:07,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:48:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:07,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:48:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:07,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:48:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:07,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:48:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:07,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:48:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:07,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:48:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:07,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:48:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:07,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:48:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:07,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:48:07,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:07,468 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:48:07,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:48:07,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385224313] [2024-11-12 07:48:07,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385224313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:48:07,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:48:07,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:48:07,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580920847] [2024-11-12 07:48:07,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:48:07,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:48:07,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:48:07,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:48:07,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:48:07,471 INFO L87 Difference]: Start difference. First operand 293 states and 392 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:48:07,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:48:07,697 INFO L93 Difference]: Finished difference Result 531 states and 712 transitions. [2024-11-12 07:48:07,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:48:07,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2024-11-12 07:48:07,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:48:07,702 INFO L225 Difference]: With dead ends: 531 [2024-11-12 07:48:07,703 INFO L226 Difference]: Without dead ends: 293 [2024-11-12 07:48:07,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:48:07,707 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 185 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:48:07,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 171 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:48:07,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-12 07:48:07,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2024-11-12 07:48:07,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 244 states have (on average 1.2663934426229508) internal successors, (309), 246 states have internal predecessors, (309), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 07:48:07,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 389 transitions. [2024-11-12 07:48:07,741 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 389 transitions. Word has length 139 [2024-11-12 07:48:07,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:48:07,743 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 389 transitions. [2024-11-12 07:48:07,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:48:07,743 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 389 transitions. [2024-11-12 07:48:07,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 07:48:07,744 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:48:07,744 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:48:07,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 07:48:07,745 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:48:07,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:48:07,745 INFO L85 PathProgramCache]: Analyzing trace with hash -11130563, now seen corresponding path program 1 times [2024-11-12 07:48:07,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:48:07,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430298673] [2024-11-12 07:48:07,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:07,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:48:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:10,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:48:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:10,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:48:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:10,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:48:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:10,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:48:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:10,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:48:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:10,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:48:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:10,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:48:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:10,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:48:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:10,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:48:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:10,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:48:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:10,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:48:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:10,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:48:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:10,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:48:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:10,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:48:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:10,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:48:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:10,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:48:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:10,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:48:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:10,347 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:48:10,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:48:10,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430298673] [2024-11-12 07:48:10,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430298673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:48:10,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:48:10,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 07:48:10,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747492733] [2024-11-12 07:48:10,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:48:10,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:48:10,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:48:10,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:48:10,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:48:10,350 INFO L87 Difference]: Start difference. First operand 293 states and 389 transitions. Second operand has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:48:10,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:48:10,913 INFO L93 Difference]: Finished difference Result 644 states and 852 transitions. [2024-11-12 07:48:10,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 07:48:10,914 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 140 [2024-11-12 07:48:10,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:48:10,916 INFO L225 Difference]: With dead ends: 644 [2024-11-12 07:48:10,916 INFO L226 Difference]: Without dead ends: 406 [2024-11-12 07:48:10,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:48:10,921 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 55 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:48:10,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 967 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:48:10,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-11-12 07:48:10,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 307. [2024-11-12 07:48:10,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 258 states have (on average 1.2674418604651163) internal successors, (327), 260 states have internal predecessors, (327), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 07:48:10,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 407 transitions. [2024-11-12 07:48:10,955 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 407 transitions. Word has length 140 [2024-11-12 07:48:10,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:48:10,956 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 407 transitions. [2024-11-12 07:48:10,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:48:10,956 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 407 transitions. [2024-11-12 07:48:10,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 07:48:10,957 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:48:10,957 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:48:10,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 07:48:10,957 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:48:10,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:48:10,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1599478465, now seen corresponding path program 1 times [2024-11-12 07:48:10,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:48:10,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675375791] [2024-11-12 07:48:10,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:10,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:48:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:11,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:48:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:11,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:48:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:11,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:48:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:11,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:48:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:11,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:48:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:11,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:48:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:11,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:48:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:11,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:48:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:11,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:48:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:11,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:48:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:11,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:48:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:11,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:48:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:11,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:48:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:11,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:48:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:11,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:48:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:11,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:48:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:11,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:48:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:48:11,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:48:11,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675375791] [2024-11-12 07:48:11,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675375791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:48:11,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:48:11,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:48:11,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68289604] [2024-11-12 07:48:11,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:48:11,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:48:11,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:48:11,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:48:11,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:48:11,333 INFO L87 Difference]: Start difference. First operand 307 states and 407 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:11,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:48:11,793 INFO L93 Difference]: Finished difference Result 769 states and 1015 transitions. [2024-11-12 07:48:11,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:48:11,793 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2024-11-12 07:48:11,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:48:11,796 INFO L225 Difference]: With dead ends: 769 [2024-11-12 07:48:11,796 INFO L226 Difference]: Without dead ends: 517 [2024-11-12 07:48:11,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:48:11,801 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 122 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:48:11,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 501 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:48:11,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-11-12 07:48:11,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 340. [2024-11-12 07:48:11,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 291 states have (on average 1.2646048109965635) internal successors, (368), 293 states have internal predecessors, (368), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 07:48:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 448 transitions. [2024-11-12 07:48:11,840 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 448 transitions. Word has length 140 [2024-11-12 07:48:11,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:48:11,840 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 448 transitions. [2024-11-12 07:48:11,840 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:11,840 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 448 transitions. [2024-11-12 07:48:11,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 07:48:11,841 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:48:11,842 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:48:11,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 07:48:11,842 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:48:11,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:48:11,843 INFO L85 PathProgramCache]: Analyzing trace with hash 411571263, now seen corresponding path program 1 times [2024-11-12 07:48:11,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:48:11,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559554789] [2024-11-12 07:48:11,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:11,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:48:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:12,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:48:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:12,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:48:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:12,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:48:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:12,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:48:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:12,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:48:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:12,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:48:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:12,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:48:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:12,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:48:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:12,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:48:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:12,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:48:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:12,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:48:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:12,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:48:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:12,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:48:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:12,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:48:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:12,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:48:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:12,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:48:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:12,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:48:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:12,155 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:48:12,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:48:12,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559554789] [2024-11-12 07:48:12,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559554789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:48:12,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:48:12,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:48:12,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960276739] [2024-11-12 07:48:12,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:48:12,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:48:12,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:48:12,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:48:12,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:48:12,158 INFO L87 Difference]: Start difference. First operand 340 states and 448 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:12,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:48:12,546 INFO L93 Difference]: Finished difference Result 786 states and 1034 transitions. [2024-11-12 07:48:12,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:48:12,547 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2024-11-12 07:48:12,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:48:12,549 INFO L225 Difference]: With dead ends: 786 [2024-11-12 07:48:12,550 INFO L226 Difference]: Without dead ends: 501 [2024-11-12 07:48:12,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:48:12,551 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 124 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:48:12,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 546 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:48:12,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-11-12 07:48:12,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 332. [2024-11-12 07:48:12,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 283 states have (on average 1.265017667844523) internal successors, (358), 285 states have internal predecessors, (358), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 07:48:12,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 438 transitions. [2024-11-12 07:48:12,585 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 438 transitions. Word has length 140 [2024-11-12 07:48:12,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:48:12,585 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 438 transitions. [2024-11-12 07:48:12,586 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:12,586 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 438 transitions. [2024-11-12 07:48:12,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 07:48:12,587 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:48:12,587 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:48:12,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 07:48:12,587 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:48:12,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:48:12,588 INFO L85 PathProgramCache]: Analyzing trace with hash -2108951555, now seen corresponding path program 1 times [2024-11-12 07:48:12,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:48:12,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209560080] [2024-11-12 07:48:12,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:12,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:48:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:48:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:48:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:48:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:48:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:48:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:48:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:48:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:48:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:48:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:48:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:48:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:48:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:48:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:48:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:48:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:48:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:48:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,059 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:48:13,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:48:13,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209560080] [2024-11-12 07:48:13,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209560080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:48:13,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:48:13,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:48:13,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618721214] [2024-11-12 07:48:13,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:48:13,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:48:13,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:48:13,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:48:13,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:48:13,063 INFO L87 Difference]: Start difference. First operand 332 states and 438 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:13,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:48:13,538 INFO L93 Difference]: Finished difference Result 768 states and 1012 transitions. [2024-11-12 07:48:13,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:48:13,539 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2024-11-12 07:48:13,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:48:13,542 INFO L225 Difference]: With dead ends: 768 [2024-11-12 07:48:13,542 INFO L226 Difference]: Without dead ends: 491 [2024-11-12 07:48:13,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:48:13,543 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 310 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:48:13,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 304 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:48:13,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-12 07:48:13,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 296. [2024-11-12 07:48:13,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 247 states have (on average 1.2307692307692308) internal successors, (304), 249 states have internal predecessors, (304), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 07:48:13,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 384 transitions. [2024-11-12 07:48:13,577 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 384 transitions. Word has length 140 [2024-11-12 07:48:13,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:48:13,577 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 384 transitions. [2024-11-12 07:48:13,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:13,578 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 384 transitions. [2024-11-12 07:48:13,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 07:48:13,579 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:48:13,579 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:48:13,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 07:48:13,580 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:48:13,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:48:13,580 INFO L85 PathProgramCache]: Analyzing trace with hash -97901827, now seen corresponding path program 1 times [2024-11-12 07:48:13,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:48:13,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737198147] [2024-11-12 07:48:13,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:13,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:48:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:48:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:48:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:48:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:48:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:48:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:48:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:48:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:48:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:48:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:48:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:48:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:48:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:48:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:48:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:48:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:48:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:48:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:13,994 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:48:13,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:48:13,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737198147] [2024-11-12 07:48:13,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737198147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:48:13,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:48:13,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:48:13,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283289396] [2024-11-12 07:48:13,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:48:13,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:48:13,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:48:13,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:48:13,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:48:13,996 INFO L87 Difference]: Start difference. First operand 296 states and 384 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:14,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:48:14,549 INFO L93 Difference]: Finished difference Result 680 states and 886 transitions. [2024-11-12 07:48:14,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:48:14,549 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2024-11-12 07:48:14,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:48:14,552 INFO L225 Difference]: With dead ends: 680 [2024-11-12 07:48:14,552 INFO L226 Difference]: Without dead ends: 439 [2024-11-12 07:48:14,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:48:14,554 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 269 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:48:14,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 368 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:48:14,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-12 07:48:14,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 263. [2024-11-12 07:48:14,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 214 states have (on average 1.219626168224299) internal successors, (261), 216 states have internal predecessors, (261), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 07:48:14,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 341 transitions. [2024-11-12 07:48:14,606 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 341 transitions. Word has length 140 [2024-11-12 07:48:14,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:48:14,607 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 341 transitions. [2024-11-12 07:48:14,607 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:14,607 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 341 transitions. [2024-11-12 07:48:14,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 07:48:14,609 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:48:14,609 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:48:14,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 07:48:14,609 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:48:14,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:48:14,610 INFO L85 PathProgramCache]: Analyzing trace with hash -146714543, now seen corresponding path program 1 times [2024-11-12 07:48:14,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:48:14,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030617516] [2024-11-12 07:48:14,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:14,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:48:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:15,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:48:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:15,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:48:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:15,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:48:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:15,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:48:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:15,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:48:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:15,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:48:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:15,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:48:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:15,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:48:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:15,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:48:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:15,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:48:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:15,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:48:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:15,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:48:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:15,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:48:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:15,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:48:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:15,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:48:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:15,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:48:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:15,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:48:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:15,193 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-12 07:48:15,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:48:15,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030617516] [2024-11-12 07:48:15,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030617516] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:48:15,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110886208] [2024-11-12 07:48:15,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:15,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:48:15,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:48:15,196 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 07:48:15,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 07:48:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:15,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-12 07:48:15,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:48:15,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 07:48:15,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 07:48:15,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 07:48:15,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 07:48:15,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 07:48:15,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 07:48:15,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 07:48:15,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 07:48:15,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 07:48:15,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 11 [2024-11-12 07:48:15,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 28 [2024-11-12 07:48:15,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 48 [2024-11-12 07:48:15,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2024-11-12 07:48:16,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:48:16,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 28 [2024-11-12 07:48:16,219 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:48:16,219 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:48:16,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110886208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:48:16,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:48:16,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2024-11-12 07:48:16,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297304257] [2024-11-12 07:48:16,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:48:16,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:48:16,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:48:16,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:48:16,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:48:16,221 INFO L87 Difference]: Start difference. First operand 263 states and 341 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:16,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:48:16,625 INFO L93 Difference]: Finished difference Result 473 states and 611 transitions. [2024-11-12 07:48:16,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:48:16,625 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2024-11-12 07:48:16,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:48:16,627 INFO L225 Difference]: With dead ends: 473 [2024-11-12 07:48:16,627 INFO L226 Difference]: Without dead ends: 265 [2024-11-12 07:48:16,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-12 07:48:16,628 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 309 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:48:16,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 376 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:48:16,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-12 07:48:16,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2024-11-12 07:48:16,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 214 states have (on average 1.2149532710280373) internal successors, (260), 216 states have internal predecessors, (260), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 07:48:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 340 transitions. [2024-11-12 07:48:16,663 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 340 transitions. Word has length 140 [2024-11-12 07:48:16,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:48:16,664 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 340 transitions. [2024-11-12 07:48:16,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:16,664 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 340 transitions. [2024-11-12 07:48:16,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 07:48:16,665 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:48:16,666 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:48:16,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 07:48:16,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:48:16,866 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:48:16,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:48:16,869 INFO L85 PathProgramCache]: Analyzing trace with hash 398054226, now seen corresponding path program 1 times [2024-11-12 07:48:16,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:48:16,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731479429] [2024-11-12 07:48:16,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:16,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:48:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:17,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:48:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:17,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:48:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:17,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:48:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:17,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:48:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:17,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:48:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:17,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:48:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:17,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:48:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:17,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:48:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:17,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:48:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:17,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:48:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:17,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:48:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:17,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:48:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:17,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:48:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:17,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:48:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:17,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:48:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:17,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:48:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:17,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:48:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:17,286 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:48:17,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:48:17,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731479429] [2024-11-12 07:48:17,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731479429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:48:17,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:48:17,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:48:17,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187844803] [2024-11-12 07:48:17,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:48:17,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:48:17,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:48:17,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:48:17,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:48:17,288 INFO L87 Difference]: Start difference. First operand 263 states and 340 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:17,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:48:17,555 INFO L93 Difference]: Finished difference Result 271 states and 349 transitions. [2024-11-12 07:48:17,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:48:17,556 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2024-11-12 07:48:17,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:48:17,558 INFO L225 Difference]: With dead ends: 271 [2024-11-12 07:48:17,558 INFO L226 Difference]: Without dead ends: 269 [2024-11-12 07:48:17,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:48:17,559 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 77 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:48:17,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 550 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:48:17,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-12 07:48:17,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-11-12 07:48:17,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 220 states have (on average 1.209090909090909) internal successors, (266), 222 states have internal predecessors, (266), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 07:48:17,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 346 transitions. [2024-11-12 07:48:17,590 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 346 transitions. Word has length 140 [2024-11-12 07:48:17,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:48:17,591 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 346 transitions. [2024-11-12 07:48:17,591 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:17,591 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 346 transitions. [2024-11-12 07:48:17,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 07:48:17,592 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:48:17,592 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:48:17,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 07:48:17,592 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:48:17,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:48:17,593 INFO L85 PathProgramCache]: Analyzing trace with hash 399901268, now seen corresponding path program 1 times [2024-11-12 07:48:17,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:48:17,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104365068] [2024-11-12 07:48:17,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:17,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:48:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:18,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:48:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:18,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:48:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:18,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:48:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:18,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:48:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:18,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:48:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:18,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:48:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:18,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:48:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:18,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:48:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:18,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:48:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:18,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:48:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:18,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:48:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:18,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:48:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:18,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:48:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:18,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:48:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:18,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:48:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:18,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:48:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:18,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:48:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:48:18,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:48:18,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104365068] [2024-11-12 07:48:18,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104365068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:48:18,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:48:18,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:48:18,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844895085] [2024-11-12 07:48:18,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:48:18,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:48:18,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:48:18,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:48:18,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:48:18,353 INFO L87 Difference]: Start difference. First operand 269 states and 346 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:48:18,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:48:18,672 INFO L93 Difference]: Finished difference Result 641 states and 816 transitions. [2024-11-12 07:48:18,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:48:18,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 140 [2024-11-12 07:48:18,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:48:18,678 INFO L225 Difference]: With dead ends: 641 [2024-11-12 07:48:18,678 INFO L226 Difference]: Without dead ends: 427 [2024-11-12 07:48:18,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:48:18,679 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 151 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:48:18,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 397 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:48:18,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-12 07:48:18,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 422. [2024-11-12 07:48:18,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 353 states have (on average 1.2011331444759208) internal successors, (424), 357 states have internal predecessors, (424), 56 states have call successors, (56), 12 states have call predecessors, (56), 12 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-12 07:48:18,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 536 transitions. [2024-11-12 07:48:18,736 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 536 transitions. Word has length 140 [2024-11-12 07:48:18,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:48:18,736 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 536 transitions. [2024-11-12 07:48:18,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:48:18,736 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 536 transitions. [2024-11-12 07:48:18,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 07:48:18,737 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:48:18,738 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:48:18,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 07:48:18,738 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:48:18,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:48:18,738 INFO L85 PathProgramCache]: Analyzing trace with hash -186904746, now seen corresponding path program 1 times [2024-11-12 07:48:18,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:48:18,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082950922] [2024-11-12 07:48:18,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:18,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:48:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:19,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:48:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:19,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:48:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:19,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:48:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:19,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:48:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:19,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:48:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:19,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:48:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:19,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:48:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:19,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:48:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:19,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:48:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:19,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:48:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:19,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:48:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:19,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:48:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:19,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:48:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:19,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:48:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:19,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:48:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:19,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:48:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:19,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:48:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:19,440 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-12 07:48:19,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:48:19,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082950922] [2024-11-12 07:48:19,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082950922] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:48:19,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723150670] [2024-11-12 07:48:19,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:19,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:48:19,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:48:19,442 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 07:48:19,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 07:48:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:19,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-12 07:48:19,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:48:19,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-12 07:48:19,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-12 07:48:19,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-12 07:48:19,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:48:19,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 53 [2024-11-12 07:48:19,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:48:19,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 31 [2024-11-12 07:48:19,934 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 276 proven. 18 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-12 07:48:19,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:48:20,144 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-12 07:48:20,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723150670] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 07:48:20,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 07:48:20,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 12 [2024-11-12 07:48:20,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432813982] [2024-11-12 07:48:20,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 07:48:20,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 07:48:20,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:48:20,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 07:48:20,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:48:20,147 INFO L87 Difference]: Start difference. First operand 422 states and 536 transitions. Second operand has 12 states, 9 states have (on average 7.888888888888889) internal successors, (71), 12 states have internal predecessors, (71), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) [2024-11-12 07:48:21,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:48:21,140 INFO L93 Difference]: Finished difference Result 623 states and 791 transitions. [2024-11-12 07:48:21,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 07:48:21,141 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 7.888888888888889) internal successors, (71), 12 states have internal predecessors, (71), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) Word has length 140 [2024-11-12 07:48:21,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:48:21,142 INFO L225 Difference]: With dead ends: 623 [2024-11-12 07:48:21,142 INFO L226 Difference]: Without dead ends: 260 [2024-11-12 07:48:21,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 308 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2024-11-12 07:48:21,143 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 168 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 07:48:21,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 472 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 07:48:21,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-12 07:48:21,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 256. [2024-11-12 07:48:21,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 206 states have (on average 1.1893203883495145) internal successors, (245), 208 states have internal predecessors, (245), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 07:48:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 325 transitions. [2024-11-12 07:48:21,182 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 325 transitions. Word has length 140 [2024-11-12 07:48:21,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:48:21,183 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 325 transitions. [2024-11-12 07:48:21,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 7.888888888888889) internal successors, (71), 12 states have internal predecessors, (71), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) [2024-11-12 07:48:21,183 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 325 transitions. [2024-11-12 07:48:21,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 07:48:21,184 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:48:21,184 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:48:21,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-12 07:48:21,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-12 07:48:21,385 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:48:21,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:48:21,385 INFO L85 PathProgramCache]: Analyzing trace with hash -164558316, now seen corresponding path program 1 times [2024-11-12 07:48:21,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:48:21,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790222200] [2024-11-12 07:48:21,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:21,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:48:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:48:21,484 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 07:48:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:48:21,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 07:48:21,578 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 07:48:21,580 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 07:48:21,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-12 07:48:21,588 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:48:21,644 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 07:48:21,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:48:21 BoogieIcfgContainer [2024-11-12 07:48:21,647 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 07:48:21,648 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 07:48:21,648 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 07:48:21,648 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 07:48:21,648 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:47:46" (3/4) ... [2024-11-12 07:48:21,651 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 07:48:21,652 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 07:48:21,652 INFO L158 Benchmark]: Toolchain (without parser) took 36853.81ms. Allocated memory was 140.5MB in the beginning and 916.5MB in the end (delta: 775.9MB). Free memory was 83.7MB in the beginning and 436.7MB in the end (delta: -353.0MB). Peak memory consumption was 423.8MB. Max. memory is 16.1GB. [2024-11-12 07:48:21,653 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 140.5MB. Free memory is still 102.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:48:21,653 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.97ms. Allocated memory is still 140.5MB. Free memory was 83.7MB in the beginning and 65.8MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 07:48:21,653 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.49ms. Allocated memory is still 140.5MB. Free memory was 65.8MB in the beginning and 62.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:48:21,654 INFO L158 Benchmark]: Boogie Preprocessor took 72.78ms. Allocated memory is still 140.5MB. Free memory was 62.1MB in the beginning and 58.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:48:21,654 INFO L158 Benchmark]: RCFGBuilder took 920.95ms. Allocated memory was 140.5MB in the beginning and 203.4MB in the end (delta: 62.9MB). Free memory was 58.6MB in the beginning and 145.6MB in the end (delta: -86.9MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-11-12 07:48:21,655 INFO L158 Benchmark]: TraceAbstraction took 35458.06ms. Allocated memory was 203.4MB in the beginning and 916.5MB in the end (delta: 713.0MB). Free memory was 144.6MB in the beginning and 436.7MB in the end (delta: -292.0MB). Peak memory consumption was 421.0MB. Max. memory is 16.1GB. [2024-11-12 07:48:21,655 INFO L158 Benchmark]: Witness Printer took 4.38ms. Allocated memory is still 916.5MB. Free memory is still 436.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:48:21,656 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.23ms. Allocated memory is still 140.5MB. Free memory is still 102.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.97ms. Allocated memory is still 140.5MB. Free memory was 83.7MB in the beginning and 65.8MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.49ms. Allocated memory is still 140.5MB. Free memory was 65.8MB in the beginning and 62.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.78ms. Allocated memory is still 140.5MB. Free memory was 62.1MB in the beginning and 58.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 920.95ms. Allocated memory was 140.5MB in the beginning and 203.4MB in the end (delta: 62.9MB). Free memory was 58.6MB in the beginning and 145.6MB in the end (delta: -86.9MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * TraceAbstraction took 35458.06ms. Allocated memory was 203.4MB in the beginning and 916.5MB in the end (delta: 713.0MB). Free memory was 144.6MB in the beginning and 436.7MB in the end (delta: -292.0MB). Peak memory consumption was 421.0MB. Max. memory is 16.1GB. * Witness Printer took 4.38ms. Allocated memory is still 916.5MB. Free memory is still 436.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 120. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 16, 32, 20113, 100, 100, -1, 16, 1, 0, 1, 10, 256, 32.5, 127.4, 128 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] FCALL updateLastVariables() [L128] CALL updateVariables() [L90] WrapperStruct00.var_1_7 = __VERIFIER_nondet_short() [L91] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] WrapperStruct00.var_1_8 = __VERIFIER_nondet_short() [L94] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] WrapperStruct00.var_1_9 = __VERIFIER_nondet_short() [L97] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] WrapperStruct00.var_1_11 = __VERIFIER_nondet_char() [L100] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] WrapperStruct00.var_1_12 = __VERIFIER_nondet_char() [L103] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -31) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -31) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 32) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 32) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L110] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] WrapperStruct00.var_1_19 = __VERIFIER_nondet_ushort() [L112] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] WrapperStruct00.var_1_21 = __VERIFIER_nondet_float() [L115] EXPR WrapperStruct00.var_1_21 [L115] EXPR WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_21 [L115] EXPR WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR (WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L128] RET updateVariables() [L129] CALL step() [L60] EXPR WrapperStruct00.var_1_19 [L60] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_19 [L61] EXPR WrapperStruct00.var_1_21 [L61] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_21 [L62] EXPR WrapperStruct00.var_1_12 [L62] WrapperStruct00.var_1_22 = WrapperStruct00.var_1_12 [L63] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L63] COND FALSE !(127.5f > WrapperStruct00.var_1_20) [L66] EXPR WrapperStruct00.var_1_20 [L66] EXPR WrapperStruct00.var_1_20 [L66] EXPR (WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L66] WrapperStruct00.var_1_13 = ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15) [L68] EXPR WrapperStruct00.var_1_18 [L68] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L68] COND TRUE WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7 [L69] EXPR WrapperStruct00.var_1_11 [L69] EXPR WrapperStruct00.var_1_12 [L69] WrapperStruct00.var_1_10 = (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)) [L77] WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L77] COND TRUE WrapperStruct00.var_1_13 [L78] EXPR WrapperStruct00.var_1_10 [L78] EXPR WrapperStruct00.var_1_22 VAL [WrapperStruct00={4:0}, isInitial=1] [L78] COND FALSE !(WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) [L85] WrapperStruct00.var_1_1 = 8 VAL [WrapperStruct00={4:0}, isInitial=1] [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1 [L120] EXPR WrapperStruct00.var_1_10 [L120] EXPR WrapperStruct00.var_1_22 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8)) [L120] EXPR WrapperStruct00.var_1_1 [L120] EXPR (WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1)) [L120] EXPR WrapperStruct00.var_1_18 [L120] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1) [L120] EXPR WrapperStruct00.var_1_10 [L120] EXPR WrapperStruct00.var_1_11 [L120] EXPR WrapperStruct00.var_1_12 [L120] EXPR (WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR ((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15)))) [L120] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))) [L120] EXPR WrapperStruct00.var_1_13 [L120] EXPR WrapperStruct00.var_1_15 [L120] EXPR WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16 [L120] EXPR WrapperStruct00.var_1_16 [L120] EXPR WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR ((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19)) [L120] EXPR WrapperStruct00.var_1_18 [L120] EXPR WrapperStruct00.var_1_19 [L120] EXPR (((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR ((((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21)) [L120] EXPR WrapperStruct00.var_1_20 [L120] EXPR WrapperStruct00.var_1_21 [L120] EXPR ((((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (((((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21))) && (WrapperStruct00.var_1_22 == ((signed short int) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120-L121] return (((((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21))) && (WrapperStruct00.var_1_22 == ((signed short int) WrapperStruct00.var_1_12)) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.3s, OverallIterations: 24, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4084 SdHoareTripleChecker+Valid, 9.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4042 mSDsluCounter, 12600 SdHoareTripleChecker+Invalid, 8.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9374 mSDsCounter, 1090 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8708 IncrementalHoareTripleChecker+Invalid, 9798 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1090 mSolverCounterUnsat, 3226 mSDtfsCounter, 8708 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2202 GetRequests, 1962 SyntacticMatches, 19 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=422occurred in iteration=22, InterpolantAutomatonStates: 199, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 1930 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 17.2s InterpolantComputationTime, 4000 NumberOfCodeBlocks, 4000 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 4238 ConstructedInterpolants, 0 QuantifiedInterpolants, 13386 SizeOfPredicates, 25 NumberOfNonLiveVariables, 2524 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 31 InterpolantComputations, 20 PerfectInterpolantSequences, 16684/16864 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 07:48:21,698 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-97.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 e67445e12651560afd9610d5a103069fc2fc9d028994dc4bd874cfab54748c3d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:48:23,919 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:48:23,997 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 07:48:24,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:48:24,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:48:24,026 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:48:24,027 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:48:24,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:48:24,028 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:48:24,029 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:48:24,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:48:24,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:48:24,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:48:24,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:48:24,031 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:48:24,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:48:24,032 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:48:24,032 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:48:24,032 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:48:24,033 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:48:24,033 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:48:24,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:48:24,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:48:24,037 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 07:48:24,038 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 07:48:24,041 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:48:24,041 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 07:48:24,042 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:48:24,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:48:24,042 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:48:24,043 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:48:24,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:48:24,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:48:24,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:48:24,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:48:24,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:48:24,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:48:24,047 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:48:24,048 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 07:48:24,048 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 07:48:24,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:48:24,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:48:24,049 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:48:24,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:48:24,049 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 -> e67445e12651560afd9610d5a103069fc2fc9d028994dc4bd874cfab54748c3d [2024-11-12 07:48:24,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:48:24,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:48:24,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:48:24,404 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:48:24,405 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:48:24,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-97.i [2024-11-12 07:48:26,007 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:48:26,265 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:48:26,265 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-97.i [2024-11-12 07:48:26,281 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8194938e9/5a1dfa87cf754b668da23a507ef95b99/FLAGbe18590f9 [2024-11-12 07:48:26,635 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8194938e9/5a1dfa87cf754b668da23a507ef95b99 [2024-11-12 07:48:26,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:48:26,639 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:48:26,640 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:48:26,640 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:48:26,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:48:26,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:48:26" (1/1) ... [2024-11-12 07:48:26,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f0b7559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:48:26, skipping insertion in model container [2024-11-12 07:48:26,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:48:26" (1/1) ... [2024-11-12 07:48:26,674 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:48:26,855 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-97.i[916,929] [2024-11-12 07:48:26,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:48:26,957 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:48:26,968 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-97.i[916,929] [2024-11-12 07:48:27,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:48:27,053 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:48:27,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:48:27 WrapperNode [2024-11-12 07:48:27,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:48:27,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:48:27,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:48:27,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:48:27,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:48:27" (1/1) ... [2024-11-12 07:48:27,083 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:48:27" (1/1) ... [2024-11-12 07:48:27,124 INFO L138 Inliner]: procedures = 34, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 408 [2024-11-12 07:48:27,125 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:48:27,125 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:48:27,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:48:27,126 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:48:27,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:48:27" (1/1) ... [2024-11-12 07:48:27,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:48:27" (1/1) ... [2024-11-12 07:48:27,152 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:48:27" (1/1) ... [2024-11-12 07:48:27,186 INFO L175 MemorySlicer]: Split 117 memory accesses to 2 slices as follows [2, 115]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 35 writes are split as follows [0, 35]. [2024-11-12 07:48:27,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:48:27" (1/1) ... [2024-11-12 07:48:27,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:48:27" (1/1) ... [2024-11-12 07:48:27,210 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:48:27" (1/1) ... [2024-11-12 07:48:27,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:48:27" (1/1) ... [2024-11-12 07:48:27,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:48:27" (1/1) ... [2024-11-12 07:48:27,220 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:48:27" (1/1) ... [2024-11-12 07:48:27,225 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:48:27,226 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:48:27,226 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:48:27,226 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:48:27,227 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:48:27" (1/1) ... [2024-11-12 07:48:27,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:48:27,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:48:27,272 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 07:48:27,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 07:48:27,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:48:27,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 07:48:27,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 07:48:27,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 07:48:27,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 07:48:27,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-12 07:48:27,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-12 07:48:27,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-12 07:48:27,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-12 07:48:27,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-12 07:48:27,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-12 07:48:27,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-12 07:48:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-12 07:48:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-12 07:48:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-12 07:48:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:48:27,334 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:48:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-12 07:48:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-12 07:48:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:48:27,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:48:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-12 07:48:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-12 07:48:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-12 07:48:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-12 07:48:27,487 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:48:27,489 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:48:28,100 INFO L? ?]: Removed 80 outVars from TransFormulas that were not future-live. [2024-11-12 07:48:28,100 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:48:28,120 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:48:28,120 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:48:28,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:48:28 BoogieIcfgContainer [2024-11-12 07:48:28,121 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:48:28,123 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:48:28,124 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:48:28,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:48:28,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:48:26" (1/3) ... [2024-11-12 07:48:28,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ddeee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:48:28, skipping insertion in model container [2024-11-12 07:48:28,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:48:27" (2/3) ... [2024-11-12 07:48:28,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ddeee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:48:28, skipping insertion in model container [2024-11-12 07:48:28,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:48:28" (3/3) ... [2024-11-12 07:48:28,131 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-97.i [2024-11-12 07:48:28,144 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:48:28,144 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:48:28,215 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:48:28,223 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;@560869ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:48:28,223 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:48:28,227 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 80 states have (on average 1.3875) internal successors, (111), 81 states have internal predecessors, (111), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:48:28,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-12 07:48:28,242 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:48:28,243 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:48:28,244 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:48:28,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:48:28,252 INFO L85 PathProgramCache]: Analyzing trace with hash 993834081, now seen corresponding path program 1 times [2024-11-12 07:48:28,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:48:28,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533020228] [2024-11-12 07:48:28,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:28,268 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-11-12 07:48:28,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:48:28,272 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-11-12 07:48:28,273 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-11-12 07:48:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:28,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 07:48:28,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:48:28,722 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-12 07:48:28,722 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:48:28,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:48:28,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533020228] [2024-11-12 07:48:28,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [533020228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:48:28,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:48:28,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:48:28,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754503903] [2024-11-12 07:48:28,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:48:28,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:48:28,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:48:28,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:48:28,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:48:28,765 INFO L87 Difference]: Start difference. First operand has 100 states, 80 states have (on average 1.3875) internal successors, (111), 81 states have internal predecessors, (111), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:48:28,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:48:28,810 INFO L93 Difference]: Finished difference Result 193 states and 301 transitions. [2024-11-12 07:48:28,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:48:28,812 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2024-11-12 07:48:28,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:48:28,820 INFO L225 Difference]: With dead ends: 193 [2024-11-12 07:48:28,820 INFO L226 Difference]: Without dead ends: 96 [2024-11-12 07:48:28,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:48:28,828 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:48:28,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:48:28,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-12 07:48:28,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-12 07:48:28,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:48:28,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-12 07:48:28,870 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 134 [2024-11-12 07:48:28,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:48:28,871 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-12 07:48:28,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:48:28,871 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-12 07:48:28,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-12 07:48:28,874 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:48:28,875 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:48:28,881 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-11-12 07:48:29,075 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-11-12 07:48:29,076 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:48:29,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:48:29,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1139851071, now seen corresponding path program 1 times [2024-11-12 07:48:29,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:48:29,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647537188] [2024-11-12 07:48:29,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:29,078 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-11-12 07:48:29,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:48:29,081 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-11-12 07:48:29,082 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-11-12 07:48:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:29,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:48:29,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:48:29,421 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:48:29,421 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:48:29,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:48:29,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647537188] [2024-11-12 07:48:29,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647537188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:48:29,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:48:29,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:48:29,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707913105] [2024-11-12 07:48:29,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:48:29,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:48:29,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:48:29,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:48:29,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:48:29,425 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:29,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:48:29,486 INFO L93 Difference]: Finished difference Result 191 states and 276 transitions. [2024-11-12 07:48:29,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:48:29,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-11-12 07:48:29,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:48:29,491 INFO L225 Difference]: With dead ends: 191 [2024-11-12 07:48:29,491 INFO L226 Difference]: Without dead ends: 98 [2024-11-12 07:48:29,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:48:29,493 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:48:29,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:48:29,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-12 07:48:29,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-12 07:48:29,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 79 states have internal predecessors, (106), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:48:29,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-12 07:48:29,516 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 134 [2024-11-12 07:48:29,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:48:29,517 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-12 07:48:29,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:29,518 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-12 07:48:29,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:48:29,522 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:48:29,522 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:48:29,533 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-11-12 07:48:29,722 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-11-12 07:48:29,723 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:48:29,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:48:29,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1830527183, now seen corresponding path program 1 times [2024-11-12 07:48:29,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:48:29,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799217432] [2024-11-12 07:48:29,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:29,725 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-11-12 07:48:29,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:48:29,728 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-11-12 07:48:29,731 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-11-12 07:48:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:29,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 07:48:29,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:48:30,052 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:48:30,052 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:48:30,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:48:30,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1799217432] [2024-11-12 07:48:30,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1799217432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:48:30,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:48:30,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:48:30,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903343126] [2024-11-12 07:48:30,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:48:30,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:48:30,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:48:30,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:48:30,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:48:30,061 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:30,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:48:30,686 INFO L93 Difference]: Finished difference Result 274 states and 391 transitions. [2024-11-12 07:48:30,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:48:30,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-12 07:48:30,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:48:30,689 INFO L225 Difference]: With dead ends: 274 [2024-11-12 07:48:30,689 INFO L226 Difference]: Without dead ends: 179 [2024-11-12 07:48:30,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:48:30,691 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 101 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:48:30,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 500 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:48:30,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-12 07:48:30,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 100. [2024-11-12 07:48:30,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 81 states have internal predecessors, (108), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:48:30,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-11-12 07:48:30,713 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 136 [2024-11-12 07:48:30,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:48:30,714 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-11-12 07:48:30,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:30,714 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-11-12 07:48:30,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:48:30,718 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:48:30,719 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:48:30,730 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-11-12 07:48:30,919 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-11-12 07:48:30,920 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:48:30,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:48:30,921 INFO L85 PathProgramCache]: Analyzing trace with hash -904263942, now seen corresponding path program 1 times [2024-11-12 07:48:30,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:48:30,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058364859] [2024-11-12 07:48:30,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:30,922 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-11-12 07:48:30,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:48:30,924 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-11-12 07:48:30,924 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-11-12 07:48:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:31,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:48:31,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:48:31,217 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:48:31,220 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:48:31,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:48:31,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058364859] [2024-11-12 07:48:31,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058364859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:48:31,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:48:31,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:48:31,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017674335] [2024-11-12 07:48:31,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:48:31,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:48:31,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:48:31,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:48:31,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:48:31,223 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:31,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:48:31,251 INFO L93 Difference]: Finished difference Result 200 states and 285 transitions. [2024-11-12 07:48:31,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:48:31,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-12 07:48:31,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:48:31,254 INFO L225 Difference]: With dead ends: 200 [2024-11-12 07:48:31,254 INFO L226 Difference]: Without dead ends: 103 [2024-11-12 07:48:31,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:48:31,256 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:48:31,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 394 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:48:31,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-12 07:48:31,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-11-12 07:48:31,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 83 states have internal predecessors, (110), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:48:31,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2024-11-12 07:48:31,264 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 136 [2024-11-12 07:48:31,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:48:31,265 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2024-11-12 07:48:31,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:31,265 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2024-11-12 07:48:31,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:48:31,267 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:48:31,267 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:48:31,280 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-12 07:48:31,467 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-11-12 07:48:31,468 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:48:31,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:48:31,468 INFO L85 PathProgramCache]: Analyzing trace with hash -224205572, now seen corresponding path program 1 times [2024-11-12 07:48:31,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:48:31,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537320186] [2024-11-12 07:48:31,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:31,469 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-11-12 07:48:31,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:48:31,472 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-11-12 07:48:31,474 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-11-12 07:48:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:31,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 07:48:31,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:48:31,705 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:48:31,705 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:48:31,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:48:31,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537320186] [2024-11-12 07:48:31,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537320186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:48:31,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:48:31,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:48:31,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93001595] [2024-11-12 07:48:31,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:48:31,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:48:31,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:48:31,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:48:31,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:48:31,707 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:31,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:48:31,749 INFO L93 Difference]: Finished difference Result 204 states and 289 transitions. [2024-11-12 07:48:31,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:48:31,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-12 07:48:31,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:48:31,754 INFO L225 Difference]: With dead ends: 204 [2024-11-12 07:48:31,754 INFO L226 Difference]: Without dead ends: 105 [2024-11-12 07:48:31,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:48:31,756 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:48:31,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 517 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:48:31,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-12 07:48:31,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-12 07:48:31,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.3176470588235294) internal successors, (112), 85 states have internal predecessors, (112), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:48:31,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2024-11-12 07:48:31,764 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 136 [2024-11-12 07:48:31,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:48:31,764 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2024-11-12 07:48:31,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:31,765 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2024-11-12 07:48:31,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:48:31,766 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:48:31,766 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:48:31,775 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-11-12 07:48:31,967 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-11-12 07:48:31,968 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:48:31,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:48:31,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1550801790, now seen corresponding path program 1 times [2024-11-12 07:48:31,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:48:31,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809446762] [2024-11-12 07:48:31,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:31,969 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-11-12 07:48:31,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:48:31,972 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-11-12 07:48:31,974 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-11-12 07:48:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:32,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 07:48:32,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:48:32,221 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:48:32,221 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:48:32,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:48:32,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809446762] [2024-11-12 07:48:32,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809446762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:48:32,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:48:32,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:48:32,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469567255] [2024-11-12 07:48:32,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:48:32,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:48:32,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:48:32,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:48:32,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:48:32,224 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:32,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:48:32,279 INFO L93 Difference]: Finished difference Result 208 states and 293 transitions. [2024-11-12 07:48:32,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:48:32,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-12 07:48:32,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:48:32,282 INFO L225 Difference]: With dead ends: 208 [2024-11-12 07:48:32,282 INFO L226 Difference]: Without dead ends: 107 [2024-11-12 07:48:32,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:48:32,285 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:48:32,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 640 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:48:32,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-12 07:48:32,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2024-11-12 07:48:32,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 87 states have internal predecessors, (114), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:48:32,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 148 transitions. [2024-11-12 07:48:32,300 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 148 transitions. Word has length 136 [2024-11-12 07:48:32,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:48:32,301 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 148 transitions. [2024-11-12 07:48:32,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:32,301 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 148 transitions. [2024-11-12 07:48:32,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:48:32,302 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:48:32,302 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:48:32,311 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 (7)] Ended with exit code 0 [2024-11-12 07:48:32,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-11-12 07:48:32,507 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:48:32,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:48:32,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1552648832, now seen corresponding path program 1 times [2024-11-12 07:48:32,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:48:32,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391407921] [2024-11-12 07:48:32,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:32,508 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-11-12 07:48:32,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:48:32,510 INFO L229 MonitoredProcess]: Starting monitored process 8 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-11-12 07:48:32,511 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 (8)] Waiting until timeout for monitored process [2024-11-12 07:48:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:32,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-12 07:48:32,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:48:32,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 07:48:32,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2024-11-12 07:48:33,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2024-11-12 07:48:33,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:48:33,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 61 [2024-11-12 07:48:33,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:48:33,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 77 [2024-11-12 07:48:33,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:48:33,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 87 treesize of output 80 [2024-11-12 07:48:33,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:48:33,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 30 [2024-11-12 07:48:33,557 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 238 proven. 18 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-12 07:48:33,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:48:33,981 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 72 proven. 18 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2024-11-12 07:48:33,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:48:33,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391407921] [2024-11-12 07:48:33,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391407921] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 07:48:33,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:48:33,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2024-11-12 07:48:33,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493555982] [2024-11-12 07:48:33,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 07:48:33,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-12 07:48:33,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:48:33,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-12 07:48:33,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2024-11-12 07:48:33,986 INFO L87 Difference]: Start difference. First operand 106 states and 148 transitions. Second operand has 21 states, 17 states have (on average 4.882352941176471) internal successors, (83), 21 states have internal predecessors, (83), 7 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 3 states have call predecessors, (22), 7 states have call successors, (22) [2024-11-12 07:48:37,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:48:37,396 INFO L93 Difference]: Finished difference Result 358 states and 486 transitions. [2024-11-12 07:48:37,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-12 07:48:37,397 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 4.882352941176471) internal successors, (83), 21 states have internal predecessors, (83), 7 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 3 states have call predecessors, (22), 7 states have call successors, (22) Word has length 136 [2024-11-12 07:48:37,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:48:37,399 INFO L225 Difference]: With dead ends: 358 [2024-11-12 07:48:37,399 INFO L226 Difference]: Without dead ends: 255 [2024-11-12 07:48:37,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=406, Invalid=1664, Unknown=0, NotChecked=0, Total=2070 [2024-11-12 07:48:37,401 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 584 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:48:37,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 886 Invalid, 1848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 1519 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-12 07:48:37,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-12 07:48:37,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 240. [2024-11-12 07:48:37,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 189 states have (on average 1.2645502645502646) internal successors, (239), 191 states have internal predecessors, (239), 42 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-12 07:48:37,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 323 transitions. [2024-11-12 07:48:37,427 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 323 transitions. Word has length 136 [2024-11-12 07:48:37,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:48:37,428 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 323 transitions. [2024-11-12 07:48:37,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 4.882352941176471) internal successors, (83), 21 states have internal predecessors, (83), 7 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 3 states have call predecessors, (22), 7 states have call successors, (22) [2024-11-12 07:48:37,428 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 323 transitions. [2024-11-12 07:48:37,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:48:37,430 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:48:37,430 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:48:37,440 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 (8)] Ended with exit code 0 [2024-11-12 07:48:37,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-11-12 07:48:37,631 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:48:37,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:48:37,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1418635326, now seen corresponding path program 1 times [2024-11-12 07:48:37,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:48:37,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289138046] [2024-11-12 07:48:37,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:37,632 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-11-12 07:48:37,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:48:37,635 INFO L229 MonitoredProcess]: Starting monitored process 9 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-11-12 07:48:37,636 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 (9)] Waiting until timeout for monitored process [2024-11-12 07:48:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:37,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-12 07:48:37,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:48:37,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-12 07:48:38,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 24 [2024-11-12 07:48:38,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 24 [2024-11-12 07:48:38,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 24 [2024-11-12 07:48:38,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:48:38,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 65 [2024-11-12 07:48:38,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:48:38,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 95 treesize of output 41 [2024-11-12 07:48:38,805 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 294 proven. 30 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:48:38,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:48:39,110 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 60 proven. 30 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2024-11-12 07:48:39,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:48:39,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289138046] [2024-11-12 07:48:39,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289138046] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 07:48:39,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:48:39,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2024-11-12 07:48:39,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573485592] [2024-11-12 07:48:39,111 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 07:48:39,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 07:48:39,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:48:39,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 07:48:39,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-11-12 07:48:39,113 INFO L87 Difference]: Start difference. First operand 240 states and 323 transitions. Second operand has 18 states, 14 states have (on average 5.642857142857143) internal successors, (79), 16 states have internal predecessors, (79), 7 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 7 states have call successors, (24) [2024-11-12 07:48:41,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:48:41,049 INFO L93 Difference]: Finished difference Result 484 states and 640 transitions. [2024-11-12 07:48:41,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 07:48:41,050 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 5.642857142857143) internal successors, (79), 16 states have internal predecessors, (79), 7 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 7 states have call successors, (24) Word has length 136 [2024-11-12 07:48:41,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:48:41,054 INFO L225 Difference]: With dead ends: 484 [2024-11-12 07:48:41,055 INFO L226 Difference]: Without dead ends: 264 [2024-11-12 07:48:41,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 252 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2024-11-12 07:48:41,056 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 128 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:48:41,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 412 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-12 07:48:41,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-12 07:48:41,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 259. [2024-11-12 07:48:41,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 202 states have (on average 1.2425742574257426) internal successors, (251), 204 states have internal predecessors, (251), 44 states have call successors, (44), 12 states have call predecessors, (44), 12 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-12 07:48:41,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 339 transitions. [2024-11-12 07:48:41,113 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 339 transitions. Word has length 136 [2024-11-12 07:48:41,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:48:41,114 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 339 transitions. [2024-11-12 07:48:41,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 5.642857142857143) internal successors, (79), 16 states have internal predecessors, (79), 7 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 7 states have call successors, (24) [2024-11-12 07:48:41,114 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 339 transitions. [2024-11-12 07:48:41,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:48:41,117 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:48:41,117 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:48:41,129 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 (9)] Ended with exit code 0 [2024-11-12 07:48:41,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-11-12 07:48:41,318 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:48:41,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:48:41,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1913505383, now seen corresponding path program 1 times [2024-11-12 07:48:41,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:48:41,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794434463] [2024-11-12 07:48:41,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:41,319 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-11-12 07:48:41,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:48:41,320 INFO L229 MonitoredProcess]: Starting monitored process 10 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-11-12 07:48:41,321 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 (10)] Waiting until timeout for monitored process [2024-11-12 07:48:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:41,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-12 07:48:41,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:48:41,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-12 07:48:41,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2024-11-12 07:48:42,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:48:42,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 47 [2024-11-12 07:48:42,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:48:42,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 50 [2024-11-12 07:48:42,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:48:42,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 82 [2024-11-12 07:48:42,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:48:42,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 75 treesize of output 89 [2024-11-12 07:48:42,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:48:42,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 90 treesize of output 92 [2024-11-12 07:48:42,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:48:42,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 81 treesize of output 33 [2024-11-12 07:48:42,944 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 318 proven. 30 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-12 07:48:42,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:48:43,312 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 60 proven. 30 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2024-11-12 07:48:43,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:48:43,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794434463] [2024-11-12 07:48:43,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794434463] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 07:48:43,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:48:43,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 25 [2024-11-12 07:48:43,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079612341] [2024-11-12 07:48:43,313 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 07:48:43,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-12 07:48:43,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:48:43,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-12 07:48:43,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2024-11-12 07:48:43,315 INFO L87 Difference]: Start difference. First operand 259 states and 339 transitions. Second operand has 25 states, 21 states have (on average 4.190476190476191) internal successors, (88), 22 states have internal predecessors, (88), 8 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 6 states have call predecessors, (24), 8 states have call successors, (24) [2024-11-12 07:48:47,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:48:47,193 INFO L93 Difference]: Finished difference Result 546 states and 702 transitions. [2024-11-12 07:48:47,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-12 07:48:47,194 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 4.190476190476191) internal successors, (88), 22 states have internal predecessors, (88), 8 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 6 states have call predecessors, (24), 8 states have call successors, (24) Word has length 136 [2024-11-12 07:48:47,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:48:47,196 INFO L225 Difference]: With dead ends: 546 [2024-11-12 07:48:47,196 INFO L226 Difference]: Without dead ends: 311 [2024-11-12 07:48:47,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=665, Invalid=2415, Unknown=0, NotChecked=0, Total=3080 [2024-11-12 07:48:47,198 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 422 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:48:47,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 945 Invalid, 1835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1663 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-12 07:48:47,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-12 07:48:47,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 184. [2024-11-12 07:48:47,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 138 states have (on average 1.2028985507246377) internal successors, (166), 139 states have internal predecessors, (166), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 07:48:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 234 transitions. [2024-11-12 07:48:47,227 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 234 transitions. Word has length 136 [2024-11-12 07:48:47,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:48:47,227 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 234 transitions. [2024-11-12 07:48:47,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 4.190476190476191) internal successors, (88), 22 states have internal predecessors, (88), 8 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 6 states have call predecessors, (24), 8 states have call successors, (24) [2024-11-12 07:48:47,229 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 234 transitions. [2024-11-12 07:48:47,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-12 07:48:47,230 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:48:47,230 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:48:47,240 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 (10)] Ended with exit code 0 [2024-11-12 07:48:47,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-11-12 07:48:47,431 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:48:47,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:48:47,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1858789075, now seen corresponding path program 1 times [2024-11-12 07:48:47,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:48:47,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847132265] [2024-11-12 07:48:47,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:47,432 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-11-12 07:48:47,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:48:47,433 INFO L229 MonitoredProcess]: Starting monitored process 11 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-11-12 07:48:47,434 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 (11)] Waiting until timeout for monitored process [2024-11-12 07:48:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:47,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:48:47,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:48:47,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-12 07:48:47,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2024-11-12 07:48:47,666 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:48:47,667 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:48:47,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:48:47,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847132265] [2024-11-12 07:48:47,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847132265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:48:47,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:48:47,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:48:47,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653411198] [2024-11-12 07:48:47,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:48:47,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:48:47,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:48:47,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:48:47,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:48:47,668 INFO L87 Difference]: Start difference. First operand 184 states and 234 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:48,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:48:48,067 INFO L93 Difference]: Finished difference Result 429 states and 550 transitions. [2024-11-12 07:48:48,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:48:48,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2024-11-12 07:48:48,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:48:48,070 INFO L225 Difference]: With dead ends: 429 [2024-11-12 07:48:48,070 INFO L226 Difference]: Without dead ends: 308 [2024-11-12 07:48:48,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:48:48,074 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 117 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:48:48,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 717 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:48:48,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-12 07:48:48,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 188. [2024-11-12 07:48:48,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 142 states have (on average 1.2112676056338028) internal successors, (172), 143 states have internal predecessors, (172), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 07:48:48,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 240 transitions. [2024-11-12 07:48:48,105 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 240 transitions. Word has length 137 [2024-11-12 07:48:48,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:48:48,106 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 240 transitions. [2024-11-12 07:48:48,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:48:48,106 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 240 transitions. [2024-11-12 07:48:48,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-12 07:48:48,107 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:48:48,107 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:48:48,115 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 (11)] Ended with exit code 0 [2024-11-12 07:48:48,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-11-12 07:48:48,308 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:48:48,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:48:48,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1509914980, now seen corresponding path program 1 times [2024-11-12 07:48:48,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:48:48,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933599470] [2024-11-12 07:48:48,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:48:48,309 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-11-12 07:48:48,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:48:48,311 INFO L229 MonitoredProcess]: Starting monitored process 12 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-11-12 07:48:48,312 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 (12)] Waiting until timeout for monitored process [2024-11-12 07:48:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:48:48,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-12 07:48:48,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:48:48,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1