./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.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 c6dac1e5238ed53a380160bb79ff5b6b2442b7be93876c5524c1d6a035c6da2a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 13:19:43,532 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 13:19:43,597 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 13:19:43,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 13:19:43,602 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 13:19:43,623 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 13:19:43,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 13:19:43,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 13:19:43,624 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 13:19:43,625 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 13:19:43,626 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 13:19:43,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 13:19:43,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 13:19:43,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 13:19:43,629 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 13:19:43,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 13:19:43,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 13:19:43,629 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 13:19:43,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 13:19:43,630 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 13:19:43,630 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 13:19:43,630 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 13:19:43,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 13:19:43,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 13:19:43,631 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 13:19:43,631 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 13:19:43,631 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 13:19:43,631 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 13:19:43,631 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 13:19:43,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 13:19:43,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 13:19:43,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 13:19:43,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:19:43,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 13:19:43,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 13:19:43,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 13:19:43,632 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 13:19:43,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 13:19:43,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 13:19:43,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 13:19:43,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 13:19:43,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 13:19:43,634 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 -> c6dac1e5238ed53a380160bb79ff5b6b2442b7be93876c5524c1d6a035c6da2a [2024-11-22 13:19:43,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 13:19:43,868 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 13:19:43,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 13:19:43,872 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 13:19:43,872 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 13:19:43,873 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i [2024-11-22 13:19:45,112 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 13:19:45,266 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 13:19:45,269 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i [2024-11-22 13:19:45,278 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/811a124d6/3a6e11f27f1841b88fb22b4b75e49cf6/FLAG42ae807f6 [2024-11-22 13:19:45,289 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/811a124d6/3a6e11f27f1841b88fb22b4b75e49cf6 [2024-11-22 13:19:45,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 13:19:45,292 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 13:19:45,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 13:19:45,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 13:19:45,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 13:19:45,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:19:45" (1/1) ... [2024-11-22 13:19:45,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59c7c656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:45, skipping insertion in model container [2024-11-22 13:19:45,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:19:45" (1/1) ... [2024-11-22 13:19:45,323 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 13:19:45,460 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-sp_file-61.i[917,930] [2024-11-22 13:19:45,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:19:45,556 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 13:19:45,567 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-sp_file-61.i[917,930] [2024-11-22 13:19:45,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:19:45,626 INFO L204 MainTranslator]: Completed translation [2024-11-22 13:19:45,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:45 WrapperNode [2024-11-22 13:19:45,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 13:19:45,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 13:19:45,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 13:19:45,628 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 13:19:45,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:45" (1/1) ... [2024-11-22 13:19:45,642 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:45" (1/1) ... [2024-11-22 13:19:45,673 INFO L138 Inliner]: procedures = 30, calls = 184, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 524 [2024-11-22 13:19:45,674 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 13:19:45,674 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 13:19:45,674 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 13:19:45,674 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 13:19:45,686 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:45" (1/1) ... [2024-11-22 13:19:45,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:45" (1/1) ... [2024-11-22 13:19:45,691 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:45" (1/1) ... [2024-11-22 13:19:45,698 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-22 13:19:45,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:45" (1/1) ... [2024-11-22 13:19:45,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:45" (1/1) ... [2024-11-22 13:19:45,710 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:45" (1/1) ... [2024-11-22 13:19:45,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:45" (1/1) ... [2024-11-22 13:19:45,721 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:45" (1/1) ... [2024-11-22 13:19:45,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:45" (1/1) ... [2024-11-22 13:19:45,727 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 13:19:45,728 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 13:19:45,728 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 13:19:45,728 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 13:19:45,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:45" (1/1) ... [2024-11-22 13:19:45,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:19:45,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:19:45,766 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-22 13:19:45,768 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-22 13:19:45,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 13:19:45,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-22 13:19:45,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-22 13:19:45,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-22 13:19:45,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-22 13:19:45,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-22 13:19:45,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-22 13:19:45,812 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 13:19:45,812 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 13:19:45,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-22 13:19:45,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 13:19:45,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 13:19:45,932 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 13:19:45,933 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 13:19:46,705 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2024-11-22 13:19:46,706 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 13:19:46,717 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 13:19:46,717 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 13:19:46,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:19:46 BoogieIcfgContainer [2024-11-22 13:19:46,717 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 13:19:46,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 13:19:46,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 13:19:46,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 13:19:46,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:19:45" (1/3) ... [2024-11-22 13:19:46,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce4d8da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:19:46, skipping insertion in model container [2024-11-22 13:19:46,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:45" (2/3) ... [2024-11-22 13:19:46,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce4d8da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:19:46, skipping insertion in model container [2024-11-22 13:19:46,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:19:46" (3/3) ... [2024-11-22 13:19:46,726 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-61.i [2024-11-22 13:19:46,742 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 13:19:46,742 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 13:19:46,795 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 13:19:46,800 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;@28ec088a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 13:19:46,801 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 13:19:46,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 92 states have (on average 1.358695652173913) internal successors, (125), 93 states have internal predecessors, (125), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-22 13:19:46,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-22 13:19:46,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:19:46,821 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:19:46,822 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:19:46,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:19:46,827 INFO L85 PathProgramCache]: Analyzing trace with hash 686700268, now seen corresponding path program 1 times [2024-11-22 13:19:46,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:19:46,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544730028] [2024-11-22 13:19:46,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:19:46,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:19:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:19:47,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2024-11-22 13:19:47,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:19:47,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544730028] [2024-11-22 13:19:47,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544730028] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:19:47,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513347877] [2024-11-22 13:19:47,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:19:47,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:19:47,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:19:47,234 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-22 13:19:47,236 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-22 13:19:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:19:47,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 13:19:47,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:19:47,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2024-11-22 13:19:47,523 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:19:47,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513347877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:19:47,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:19:47,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 13:19:47,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445924343] [2024-11-22 13:19:47,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:19:47,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 13:19:47,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:19:47,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 13:19:47,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 13:19:47,555 INFO L87 Difference]: Start difference. First operand has 120 states, 92 states have (on average 1.358695652173913) internal successors, (125), 93 states have internal predecessors, (125), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-22 13:19:47,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:19:47,579 INFO L93 Difference]: Finished difference Result 233 states and 369 transitions. [2024-11-22 13:19:47,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 13:19:47,580 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 190 [2024-11-22 13:19:47,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:19:47,585 INFO L225 Difference]: With dead ends: 233 [2024-11-22 13:19:47,585 INFO L226 Difference]: Without dead ends: 116 [2024-11-22 13:19:47,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 191 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-22 13:19:47,590 INFO L432 NwaCegarLoop]: 168 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, 168 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-22 13:19:47,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:19:47,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-22 13:19:47,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-22 13:19:47,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-22 13:19:47,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2024-11-22 13:19:47,626 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 190 [2024-11-22 13:19:47,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:19:47,626 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2024-11-22 13:19:47,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-22 13:19:47,627 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2024-11-22 13:19:47,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-22 13:19:47,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:19:47,630 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:19:47,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 13:19:47,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 13:19:47,831 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:19:47,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:19:47,832 INFO L85 PathProgramCache]: Analyzing trace with hash 326820314, now seen corresponding path program 1 times [2024-11-22 13:19:47,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:19:47,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970555992] [2024-11-22 13:19:47,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:19:47,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:19:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:19:48,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-22 13:19:48,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:19:48,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970555992] [2024-11-22 13:19:48,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970555992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:19:48,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:19:48,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:19:48,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867326272] [2024-11-22 13:19:48,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:19:48,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:19:48,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:19:48,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:19:48,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:19:48,192 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-22 13:19:48,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:19:48,230 INFO L93 Difference]: Finished difference Result 232 states and 337 transitions. [2024-11-22 13:19:48,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:19:48,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2024-11-22 13:19:48,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:19:48,235 INFO L225 Difference]: With dead ends: 232 [2024-11-22 13:19:48,237 INFO L226 Difference]: Without dead ends: 119 [2024-11-22 13:19:48,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-22 13:19:48,238 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 485 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-22 13:19:48,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 485 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:19:48,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-22 13:19:48,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-22 13:19:48,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 91 states have internal predecessors, (120), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-22 13:19:48,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 170 transitions. [2024-11-22 13:19:48,258 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 170 transitions. Word has length 190 [2024-11-22 13:19:48,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:19:48,259 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 170 transitions. [2024-11-22 13:19:48,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-22 13:19:48,259 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2024-11-22 13:19:48,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-22 13:19:48,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:19:48,264 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:19:48,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 13:19:48,264 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:19:48,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:19:48,265 INFO L85 PathProgramCache]: Analyzing trace with hash 2101827676, now seen corresponding path program 1 times [2024-11-22 13:19:48,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:19:48,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185613531] [2024-11-22 13:19:48,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:19:48,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:19:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:19:48,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-22 13:19:48,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:19:48,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185613531] [2024-11-22 13:19:48,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185613531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:19:48,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:19:48,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:19:48,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335957570] [2024-11-22 13:19:48,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:19:48,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:19:48,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:19:48,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:19:48,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:19:48,470 INFO L87 Difference]: Start difference. First operand 118 states and 170 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-22 13:19:48,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:19:48,500 INFO L93 Difference]: Finished difference Result 236 states and 341 transitions. [2024-11-22 13:19:48,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:19:48,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2024-11-22 13:19:48,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:19:48,502 INFO L225 Difference]: With dead ends: 236 [2024-11-22 13:19:48,502 INFO L226 Difference]: Without dead ends: 121 [2024-11-22 13:19:48,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-22 13:19:48,505 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 487 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-22 13:19:48,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:19:48,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-22 13:19:48,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-11-22 13:19:48,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 93 states have (on average 1.3118279569892473) internal successors, (122), 93 states have internal predecessors, (122), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-22 13:19:48,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 172 transitions. [2024-11-22 13:19:48,519 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 172 transitions. Word has length 190 [2024-11-22 13:19:48,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:19:48,520 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 172 transitions. [2024-11-22 13:19:48,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-22 13:19:48,520 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 172 transitions. [2024-11-22 13:19:48,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-22 13:19:48,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:19:48,524 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:19:48,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 13:19:48,525 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:19:48,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:19:48,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2103674718, now seen corresponding path program 1 times [2024-11-22 13:19:48,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:19:48,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872843860] [2024-11-22 13:19:48,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:19:48,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:19:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:19:48,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-22 13:19:48,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:19:48,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872843860] [2024-11-22 13:19:48,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872843860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:19:48,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:19:48,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:19:48,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721547436] [2024-11-22 13:19:48,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:19:48,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:19:48,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:19:48,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:19:48,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:19:48,799 INFO L87 Difference]: Start difference. First operand 120 states and 172 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-22 13:19:48,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:19:48,827 INFO L93 Difference]: Finished difference Result 239 states and 344 transitions. [2024-11-22 13:19:48,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:19:48,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2024-11-22 13:19:48,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:19:48,830 INFO L225 Difference]: With dead ends: 239 [2024-11-22 13:19:48,831 INFO L226 Difference]: Without dead ends: 122 [2024-11-22 13:19:48,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-22 13:19:48,832 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:19:48,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 490 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:19:48,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-22 13:19:48,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-22 13:19:48,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 95 states have (on average 1.305263157894737) internal successors, (124), 95 states have internal predecessors, (124), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-22 13:19:48,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 174 transitions. [2024-11-22 13:19:48,844 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 174 transitions. Word has length 190 [2024-11-22 13:19:48,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:19:48,845 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 174 transitions. [2024-11-22 13:19:48,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-22 13:19:48,846 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 174 transitions. [2024-11-22 13:19:48,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-22 13:19:48,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:19:48,847 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:19:48,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 13:19:48,848 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:19:48,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:19:48,848 INFO L85 PathProgramCache]: Analyzing trace with hash 180446684, now seen corresponding path program 1 times [2024-11-22 13:19:48,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:19:48,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063805797] [2024-11-22 13:19:48,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:19:48,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:19:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:19:50,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-22 13:19:50,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:19:50,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063805797] [2024-11-22 13:19:50,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063805797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:19:50,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:19:50,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:19:50,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647686118] [2024-11-22 13:19:50,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:19:50,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 13:19:50,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:19:50,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 13:19:50,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:19:50,994 INFO L87 Difference]: Start difference. First operand 122 states and 174 transitions. Second operand has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-22 13:19:51,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:19:51,489 INFO L93 Difference]: Finished difference Result 260 states and 369 transitions. [2024-11-22 13:19:51,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:19:51,489 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) Word has length 190 [2024-11-22 13:19:51,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:19:51,491 INFO L225 Difference]: With dead ends: 260 [2024-11-22 13:19:51,491 INFO L226 Difference]: Without dead ends: 141 [2024-11-22 13:19:51,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-22 13:19:51,492 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 241 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 13:19:51,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 412 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 13:19:51,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-22 13:19:51,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2024-11-22 13:19:51,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 105 states have (on average 1.276190476190476) internal successors, (134), 106 states have internal predecessors, (134), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-22 13:19:51,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 192 transitions. [2024-11-22 13:19:51,507 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 192 transitions. Word has length 190 [2024-11-22 13:19:51,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:19:51,507 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 192 transitions. [2024-11-22 13:19:51,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-22 13:19:51,508 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 192 transitions. [2024-11-22 13:19:51,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-22 13:19:51,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:19:51,510 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:19:51,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 13:19:51,510 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:19:51,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:19:51,512 INFO L85 PathProgramCache]: Analyzing trace with hash -805089184, now seen corresponding path program 1 times [2024-11-22 13:19:51,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:19:51,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718716862] [2024-11-22 13:19:51,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:19:51,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:19:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:19:54,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-22 13:19:54,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:19:54,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718716862] [2024-11-22 13:19:54,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718716862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:19:54,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:19:54,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-22 13:19:54,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550877726] [2024-11-22 13:19:54,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:19:54,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 13:19:54,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:19:54,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 13:19:54,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-22 13:19:54,558 INFO L87 Difference]: Start difference. First operand 137 states and 192 transitions. Second operand has 13 states, 12 states have (on average 5.666666666666667) internal successors, (68), 13 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-22 13:19:55,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:19:55,364 INFO L93 Difference]: Finished difference Result 308 states and 436 transitions. [2024-11-22 13:19:55,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 13:19:55,364 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.666666666666667) internal successors, (68), 13 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) Word has length 190 [2024-11-22 13:19:55,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:19:55,366 INFO L225 Difference]: With dead ends: 308 [2024-11-22 13:19:55,367 INFO L226 Difference]: Without dead ends: 187 [2024-11-22 13:19:55,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2024-11-22 13:19:55,368 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 512 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 13:19:55,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 412 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 13:19:55,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-22 13:19:55,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 148. [2024-11-22 13:19:55,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 116 states have (on average 1.3017241379310345) internal successors, (151), 117 states have internal predecessors, (151), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-22 13:19:55,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 209 transitions. [2024-11-22 13:19:55,394 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 209 transitions. Word has length 190 [2024-11-22 13:19:55,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:19:55,395 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 209 transitions. [2024-11-22 13:19:55,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.666666666666667) internal successors, (68), 13 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-22 13:19:55,395 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 209 transitions. [2024-11-22 13:19:55,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-22 13:19:55,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:19:55,397 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:19:55,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 13:19:55,398 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:19:55,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:19:55,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1495733406, now seen corresponding path program 1 times [2024-11-22 13:19:55,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:19:55,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452794867] [2024-11-22 13:19:55,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:19:55,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:19:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:19:58,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-22 13:19:58,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:19:58,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452794867] [2024-11-22 13:19:58,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452794867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:19:58,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:19:58,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-22 13:19:58,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818007516] [2024-11-22 13:19:58,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:19:58,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 13:19:58,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:19:58,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 13:19:58,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-22 13:19:58,343 INFO L87 Difference]: Start difference. First operand 148 states and 209 transitions. Second operand has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 15 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-22 13:19:59,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:19:59,577 INFO L93 Difference]: Finished difference Result 378 states and 529 transitions. [2024-11-22 13:19:59,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 13:19:59,578 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 15 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) Word has length 190 [2024-11-22 13:19:59,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:19:59,580 INFO L225 Difference]: With dead ends: 378 [2024-11-22 13:19:59,580 INFO L226 Difference]: Without dead ends: 246 [2024-11-22 13:19:59,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2024-11-22 13:19:59,581 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 533 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-22 13:19:59,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 671 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-22 13:19:59,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-22 13:19:59,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 205. [2024-11-22 13:19:59,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 169 states have (on average 1.3136094674556213) internal successors, (222), 171 states have internal predecessors, (222), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-22 13:19:59,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 284 transitions. [2024-11-22 13:19:59,602 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 284 transitions. Word has length 190 [2024-11-22 13:19:59,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:19:59,603 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 284 transitions. [2024-11-22 13:19:59,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 15 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-22 13:19:59,603 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 284 transitions. [2024-11-22 13:19:59,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-22 13:19:59,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:19:59,604 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:19:59,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 13:19:59,605 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:19:59,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:19:59,605 INFO L85 PathProgramCache]: Analyzing trace with hash -904232631, now seen corresponding path program 1 times [2024-11-22 13:19:59,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:19:59,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491878687] [2024-11-22 13:19:59,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:19:59,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:19:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:20:00,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-22 13:20:00,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:20:00,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491878687] [2024-11-22 13:20:00,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491878687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:20:00,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:20:00,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 13:20:00,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254912363] [2024-11-22 13:20:00,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:20:00,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 13:20:00,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:20:00,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 13:20:00,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:20:00,100 INFO L87 Difference]: Start difference. First operand 205 states and 284 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-22 13:20:00,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:20:00,355 INFO L93 Difference]: Finished difference Result 477 states and 668 transitions. [2024-11-22 13:20:00,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:20:00,356 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2024-11-22 13:20:00,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:20:00,358 INFO L225 Difference]: With dead ends: 477 [2024-11-22 13:20:00,358 INFO L226 Difference]: Without dead ends: 292 [2024-11-22 13:20:00,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-22 13:20:00,359 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 214 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 13:20:00,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 626 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 13:20:00,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-22 13:20:00,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 216. [2024-11-22 13:20:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 180 states have (on average 1.3222222222222222) internal successors, (238), 182 states have internal predecessors, (238), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-22 13:20:00,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 300 transitions. [2024-11-22 13:20:00,396 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 300 transitions. Word has length 190 [2024-11-22 13:20:00,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:20:00,397 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 300 transitions. [2024-11-22 13:20:00,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-22 13:20:00,397 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 300 transitions. [2024-11-22 13:20:00,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-22 13:20:00,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:20:00,399 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:20:00,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 13:20:00,399 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:20:00,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:20:00,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1396589959, now seen corresponding path program 1 times [2024-11-22 13:20:00,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:20:00,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434154254] [2024-11-22 13:20:00,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:20:00,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:20:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:20:04,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-22 13:20:04,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:20:04,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434154254] [2024-11-22 13:20:04,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434154254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:20:04,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:20:04,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-22 13:20:04,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450337802] [2024-11-22 13:20:04,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:20:04,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-22 13:20:04,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:20:04,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-22 13:20:04,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-11-22 13:20:04,793 INFO L87 Difference]: Start difference. First operand 216 states and 300 transitions. Second operand has 17 states, 15 states have (on average 4.533333333333333) internal successors, (68), 17 states have internal predecessors, (68), 5 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 5 states have call successors, (25) [2024-11-22 13:20:06,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:20:06,692 INFO L93 Difference]: Finished difference Result 548 states and 760 transitions. [2024-11-22 13:20:06,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 13:20:06,692 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.533333333333333) internal successors, (68), 17 states have internal predecessors, (68), 5 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 5 states have call successors, (25) Word has length 190 [2024-11-22 13:20:06,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:20:06,694 INFO L225 Difference]: With dead ends: 548 [2024-11-22 13:20:06,694 INFO L226 Difference]: Without dead ends: 352 [2024-11-22 13:20:06,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=184, Invalid=572, Unknown=0, NotChecked=0, Total=756 [2024-11-22 13:20:06,695 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 706 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-22 13:20:06,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 919 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-22 13:20:06,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-22 13:20:06,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 271. [2024-11-22 13:20:06,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 235 states have (on average 1.348936170212766) internal successors, (317), 237 states have internal predecessors, (317), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-22 13:20:06,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 379 transitions. [2024-11-22 13:20:06,723 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 379 transitions. Word has length 190 [2024-11-22 13:20:06,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:20:06,723 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 379 transitions. [2024-11-22 13:20:06,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.533333333333333) internal successors, (68), 17 states have internal predecessors, (68), 5 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 5 states have call successors, (25) [2024-11-22 13:20:06,723 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 379 transitions. [2024-11-22 13:20:06,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-22 13:20:06,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:20:06,725 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:20:06,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 13:20:06,726 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:20:06,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:20:06,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1227791010, now seen corresponding path program 1 times [2024-11-22 13:20:06,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:20:06,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396284116] [2024-11-22 13:20:06,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:20:06,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:20:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:20:09,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-22 13:20:09,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:20:09,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396284116] [2024-11-22 13:20:09,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396284116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:20:09,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:20:09,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-22 13:20:09,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040522237] [2024-11-22 13:20:09,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:20:09,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 13:20:09,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:20:09,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 13:20:09,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-22 13:20:09,512 INFO L87 Difference]: Start difference. First operand 271 states and 379 transitions. Second operand has 14 states, 13 states have (on average 5.230769230769231) internal successors, (68), 14 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-22 13:20:10,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:20:10,199 INFO L93 Difference]: Finished difference Result 581 states and 813 transitions. [2024-11-22 13:20:10,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 13:20:10,200 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.230769230769231) internal successors, (68), 14 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) Word has length 190 [2024-11-22 13:20:10,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:20:10,202 INFO L225 Difference]: With dead ends: 581 [2024-11-22 13:20:10,202 INFO L226 Difference]: Without dead ends: 313 [2024-11-22 13:20:10,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-22 13:20:10,203 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 562 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 13:20:10,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 369 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 13:20:10,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-22 13:20:10,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 274. [2024-11-22 13:20:10,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 238 states have (on average 1.3487394957983194) internal successors, (321), 240 states have internal predecessors, (321), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-22 13:20:10,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 383 transitions. [2024-11-22 13:20:10,231 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 383 transitions. Word has length 190 [2024-11-22 13:20:10,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:20:10,231 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 383 transitions. [2024-11-22 13:20:10,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.230769230769231) internal successors, (68), 14 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-22 13:20:10,233 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 383 transitions. [2024-11-22 13:20:10,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-22 13:20:10,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:20:10,234 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:20:10,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 13:20:10,235 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:20:10,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:20:10,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1073031580, now seen corresponding path program 1 times [2024-11-22 13:20:10,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:20:10,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627913552] [2024-11-22 13:20:10,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:20:10,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:20:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:20:13,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-22 13:20:13,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:20:13,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627913552] [2024-11-22 13:20:13,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627913552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:20:13,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:20:13,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-22 13:20:13,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823483996] [2024-11-22 13:20:13,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:20:13,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 13:20:13,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:20:13,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 13:20:13,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-11-22 13:20:13,018 INFO L87 Difference]: Start difference. First operand 274 states and 383 transitions. Second operand has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 16 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-22 13:20:14,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:20:14,186 INFO L93 Difference]: Finished difference Result 711 states and 988 transitions. [2024-11-22 13:20:14,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 13:20:14,187 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 16 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) Word has length 190 [2024-11-22 13:20:14,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:20:14,189 INFO L225 Difference]: With dead ends: 711 [2024-11-22 13:20:14,189 INFO L226 Difference]: Without dead ends: 440 [2024-11-22 13:20:14,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2024-11-22 13:20:14,190 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 758 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-22 13:20:14,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 633 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-22 13:20:14,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-22 13:20:14,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 273. [2024-11-22 13:20:14,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 237 states have (on average 1.350210970464135) internal successors, (320), 239 states have internal predecessors, (320), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-22 13:20:14,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 382 transitions. [2024-11-22 13:20:14,216 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 382 transitions. Word has length 190 [2024-11-22 13:20:14,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:20:14,216 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 382 transitions. [2024-11-22 13:20:14,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 16 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-22 13:20:14,217 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 382 transitions. [2024-11-22 13:20:14,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-22 13:20:14,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:20:14,218 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:20:14,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 13:20:14,218 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:20:14,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:20:14,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1326934457, now seen corresponding path program 1 times [2024-11-22 13:20:14,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:20:14,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785862702] [2024-11-22 13:20:14,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:20:14,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:20:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:20:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-22 13:20:14,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:20:14,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785862702] [2024-11-22 13:20:14,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785862702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:20:14,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:20:14,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:20:14,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647285436] [2024-11-22 13:20:14,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:20:14,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 13:20:14,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:20:14,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 13:20:14,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:20:14,825 INFO L87 Difference]: Start difference. First operand 273 states and 382 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-22 13:20:15,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:20:15,065 INFO L93 Difference]: Finished difference Result 668 states and 933 transitions. [2024-11-22 13:20:15,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:20:15,066 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2024-11-22 13:20:15,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:20:15,068 INFO L225 Difference]: With dead ends: 668 [2024-11-22 13:20:15,068 INFO L226 Difference]: Without dead ends: 398 [2024-11-22 13:20:15,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-22 13:20:15,069 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 271 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 13:20:15,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 622 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 13:20:15,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-22 13:20:15,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 271. [2024-11-22 13:20:15,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 235 states have (on average 1.348936170212766) internal successors, (317), 237 states have internal predecessors, (317), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-22 13:20:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 379 transitions. [2024-11-22 13:20:15,096 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 379 transitions. Word has length 190 [2024-11-22 13:20:15,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:20:15,096 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 379 transitions. [2024-11-22 13:20:15,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-22 13:20:15,096 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 379 transitions. [2024-11-22 13:20:15,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-22 13:20:15,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:20:15,097 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:20:15,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 13:20:15,097 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:20:15,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:20:15,098 INFO L85 PathProgramCache]: Analyzing trace with hash 973888133, now seen corresponding path program 1 times [2024-11-22 13:20:15,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:20:15,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719007074] [2024-11-22 13:20:15,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:20:15,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:20:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:20:19,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-22 13:20:19,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:20:19,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719007074] [2024-11-22 13:20:19,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719007074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:20:19,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:20:19,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-22 13:20:19,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306640348] [2024-11-22 13:20:19,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:20:19,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-22 13:20:19,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:20:19,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-22 13:20:19,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-22 13:20:19,339 INFO L87 Difference]: Start difference. First operand 271 states and 379 transitions. Second operand has 18 states, 16 states have (on average 4.25) internal successors, (68), 18 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-22 13:20:21,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:20:21,471 INFO L93 Difference]: Finished difference Result 659 states and 912 transitions. [2024-11-22 13:20:21,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-22 13:20:21,472 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.25) internal successors, (68), 18 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) Word has length 190 [2024-11-22 13:20:21,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:20:21,474 INFO L225 Difference]: With dead ends: 659 [2024-11-22 13:20:21,474 INFO L226 Difference]: Without dead ends: 391 [2024-11-22 13:20:21,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=232, Invalid=698, Unknown=0, NotChecked=0, Total=930 [2024-11-22 13:20:21,475 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 1270 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:20:21,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1272 Valid, 707 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-22 13:20:21,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-22 13:20:21,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 283. [2024-11-22 13:20:21,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 247 states have (on average 1.360323886639676) internal successors, (336), 249 states have internal predecessors, (336), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-22 13:20:21,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 398 transitions. [2024-11-22 13:20:21,501 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 398 transitions. Word has length 190 [2024-11-22 13:20:21,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:20:21,502 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 398 transitions. [2024-11-22 13:20:21,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.25) internal successors, (68), 18 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-22 13:20:21,502 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 398 transitions. [2024-11-22 13:20:21,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-22 13:20:21,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:20:21,503 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:20:21,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 13:20:21,503 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:20:21,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:20:21,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1361719900, now seen corresponding path program 1 times [2024-11-22 13:20:21,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:20:21,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626166617] [2024-11-22 13:20:21,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:20:21,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:20:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:20:25,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-22 13:20:25,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:20:25,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626166617] [2024-11-22 13:20:25,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626166617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:20:25,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:20:25,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-22 13:20:25,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863405279] [2024-11-22 13:20:25,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:20:25,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-22 13:20:25,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:20:25,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-22 13:20:25,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-22 13:20:25,492 INFO L87 Difference]: Start difference. First operand 283 states and 398 transitions. Second operand has 19 states, 16 states have (on average 4.25) internal successors, (68), 19 states have internal predecessors, (68), 6 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 6 states have call successors, (25) [2024-11-22 13:20:27,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:20:27,551 INFO L93 Difference]: Finished difference Result 627 states and 874 transitions. [2024-11-22 13:20:27,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 13:20:27,552 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 4.25) internal successors, (68), 19 states have internal predecessors, (68), 6 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 6 states have call successors, (25) Word has length 190 [2024-11-22 13:20:27,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:20:27,554 INFO L225 Difference]: With dead ends: 627 [2024-11-22 13:20:27,554 INFO L226 Difference]: Without dead ends: 347 [2024-11-22 13:20:27,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=205, Invalid=665, Unknown=0, NotChecked=0, Total=870 [2024-11-22 13:20:27,555 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 528 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 1388 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:20:27,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 900 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1388 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-22 13:20:27,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-22 13:20:27,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 281. [2024-11-22 13:20:27,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 245 states have (on average 1.3591836734693878) internal successors, (333), 247 states have internal predecessors, (333), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-22 13:20:27,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 395 transitions. [2024-11-22 13:20:27,583 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 395 transitions. Word has length 190 [2024-11-22 13:20:27,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:20:27,583 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 395 transitions. [2024-11-22 13:20:27,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 4.25) internal successors, (68), 19 states have internal predecessors, (68), 6 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 6 states have call successors, (25) [2024-11-22 13:20:27,583 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 395 transitions. [2024-11-22 13:20:27,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-22 13:20:27,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:20:27,584 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:20:27,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 13:20:27,584 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:20:27,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:20:27,585 INFO L85 PathProgramCache]: Analyzing trace with hash 939018074, now seen corresponding path program 1 times [2024-11-22 13:20:27,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:20:27,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548375729] [2024-11-22 13:20:27,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:20:27,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:20:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:20:30,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-22 13:20:30,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:20:30,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548375729] [2024-11-22 13:20:30,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548375729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:20:30,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:20:30,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-22 13:20:30,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542764143] [2024-11-22 13:20:30,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:20:30,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-22 13:20:30,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:20:30,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-22 13:20:30,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2024-11-22 13:20:30,944 INFO L87 Difference]: Start difference. First operand 281 states and 395 transitions. Second operand has 20 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 20 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-22 13:20:32,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:20:32,938 INFO L93 Difference]: Finished difference Result 745 states and 1039 transitions. [2024-11-22 13:20:32,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-22 13:20:32,938 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 20 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) Word has length 190 [2024-11-22 13:20:32,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:20:32,940 INFO L225 Difference]: With dead ends: 745 [2024-11-22 13:20:32,941 INFO L226 Difference]: Without dead ends: 467 [2024-11-22 13:20:32,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=290, Invalid=900, Unknown=0, NotChecked=0, Total=1190 [2024-11-22 13:20:32,944 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 648 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:20:32,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 871 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-22 13:20:32,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-11-22 13:20:32,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 286. [2024-11-22 13:20:32,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 250 states have (on average 1.364) internal successors, (341), 252 states have internal predecessors, (341), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-22 13:20:32,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 403 transitions. [2024-11-22 13:20:32,974 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 403 transitions. Word has length 190 [2024-11-22 13:20:32,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:20:32,975 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 403 transitions. [2024-11-22 13:20:32,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 20 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-22 13:20:32,975 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 403 transitions. [2024-11-22 13:20:32,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-22 13:20:32,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:20:32,976 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:20:32,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 13:20:32,976 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:20:32,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:20:32,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1460947963, now seen corresponding path program 1 times [2024-11-22 13:20:32,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:20:32,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408760958] [2024-11-22 13:20:32,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:20:32,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:20:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:20:37,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-22 13:20:37,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:20:37,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408760958] [2024-11-22 13:20:37,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408760958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:20:37,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:20:37,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-22 13:20:37,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039956563] [2024-11-22 13:20:37,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:20:37,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-22 13:20:37,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:20:37,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-22 13:20:37,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-22 13:20:37,308 INFO L87 Difference]: Start difference. First operand 286 states and 403 transitions. Second operand has 19 states, 17 states have (on average 4.0) internal successors, (68), 19 states have internal predecessors, (68), 5 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 5 states have call successors, (25) [2024-11-22 13:20:39,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:20:39,683 INFO L93 Difference]: Finished difference Result 669 states and 932 transitions. [2024-11-22 13:20:39,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-22 13:20:39,683 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 4.0) internal successors, (68), 19 states have internal predecessors, (68), 5 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 5 states have call successors, (25) Word has length 190 [2024-11-22 13:20:39,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:20:39,685 INFO L225 Difference]: With dead ends: 669 [2024-11-22 13:20:39,685 INFO L226 Difference]: Without dead ends: 386 [2024-11-22 13:20:39,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=248, Invalid=874, Unknown=0, NotChecked=0, Total=1122 [2024-11-22 13:20:39,686 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 797 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:20:39,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 956 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-22 13:20:39,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-22 13:20:39,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 280. [2024-11-22 13:20:39,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 244 states have (on average 1.3565573770491803) internal successors, (331), 246 states have internal predecessors, (331), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-22 13:20:39,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 393 transitions. [2024-11-22 13:20:39,720 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 393 transitions. Word has length 190 [2024-11-22 13:20:39,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:20:39,721 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 393 transitions. [2024-11-22 13:20:39,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 4.0) internal successors, (68), 19 states have internal predecessors, (68), 5 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 5 states have call successors, (25) [2024-11-22 13:20:39,721 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 393 transitions. [2024-11-22 13:20:39,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-22 13:20:39,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:20:39,722 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:20:39,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 13:20:39,722 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:20:39,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:20:39,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1566650078, now seen corresponding path program 1 times [2024-11-22 13:20:39,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:20:39,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39168330] [2024-11-22 13:20:39,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:20:39,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:20:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:20:41,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 3 proven. 69 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-22 13:20:41,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:20:41,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39168330] [2024-11-22 13:20:41,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39168330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:20:41,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500352182] [2024-11-22 13:20:41,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:20:41,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:20:41,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:20:41,983 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-22 13:20:41,984 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-22 13:20:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:20:42,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-11-22 13:20:42,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:20:42,485 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-22 13:20:43,029 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 25 treesize of output 13 [2024-11-22 13:20:43,427 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 25 treesize of output 13 [2024-11-22 13:20:43,801 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 25 treesize of output 13 [2024-11-22 13:20:44,197 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 25 treesize of output 13 [2024-11-22 13:20:44,634 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 25 treesize of output 13 [2024-11-22 13:20:45,036 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 25 treesize of output 13 [2024-11-22 13:20:45,480 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 25 treesize of output 13 [2024-11-22 13:20:45,903 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 25 treesize of output 13 [2024-11-22 13:20:46,273 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 25 treesize of output 13 [2024-11-22 13:20:46,660 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 25 treesize of output 13 [2024-11-22 13:20:47,059 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 25 treesize of output 13 [2024-11-22 13:20:47,496 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 25 treesize of output 13 [2024-11-22 13:20:47,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:20:47,851 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 25 treesize of output 13 [2024-11-22 13:20:47,992 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-22 13:20:47,992 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 2 case distinctions, treesize of input 73 treesize of output 68 [2024-11-22 13:20:48,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:20:48,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 71 [2024-11-22 13:20:48,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:20:48,102 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 34 treesize of output 20 [2024-11-22 13:20:48,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:20:48,174 INFO L349 Elim1Store]: treesize reduction 86, result has 23.9 percent of original size [2024-11-22 13:20:48,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 51 treesize of output 89 [2024-11-22 13:20:48,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:20:48,404 INFO L349 Elim1Store]: treesize reduction 56, result has 41.1 percent of original size [2024-11-22 13:20:48,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 135 treesize of output 146 [2024-11-22 13:20:49,169 INFO L349 Elim1Store]: treesize reduction 42, result has 45.5 percent of original size [2024-11-22 13:20:49,169 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 5 case distinctions, treesize of input 296 treesize of output 269 [2024-11-22 13:20:49,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:20:49,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:20:49,968 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-22 13:20:49,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2024-11-22 13:20:49,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:20:49,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:20:50,005 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-22 13:20:50,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2024-11-22 13:20:50,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:20:50,046 INFO L349 Elim1Store]: treesize reduction 504, result has 0.2 percent of original size [2024-11-22 13:20:50,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 44 case distinctions, treesize of input 149 treesize of output 110 [2024-11-22 13:20:50,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:20:50,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:20:50,065 INFO L349 Elim1Store]: treesize reduction 70, result has 1.4 percent of original size [2024-11-22 13:20:50,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 23 [2024-11-22 13:20:50,111 INFO L349 Elim1Store]: treesize reduction 90, result has 1.1 percent of original size [2024-11-22 13:20:50,111 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 5 case distinctions, treesize of input 303 treesize of output 242 [2024-11-22 13:20:50,123 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2024-11-22 13:20:50,123 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 222 treesize of output 1 [2024-11-22 13:20:50,147 INFO L349 Elim1Store]: treesize reduction 90, result has 1.1 percent of original size [2024-11-22 13:20:50,147 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 5 case distinctions, treesize of input 303 treesize of output 242 [2024-11-22 13:20:50,162 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2024-11-22 13:20:50,162 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 222 treesize of output 1 [2024-11-22 13:20:50,176 INFO L349 Elim1Store]: treesize reduction 76, result has 1.3 percent of original size [2024-11-22 13:20:50,176 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 5 case distinctions, treesize of input 296 treesize of output 235 [2024-11-22 13:20:50,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 222 treesize of output 218 [2024-11-22 13:20:50,218 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2024-11-22 13:20:50,218 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 218 treesize of output 1 [2024-11-22 13:20:50,242 INFO L349 Elim1Store]: treesize reduction 90, result has 1.1 percent of original size [2024-11-22 13:20:50,242 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 5 case distinctions, treesize of input 303 treesize of output 242 [2024-11-22 13:20:50,256 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2024-11-22 13:20:50,257 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 222 treesize of output 1 [2024-11-22 13:20:50,270 INFO L349 Elim1Store]: treesize reduction 104, result has 1.0 percent of original size [2024-11-22 13:20:50,270 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 5 case distinctions, treesize of input 310 treesize of output 249 [2024-11-22 13:20:50,285 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2024-11-22 13:20:50,285 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 222 treesize of output 1 [2024-11-22 13:20:50,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:20:50,340 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 25 treesize of output 13 [2024-11-22 13:20:50,384 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 35 treesize of output 23 [2024-11-22 13:20:50,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 113 proven. 162 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2024-11-22 13:20:50,389 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:20:50,463 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2591 Int) (v_ArrVal_2589 (Array Int Int)) (v_ArrVal_2587 Int) (v_ArrVal_2590 (Array Int Int))) (let ((.cse0 (let ((.cse2 (store |c_#memory_int| c_~WrapperStruct00_var_1_20_Pointer~0.base v_ArrVal_2590))) (store .cse2 c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset v_ArrVal_2587))))) (or (not (= (store (select |c_#memory_int| c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset (select v_ArrVal_2590 c_~WrapperStruct00_var_1_20_Pointer~0.offset)) v_ArrVal_2590)) (not (= (store (select .cse0 c_~WrapperStruct00_var_1_23_Pointer~0.base) c_~WrapperStruct00_var_1_23_Pointer~0.offset (select v_ArrVal_2589 c_~WrapperStruct00_var_1_23_Pointer~0.offset)) v_ArrVal_2589)) (< (mod (select (select (let ((.cse1 (store .cse0 c_~WrapperStruct00_var_1_23_Pointer~0.base v_ArrVal_2589))) (store .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_2591))) c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) 256) 1)))) is different from false [2024-11-22 13:20:50,534 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| c_~WrapperStruct00_var_1_19_Pointer~0.base))) (and (forall ((v_ArrVal_2591 Int) (v_ArrVal_2589 (Array Int Int)) (~WrapperStruct00_var_1_15_Pointer~0.base Int) (v_ArrVal_2587 Int) (~WrapperStruct00_var_1_15_Pointer~0.offset Int) (v_ArrVal_2590 (Array Int Int))) (let ((.cse2 (mod (select (select |c_#memory_int| ~WrapperStruct00_var_1_15_Pointer~0.base) ~WrapperStruct00_var_1_15_Pointer~0.offset) 256))) (let ((.cse3 (store |c_#memory_int| c_~WrapperStruct00_var_1_19_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_19_Pointer~0.offset .cse2)))) (let ((.cse1 (let ((.cse4 (store .cse3 c_~WrapperStruct00_var_1_20_Pointer~0.base v_ArrVal_2590))) (store .cse4 c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select .cse4 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset v_ArrVal_2587))))) (or (< (mod (select (select (let ((.cse0 (store .cse1 c_~WrapperStruct00_var_1_23_Pointer~0.base v_ArrVal_2589))) (store .cse0 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse0 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_2591))) c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) 256) 1) (< 127 .cse2) (not (= v_ArrVal_2589 (store (select .cse1 c_~WrapperStruct00_var_1_23_Pointer~0.base) c_~WrapperStruct00_var_1_23_Pointer~0.offset (select v_ArrVal_2589 c_~WrapperStruct00_var_1_23_Pointer~0.offset)))) (not (= (store (select .cse3 c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset (select v_ArrVal_2590 c_~WrapperStruct00_var_1_20_Pointer~0.offset)) v_ArrVal_2590))))))) (forall ((v_ArrVal_2591 Int) (v_ArrVal_2589 (Array Int Int)) (~WrapperStruct00_var_1_15_Pointer~0.base Int) (v_ArrVal_2587 Int) (~WrapperStruct00_var_1_15_Pointer~0.offset Int) (v_ArrVal_2590 (Array Int Int))) (let ((.cse6 (mod (select (select |c_#memory_int| ~WrapperStruct00_var_1_15_Pointer~0.base) ~WrapperStruct00_var_1_15_Pointer~0.offset) 256))) (let ((.cse8 (store |c_#memory_int| c_~WrapperStruct00_var_1_19_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_19_Pointer~0.offset (+ (- 256) .cse6))))) (let ((.cse7 (let ((.cse10 (store .cse8 c_~WrapperStruct00_var_1_20_Pointer~0.base v_ArrVal_2590))) (store .cse10 c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select .cse10 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset v_ArrVal_2587))))) (or (< .cse6 128) (not (= v_ArrVal_2589 (store (select .cse7 c_~WrapperStruct00_var_1_23_Pointer~0.base) c_~WrapperStruct00_var_1_23_Pointer~0.offset (select v_ArrVal_2589 c_~WrapperStruct00_var_1_23_Pointer~0.offset)))) (not (= (store (select .cse8 c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset (select v_ArrVal_2590 c_~WrapperStruct00_var_1_20_Pointer~0.offset)) v_ArrVal_2590)) (< (mod (select (select (let ((.cse9 (store .cse7 c_~WrapperStruct00_var_1_23_Pointer~0.base v_ArrVal_2589))) (store .cse9 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse9 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_2591))) c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) 256) 1)))))))) is different from false [2024-11-22 13:20:50,749 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base))) (and (forall ((v_ArrVal_2591 Int) (v_ArrVal_2584 Int) (v_ArrVal_2589 (Array Int Int)) (~WrapperStruct00_var_1_15_Pointer~0.base Int) (v_ArrVal_2587 Int) (~WrapperStruct00_var_1_15_Pointer~0.offset Int) (v_ArrVal_2590 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base (store .cse6 c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_2584)))) (let ((.cse0 (mod (select (select .cse5 ~WrapperStruct00_var_1_15_Pointer~0.base) ~WrapperStruct00_var_1_15_Pointer~0.offset) 256))) (let ((.cse1 (store .cse5 c_~WrapperStruct00_var_1_19_Pointer~0.base (store (select .cse5 c_~WrapperStruct00_var_1_19_Pointer~0.base) c_~WrapperStruct00_var_1_19_Pointer~0.offset .cse0)))) (let ((.cse2 (let ((.cse4 (store .cse1 c_~WrapperStruct00_var_1_20_Pointer~0.base v_ArrVal_2590))) (store .cse4 c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select .cse4 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset v_ArrVal_2587))))) (or (< 127 .cse0) (not (= v_ArrVal_2590 (store (select .cse1 c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset (select v_ArrVal_2590 c_~WrapperStruct00_var_1_20_Pointer~0.offset)))) (not (= v_ArrVal_2589 (store (select .cse2 c_~WrapperStruct00_var_1_23_Pointer~0.base) c_~WrapperStruct00_var_1_23_Pointer~0.offset (select v_ArrVal_2589 c_~WrapperStruct00_var_1_23_Pointer~0.offset)))) (< (mod (select (select (let ((.cse3 (store .cse2 c_~WrapperStruct00_var_1_23_Pointer~0.base v_ArrVal_2589))) (store .cse3 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_2591))) c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) 256) 1))))))) (forall ((v_ArrVal_2591 Int) (v_ArrVal_2584 Int) (v_ArrVal_2589 (Array Int Int)) (~WrapperStruct00_var_1_15_Pointer~0.base Int) (v_ArrVal_2587 Int) (~WrapperStruct00_var_1_15_Pointer~0.offset Int) (v_ArrVal_2590 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base (store .cse6 c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_2584)))) (let ((.cse7 (mod (select (select .cse12 ~WrapperStruct00_var_1_15_Pointer~0.base) ~WrapperStruct00_var_1_15_Pointer~0.offset) 256))) (let ((.cse10 (store .cse12 c_~WrapperStruct00_var_1_19_Pointer~0.base (store (select .cse12 c_~WrapperStruct00_var_1_19_Pointer~0.base) c_~WrapperStruct00_var_1_19_Pointer~0.offset (+ (- 256) .cse7))))) (let ((.cse8 (let ((.cse11 (store .cse10 c_~WrapperStruct00_var_1_20_Pointer~0.base v_ArrVal_2590))) (store .cse11 c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select .cse11 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset v_ArrVal_2587))))) (or (< .cse7 128) (not (= v_ArrVal_2589 (store (select .cse8 c_~WrapperStruct00_var_1_23_Pointer~0.base) c_~WrapperStruct00_var_1_23_Pointer~0.offset (select v_ArrVal_2589 c_~WrapperStruct00_var_1_23_Pointer~0.offset)))) (< (mod (select (select (let ((.cse9 (store .cse8 c_~WrapperStruct00_var_1_23_Pointer~0.base v_ArrVal_2589))) (store .cse9 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse9 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_2591))) c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) 256) 1) (not (= (store (select .cse10 c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset (select v_ArrVal_2590 c_~WrapperStruct00_var_1_20_Pointer~0.offset)) v_ArrVal_2590)))))))))) is different from false [2024-11-22 13:20:50,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500352182] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:20:50,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 13:20:50,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2024-11-22 13:20:50,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436874685] [2024-11-22 13:20:50,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 13:20:50,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-22 13:20:50,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:20:50,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-22 13:20:50,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=513, Unknown=3, NotChecked=150, Total=812 [2024-11-22 13:20:50,963 INFO L87 Difference]: Start difference. First operand 280 states and 393 transitions. Second operand has 25 states, 23 states have (on average 5.6521739130434785) internal successors, (130), 25 states have internal predecessors, (130), 8 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (50), 6 states have call predecessors, (50), 8 states have call successors, (50) [2024-11-22 13:20:56,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]