./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-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 ac494cf4bb95ee7173afff6e37d6c8217c99c93b386253d4b81910df4df15de3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:09:12,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:09:12,493 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:09:12,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:09:12,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:09:12,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:09:12,518 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:09:12,518 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:09:12,519 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:09:12,519 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:09:12,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:09:12,520 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:09:12,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:09:12,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:09:12,523 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:09:12,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:09:12,524 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:09:12,524 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:09:12,524 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:09:12,524 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:09:12,524 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:09:12,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:09:12,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:09:12,526 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:09:12,526 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:09:12,526 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:09:12,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:09:12,526 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:09:12,526 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:09:12,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:09:12,527 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:09:12,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:09:12,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:09:12,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:09:12,527 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:09:12,527 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:09:12,528 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:09:12,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:09:12,528 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:09:12,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:09:12,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:09:12,530 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:09:12,530 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 -> ac494cf4bb95ee7173afff6e37d6c8217c99c93b386253d4b81910df4df15de3 [2024-11-19 01:09:12,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:09:12,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:09:12,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:09:12,765 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:09:12,765 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:09:12,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-61.i [2024-11-19 01:09:13,994 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:09:14,145 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:09:14,146 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-61.i [2024-11-19 01:09:14,153 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aa74020f/04d18029ee264f2fa2d7ef1a49035eb4/FLAG8b2b34271 [2024-11-19 01:09:14,165 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aa74020f/04d18029ee264f2fa2d7ef1a49035eb4 [2024-11-19 01:09:14,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:09:14,168 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:09:14,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:09:14,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:09:14,175 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:09:14,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:09:14" (1/1) ... [2024-11-19 01:09:14,176 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a36ee00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:14, skipping insertion in model container [2024-11-19 01:09:14,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:09:14" (1/1) ... [2024-11-19 01:09:14,201 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:09:14,326 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-61.i[916,929] [2024-11-19 01:09:14,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:09:14,398 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:09:14,406 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-61.i[916,929] [2024-11-19 01:09:14,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:09:14,452 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:09:14,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:14 WrapperNode [2024-11-19 01:09:14,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:09:14,454 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:09:14,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:09:14,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:09:14,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:14" (1/1) ... [2024-11-19 01:09:14,473 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:14" (1/1) ... [2024-11-19 01:09:14,515 INFO L138 Inliner]: procedures = 30, calls = 184, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 504 [2024-11-19 01:09:14,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:09:14,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:09:14,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:09:14,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:09:14,529 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:14" (1/1) ... [2024-11-19 01:09:14,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:14" (1/1) ... [2024-11-19 01:09:14,535 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:14" (1/1) ... [2024-11-19 01:09:14,542 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-19 01:09:14,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:14" (1/1) ... [2024-11-19 01:09:14,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:14" (1/1) ... [2024-11-19 01:09:14,556 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:14" (1/1) ... [2024-11-19 01:09:14,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:14" (1/1) ... [2024-11-19 01:09:14,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:14" (1/1) ... [2024-11-19 01:09:14,570 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:14" (1/1) ... [2024-11-19 01:09:14,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:09:14,575 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:09:14,575 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:09:14,576 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:09:14,576 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:14" (1/1) ... [2024-11-19 01:09:14,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:09:14,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:09:14,615 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-19 01:09:14,618 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-19 01:09:14,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:09:14,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-19 01:09:14,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-19 01:09:14,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-19 01:09:14,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 01:09:14,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-19 01:09:14,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 01:09:14,654 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:09:14,655 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:09:14,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 01:09:14,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:09:14,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:09:14,759 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:09:14,761 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:09:15,480 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2024-11-19 01:09:15,482 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:09:15,495 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:09:15,498 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:09:15,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:09:15 BoogieIcfgContainer [2024-11-19 01:09:15,499 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:09:15,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:09:15,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:09:15,505 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:09:15,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:09:14" (1/3) ... [2024-11-19 01:09:15,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a52c806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:09:15, skipping insertion in model container [2024-11-19 01:09:15,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:14" (2/3) ... [2024-11-19 01:09:15,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a52c806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:09:15, skipping insertion in model container [2024-11-19 01:09:15,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:09:15" (3/3) ... [2024-11-19 01:09:15,508 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-61.i [2024-11-19 01:09:15,522 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:09:15,522 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:09:15,566 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:09:15,571 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;@63a74aa9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:09:15,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:09:15,575 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-19 01:09:15,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 01:09:15,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:09:15,587 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-19 01:09:15,587 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:09:15,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:09:15,591 INFO L85 PathProgramCache]: Analyzing trace with hash 686700268, now seen corresponding path program 1 times [2024-11-19 01:09:15,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:09:15,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456182768] [2024-11-19 01:09:15,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:09:15,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:09:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:09:16,031 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-19 01:09:16,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:09:16,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456182768] [2024-11-19 01:09:16,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456182768] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:09:16,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565080984] [2024-11-19 01:09:16,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:09:16,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:09:16,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:09:16,035 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-19 01:09:16,037 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-19 01:09:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:09:16,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:09:16,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:09:16,327 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-19 01:09:16,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:09:16,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565080984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:09:16,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:09:16,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 01:09:16,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211783159] [2024-11-19 01:09:16,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:09:16,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:09:16,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:09:16,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:09:16,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:09:16,360 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-19 01:09:16,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:09:16,392 INFO L93 Difference]: Finished difference Result 233 states and 369 transitions. [2024-11-19 01:09:16,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:09:16,394 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-19 01:09:16,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:09:16,399 INFO L225 Difference]: With dead ends: 233 [2024-11-19 01:09:16,400 INFO L226 Difference]: Without dead ends: 116 [2024-11-19 01:09:16,405 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-19 01:09:16,407 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-19 01:09:16,410 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-19 01:09:16,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-19 01:09:16,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-19 01:09:16,443 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-19 01:09:16,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2024-11-19 01:09:16,447 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 190 [2024-11-19 01:09:16,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:09:16,448 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2024-11-19 01:09:16,448 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-19 01:09:16,448 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2024-11-19 01:09:16,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 01:09:16,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:09:16,451 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-19 01:09:16,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 01:09:16,651 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-19 01:09:16,652 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:09:16,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:09:16,652 INFO L85 PathProgramCache]: Analyzing trace with hash 326820314, now seen corresponding path program 1 times [2024-11-19 01:09:16,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:09:16,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550859876] [2024-11-19 01:09:16,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:09:16,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:09:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:09:17,033 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-19 01:09:17,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:09:17,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550859876] [2024-11-19 01:09:17,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550859876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:09:17,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:09:17,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:09:17,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553526556] [2024-11-19 01:09:17,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:09:17,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:09:17,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:09:17,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:09:17,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:09:17,038 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-19 01:09:17,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:09:17,088 INFO L93 Difference]: Finished difference Result 232 states and 337 transitions. [2024-11-19 01:09:17,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:09:17,089 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-19 01:09:17,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:09:17,092 INFO L225 Difference]: With dead ends: 232 [2024-11-19 01:09:17,092 INFO L226 Difference]: Without dead ends: 119 [2024-11-19 01:09:17,092 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-19 01:09:17,093 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-19 01:09:17,094 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-19 01:09:17,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-19 01:09:17,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-19 01:09:17,104 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-19 01:09:17,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 170 transitions. [2024-11-19 01:09:17,106 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 170 transitions. Word has length 190 [2024-11-19 01:09:17,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:09:17,107 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 170 transitions. [2024-11-19 01:09:17,107 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-19 01:09:17,107 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2024-11-19 01:09:17,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 01:09:17,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:09:17,110 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-19 01:09:17,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:09:17,110 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:09:17,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:09:17,111 INFO L85 PathProgramCache]: Analyzing trace with hash 2101827676, now seen corresponding path program 1 times [2024-11-19 01:09:17,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:09:17,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830684440] [2024-11-19 01:09:17,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:09:17,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:09:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:09:17,308 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-19 01:09:17,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:09:17,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830684440] [2024-11-19 01:09:17,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830684440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:09:17,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:09:17,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:09:17,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938147425] [2024-11-19 01:09:17,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:09:17,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:09:17,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:09:17,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:09:17,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:09:17,313 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-19 01:09:17,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:09:17,347 INFO L93 Difference]: Finished difference Result 236 states and 341 transitions. [2024-11-19 01:09:17,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:09:17,349 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-19 01:09:17,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:09:17,350 INFO L225 Difference]: With dead ends: 236 [2024-11-19 01:09:17,350 INFO L226 Difference]: Without dead ends: 121 [2024-11-19 01:09:17,351 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-19 01:09:17,352 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-19 01:09:17,352 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-19 01:09:17,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-19 01:09:17,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-11-19 01:09:17,368 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-19 01:09:17,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 172 transitions. [2024-11-19 01:09:17,369 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 172 transitions. Word has length 190 [2024-11-19 01:09:17,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:09:17,370 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 172 transitions. [2024-11-19 01:09:17,372 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-19 01:09:17,372 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 172 transitions. [2024-11-19 01:09:17,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 01:09:17,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:09:17,374 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-19 01:09:17,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:09:17,375 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:09:17,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:09:17,375 INFO L85 PathProgramCache]: Analyzing trace with hash 2103674718, now seen corresponding path program 1 times [2024-11-19 01:09:17,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:09:17,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558299030] [2024-11-19 01:09:17,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:09:17,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:09:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:09:17,624 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-19 01:09:17,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:09:17,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558299030] [2024-11-19 01:09:17,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558299030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:09:17,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:09:17,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:09:17,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318259359] [2024-11-19 01:09:17,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:09:17,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:09:17,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:09:17,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:09:17,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:09:17,630 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-19 01:09:17,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:09:17,651 INFO L93 Difference]: Finished difference Result 239 states and 344 transitions. [2024-11-19 01:09:17,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:09:17,654 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-19 01:09:17,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:09:17,655 INFO L225 Difference]: With dead ends: 239 [2024-11-19 01:09:17,655 INFO L226 Difference]: Without dead ends: 122 [2024-11-19 01:09:17,656 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-19 01:09:17,658 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-19 01:09:17,659 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-19 01:09:17,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-19 01:09:17,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-19 01:09:17,666 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-19 01:09:17,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 174 transitions. [2024-11-19 01:09:17,667 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 174 transitions. Word has length 190 [2024-11-19 01:09:17,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:09:17,668 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 174 transitions. [2024-11-19 01:09:17,669 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-19 01:09:17,669 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 174 transitions. [2024-11-19 01:09:17,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 01:09:17,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:09:17,671 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-19 01:09:17,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:09:17,671 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:09:17,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:09:17,672 INFO L85 PathProgramCache]: Analyzing trace with hash 180446684, now seen corresponding path program 1 times [2024-11-19 01:09:17,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:09:17,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933746699] [2024-11-19 01:09:17,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:09:17,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:09:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:09:19,496 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-19 01:09:19,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:09:19,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933746699] [2024-11-19 01:09:19,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933746699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:09:19,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:09:19,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:09:19,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382775361] [2024-11-19 01:09:19,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:09:19,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:09:19,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:09:19,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:09:19,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:09:19,500 INFO L87 Difference]: Start difference. First operand 122 states and 174 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (25), 1 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-19 01:09:19,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:09:19,870 INFO L93 Difference]: Finished difference Result 307 states and 437 transitions. [2024-11-19 01:09:19,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:09:19,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (25), 1 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-19 01:09:19,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:09:19,873 INFO L225 Difference]: With dead ends: 307 [2024-11-19 01:09:19,873 INFO L226 Difference]: Without dead ends: 188 [2024-11-19 01:09:19,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:09:19,874 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 152 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:09:19,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 422 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 01:09:19,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-19 01:09:19,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2024-11-19 01:09:19,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 153 states have (on average 1.3398692810457515) internal successors, (205), 154 states have internal predecessors, (205), 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-19 01:09:19,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 263 transitions. [2024-11-19 01:09:19,897 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 263 transitions. Word has length 190 [2024-11-19 01:09:19,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:09:19,898 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 263 transitions. [2024-11-19 01:09:19,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (25), 1 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-19 01:09:19,898 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 263 transitions. [2024-11-19 01:09:19,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 01:09:19,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:09:19,900 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-19 01:09:19,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 01:09:19,901 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:09:19,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:09:19,901 INFO L85 PathProgramCache]: Analyzing trace with hash -805089184, now seen corresponding path program 1 times [2024-11-19 01:09:19,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:09:19,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147399831] [2024-11-19 01:09:19,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:09:19,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:09:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:09:22,065 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-19 01:09:22,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:09:22,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147399831] [2024-11-19 01:09:22,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147399831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:09:22,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:09:22,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 01:09:22,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474049968] [2024-11-19 01:09:22,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:09:22,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:09:22,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:09:22,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:09:22,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:09:22,067 INFO L87 Difference]: Start difference. First operand 185 states and 263 transitions. Second operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (25), 1 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-19 01:09:22,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:09:22,433 INFO L93 Difference]: Finished difference Result 465 states and 664 transitions. [2024-11-19 01:09:22,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:09:22,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (25), 1 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-19 01:09:22,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:09:22,437 INFO L225 Difference]: With dead ends: 465 [2024-11-19 01:09:22,437 INFO L226 Difference]: Without dead ends: 283 [2024-11-19 01:09:22,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:09:22,438 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 114 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:09:22,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 530 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 01:09:22,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-19 01:09:22,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 207. [2024-11-19 01:09:22,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 175 states have (on average 1.3657142857142857) internal successors, (239), 176 states have internal predecessors, (239), 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-19 01:09:22,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 297 transitions. [2024-11-19 01:09:22,447 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 297 transitions. Word has length 190 [2024-11-19 01:09:22,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:09:22,448 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 297 transitions. [2024-11-19 01:09:22,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (25), 1 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-19 01:09:22,448 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 297 transitions. [2024-11-19 01:09:22,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 01:09:22,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:09:22,450 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-19 01:09:22,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:09:22,450 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:09:22,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:09:22,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1495733406, now seen corresponding path program 1 times [2024-11-19 01:09:22,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:09:22,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127867788] [2024-11-19 01:09:22,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:09:22,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:09:22,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:09:24,612 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-19 01:09:24,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:09:24,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127867788] [2024-11-19 01:09:24,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127867788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:09:24,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:09:24,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 01:09:24,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935560069] [2024-11-19 01:09:24,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:09:24,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 01:09:24,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:09:24,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 01:09:24,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:09:24,614 INFO L87 Difference]: Start difference. First operand 207 states and 297 transitions. Second operand has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (25), 1 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-19 01:09:25,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:09:25,471 INFO L93 Difference]: Finished difference Result 611 states and 861 transitions. [2024-11-19 01:09:25,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 01:09:25,471 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (25), 1 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-19 01:09:25,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:09:25,473 INFO L225 Difference]: With dead ends: 611 [2024-11-19 01:09:25,473 INFO L226 Difference]: Without dead ends: 407 [2024-11-19 01:09:25,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:09:25,475 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 132 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:09:25,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 885 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 01:09:25,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-11-19 01:09:25,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 313. [2024-11-19 01:09:25,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 275 states have (on average 1.3636363636363635) internal successors, (375), 278 states have internal predecessors, (375), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-19 01:09:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 441 transitions. [2024-11-19 01:09:25,486 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 441 transitions. Word has length 190 [2024-11-19 01:09:25,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:09:25,486 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 441 transitions. [2024-11-19 01:09:25,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (25), 1 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-19 01:09:25,487 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 441 transitions. [2024-11-19 01:09:25,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 01:09:25,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:09:25,488 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-19 01:09:25,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:09:25,489 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:09:25,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:09:25,489 INFO L85 PathProgramCache]: Analyzing trace with hash -904232631, now seen corresponding path program 1 times [2024-11-19 01:09:25,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:09:25,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696571909] [2024-11-19 01:09:25,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:09:25,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:09:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:09:27,038 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-19 01:09:27,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:09:27,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696571909] [2024-11-19 01:09:27,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696571909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:09:27,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:09:27,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 01:09:27,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481485832] [2024-11-19 01:09:27,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:09:27,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:09:27,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:09:27,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:09:27,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:09:27,041 INFO L87 Difference]: Start difference. First operand 313 states and 441 transitions. Second operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (25), 1 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-19 01:09:27,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:09:27,401 INFO L93 Difference]: Finished difference Result 825 states and 1156 transitions. [2024-11-19 01:09:27,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:09:27,402 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (25), 1 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-19 01:09:27,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:09:27,406 INFO L225 Difference]: With dead ends: 825 [2024-11-19 01:09:27,406 INFO L226 Difference]: Without dead ends: 515 [2024-11-19 01:09:27,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:09:27,407 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 63 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:09:27,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 717 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 01:09:27,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-11-19 01:09:27,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 329. [2024-11-19 01:09:27,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 291 states have (on average 1.3780068728522337) internal successors, (401), 294 states have internal predecessors, (401), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-19 01:09:27,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 467 transitions. [2024-11-19 01:09:27,423 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 467 transitions. Word has length 190 [2024-11-19 01:09:27,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:09:27,424 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 467 transitions. [2024-11-19 01:09:27,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (25), 1 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-19 01:09:27,424 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 467 transitions. [2024-11-19 01:09:27,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 01:09:27,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:09:27,426 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-19 01:09:27,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 01:09:27,427 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:09:27,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:09:27,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1396589959, now seen corresponding path program 1 times [2024-11-19 01:09:27,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:09:27,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27091031] [2024-11-19 01:09:27,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:09:27,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:09:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:09:29,525 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-19 01:09:29,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:09:29,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27091031] [2024-11-19 01:09:29,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27091031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:09:29,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:09:29,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 01:09:29,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864952506] [2024-11-19 01:09:29,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:09:29,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 01:09:29,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:09:29,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 01:09:29,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:09:29,527 INFO L87 Difference]: Start difference. First operand 329 states and 467 transitions. Second operand has 12 states, 10 states have (on average 6.8) internal successors, (68), 12 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-19 01:09:30,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:09:30,614 INFO L93 Difference]: Finished difference Result 825 states and 1156 transitions. [2024-11-19 01:09:30,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 01:09:30,615 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.8) internal successors, (68), 12 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 3 states have call successors, (25) Word has length 190 [2024-11-19 01:09:30,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:09:30,618 INFO L225 Difference]: With dead ends: 825 [2024-11-19 01:09:30,618 INFO L226 Difference]: Without dead ends: 499 [2024-11-19 01:09:30,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2024-11-19 01:09:30,620 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 323 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 01:09:30,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 1144 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 01:09:30,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-11-19 01:09:30,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 344. [2024-11-19 01:09:30,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 306 states have (on average 1.3856209150326797) internal successors, (424), 309 states have internal predecessors, (424), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-19 01:09:30,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 490 transitions. [2024-11-19 01:09:30,634 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 490 transitions. Word has length 190 [2024-11-19 01:09:30,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:09:30,634 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 490 transitions. [2024-11-19 01:09:30,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.8) internal successors, (68), 12 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-19 01:09:30,634 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 490 transitions. [2024-11-19 01:09:30,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 01:09:30,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:09:30,637 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-19 01:09:30,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 01:09:30,637 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:09:30,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:09:30,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1361719900, now seen corresponding path program 1 times [2024-11-19 01:09:30,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:09:30,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376371139] [2024-11-19 01:09:30,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:09:30,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:09:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:09:32,742 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-19 01:09:32,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:09:32,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376371139] [2024-11-19 01:09:32,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376371139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:09:32,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:09:32,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 01:09:32,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64533481] [2024-11-19 01:09:32,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:09:32,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 01:09:32,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:09:32,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 01:09:32,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:09:32,744 INFO L87 Difference]: Start difference. First operand 344 states and 490 transitions. Second operand has 14 states, 11 states have (on average 6.181818181818182) internal successors, (68), 14 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-19 01:09:34,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:09:34,028 INFO L93 Difference]: Finished difference Result 785 states and 1104 transitions. [2024-11-19 01:09:34,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 01:09:34,028 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 6.181818181818182) internal successors, (68), 14 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 4 states have call successors, (25) Word has length 190 [2024-11-19 01:09:34,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:09:34,030 INFO L225 Difference]: With dead ends: 785 [2024-11-19 01:09:34,030 INFO L226 Difference]: Without dead ends: 444 [2024-11-19 01:09:34,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-11-19 01:09:34,031 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 228 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:09:34,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1549 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 01:09:34,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-19 01:09:34,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 339. [2024-11-19 01:09:34,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 301 states have (on average 1.3820598006644518) internal successors, (416), 304 states have internal predecessors, (416), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-19 01:09:34,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 482 transitions. [2024-11-19 01:09:34,041 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 482 transitions. Word has length 190 [2024-11-19 01:09:34,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:09:34,041 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 482 transitions. [2024-11-19 01:09:34,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 6.181818181818182) internal successors, (68), 14 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-19 01:09:34,042 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 482 transitions. [2024-11-19 01:09:34,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 01:09:34,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:09:34,043 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-19 01:09:34,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 01:09:34,043 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:09:34,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:09:34,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1566650078, now seen corresponding path program 1 times [2024-11-19 01:09:34,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:09:34,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287736153] [2024-11-19 01:09:34,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:09:34,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:09:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:09:35,360 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-19 01:09:35,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:09:35,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287736153] [2024-11-19 01:09:35,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287736153] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:09:35,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057775469] [2024-11-19 01:09:35,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:09:35,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:09:35,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:09:35,363 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-19 01:09:35,364 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-19 01:09:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:09:35,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-19 01:09:35,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:09:35,674 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-19 01:09:35,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 01:09:35,788 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-19 01:09:35,829 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-19 01:09:35,873 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-19 01:09:35,917 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-19 01:09:35,957 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-19 01:09:36,002 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-19 01:09:36,044 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-19 01:09:36,087 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-19 01:09:36,134 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-19 01:09:36,175 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-19 01:09:36,218 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-19 01:09:36,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:09:36,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 61 treesize of output 72 [2024-11-19 01:09:36,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:09:36,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 69 treesize of output 75 [2024-11-19 01:09:36,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:09:36,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 45 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 85 treesize of output 84 [2024-11-19 01:09:36,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:09:36,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 82 treesize of output 101 [2024-11-19 01:09:36,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:09:36,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 103 treesize of output 51 [2024-11-19 01:09:36,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 118 proven. 69 refuted. 0 times theorem prover too weak. 1013 trivial. 0 not checked. [2024-11-19 01:09:36,615 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:09:37,015 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-19 01:09:37,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057775469] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:09:37,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:09:37,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 18 [2024-11-19 01:09:37,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674377361] [2024-11-19 01:09:37,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:09:37,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 01:09:37,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:09:37,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 01:09:37,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-11-19 01:09:37,018 INFO L87 Difference]: Start difference. First operand 339 states and 482 transitions. Second operand has 18 states, 15 states have (on average 8.733333333333333) internal successors, (131), 18 states have internal predecessors, (131), 7 states have call successors, (51), 3 states have call predecessors, (51), 6 states have return successors, (51), 4 states have call predecessors, (51), 7 states have call successors, (51) [2024-11-19 01:09:38,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:09:38,211 INFO L93 Difference]: Finished difference Result 748 states and 1048 transitions. [2024-11-19 01:09:38,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 01:09:38,213 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 8.733333333333333) internal successors, (131), 18 states have internal predecessors, (131), 7 states have call successors, (51), 3 states have call predecessors, (51), 6 states have return successors, (51), 4 states have call predecessors, (51), 7 states have call successors, (51) Word has length 190 [2024-11-19 01:09:38,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:09:38,215 INFO L225 Difference]: With dead ends: 748 [2024-11-19 01:09:38,216 INFO L226 Difference]: Without dead ends: 412 [2024-11-19 01:09:38,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 370 SyntacticMatches, 17 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2024-11-19 01:09:38,218 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 732 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:09:38,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 442 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 01:09:38,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-19 01:09:38,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 238. [2024-11-19 01:09:38,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 204 states have (on average 1.357843137254902) internal successors, (277), 205 states have internal predecessors, (277), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-19 01:09:38,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 335 transitions. [2024-11-19 01:09:38,232 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 335 transitions. Word has length 190 [2024-11-19 01:09:38,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:09:38,232 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 335 transitions. [2024-11-19 01:09:38,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 8.733333333333333) internal successors, (131), 18 states have internal predecessors, (131), 7 states have call successors, (51), 3 states have call predecessors, (51), 6 states have return successors, (51), 4 states have call predecessors, (51), 7 states have call successors, (51) [2024-11-19 01:09:38,233 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 335 transitions. [2024-11-19 01:09:38,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 01:09:38,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:09:38,235 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-19 01:09:38,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 01:09:38,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-19 01:09:38,440 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:09:38,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:09:38,440 INFO L85 PathProgramCache]: Analyzing trace with hash -427494628, now seen corresponding path program 1 times [2024-11-19 01:09:38,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:09:38,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966668702] [2024-11-19 01:09:38,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:09:38,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:09:38,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:09:40,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-19 01:09:40,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:09:40,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966668702] [2024-11-19 01:09:40,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966668702] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:09:40,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946565045] [2024-11-19 01:09:40,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:09:40,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:09:40,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:09:40,468 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:09:40,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 01:09:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:09:40,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-19 01:09:40,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:09:40,772 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-19 01:09:40,833 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-19 01:09:40,872 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-19 01:09:40,911 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-19 01:09:40,945 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-19 01:09:40,977 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-19 01:09:41,017 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-19 01:09:41,057 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-19 01:09:41,098 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-19 01:09:41,136 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-19 01:09:41,175 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-19 01:09:41,222 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-19 01:09:41,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:09:41,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 61 treesize of output 72 [2024-11-19 01:09:41,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:09:41,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 114 treesize of output 115 [2024-11-19 01:09:41,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:09:41,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 55 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 95 treesize of output 97 [2024-11-19 01:09:41,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:09:41,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 92 treesize of output 107 [2024-11-19 01:09:41,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 282 proven. 63 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2024-11-19 01:09:41,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:09:42,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-19 01:09:42,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946565045] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:09:42,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:09:42,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 10] total 29 [2024-11-19 01:09:42,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69941832] [2024-11-19 01:09:42,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:09:42,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-19 01:09:42,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:09:42,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 01:09:42,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2024-11-19 01:09:42,303 INFO L87 Difference]: Start difference. First operand 238 states and 335 transitions. Second operand has 29 states, 25 states have (on average 6.56) internal successors, (164), 29 states have internal predecessors, (164), 9 states have call successors, (73), 3 states have call predecessors, (73), 6 states have return successors, (73), 5 states have call predecessors, (73), 9 states have call successors, (73) [2024-11-19 01:09:44,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:09:44,771 INFO L93 Difference]: Finished difference Result 649 states and 897 transitions. [2024-11-19 01:09:44,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-19 01:09:44,772 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 6.56) internal successors, (164), 29 states have internal predecessors, (164), 9 states have call successors, (73), 3 states have call predecessors, (73), 6 states have return successors, (73), 5 states have call predecessors, (73), 9 states have call successors, (73) Word has length 190 [2024-11-19 01:09:44,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:09:44,773 INFO L225 Difference]: With dead ends: 649 [2024-11-19 01:09:44,774 INFO L226 Difference]: Without dead ends: 411 [2024-11-19 01:09:44,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 378 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=392, Invalid=1500, Unknown=0, NotChecked=0, Total=1892 [2024-11-19 01:09:44,775 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 808 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 2034 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 2100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:09:44,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 861 Invalid, 2100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2034 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-19 01:09:44,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-19 01:09:44,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 186. [2024-11-19 01:09:44,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 157 states have (on average 1.356687898089172) internal successors, (213), 157 states have internal predecessors, (213), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 01:09:44,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 263 transitions. [2024-11-19 01:09:44,784 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 263 transitions. Word has length 190 [2024-11-19 01:09:44,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:09:44,784 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 263 transitions. [2024-11-19 01:09:44,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 6.56) internal successors, (164), 29 states have internal predecessors, (164), 9 states have call successors, (73), 3 states have call predecessors, (73), 6 states have return successors, (73), 5 states have call predecessors, (73), 9 states have call successors, (73) [2024-11-19 01:09:44,785 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 263 transitions. [2024-11-19 01:09:44,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 01:09:44,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:09:44,786 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-19 01:09:44,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 01:09:44,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:09:44,988 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:09:44,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:09:44,989 INFO L85 PathProgramCache]: Analyzing trace with hash -526638075, now seen corresponding path program 1 times [2024-11-19 01:09:44,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:09:44,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255627071] [2024-11-19 01:09:44,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:09:44,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:09:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:09:46,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-19 01:09:46,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:09:46,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255627071] [2024-11-19 01:09:46,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255627071] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:09:46,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785374780] [2024-11-19 01:09:46,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:09:46,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:09:46,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:09:46,883 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:09:46,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 01:09:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:09:47,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-19 01:09:47,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:09:47,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-19 01:09:47,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-19 01:09:47,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-19 01:09:47,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-19 01:09:47,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-19 01:09:47,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-19 01:09:47,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-19 01:09:47,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-19 01:09:47,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-19 01:09:47,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-19 01:09:47,395 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 21 treesize of output 9 [2024-11-19 01:09:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 352 proven. 60 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2024-11-19 01:09:47,408 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:09:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-19 01:09:47,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785374780] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:09:47,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:09:47,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 20 [2024-11-19 01:09:47,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320951770] [2024-11-19 01:09:47,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:09:47,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 01:09:47,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:09:47,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 01:09:47,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2024-11-19 01:09:47,698 INFO L87 Difference]: Start difference. First operand 186 states and 263 transitions. Second operand has 20 states, 16 states have (on average 8.0625) internal successors, (129), 20 states have internal predecessors, (129), 8 states have call successors, (71), 2 states have call predecessors, (71), 4 states have return successors, (71), 4 states have call predecessors, (71), 8 states have call successors, (71) [2024-11-19 01:09:49,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:09:49,050 INFO L93 Difference]: Finished difference Result 379 states and 522 transitions. [2024-11-19 01:09:49,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-19 01:09:49,052 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 8.0625) internal successors, (129), 20 states have internal predecessors, (129), 8 states have call successors, (71), 2 states have call predecessors, (71), 4 states have return successors, (71), 4 states have call predecessors, (71), 8 states have call successors, (71) Word has length 190 [2024-11-19 01:09:49,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:09:49,053 INFO L225 Difference]: With dead ends: 379 [2024-11-19 01:09:49,053 INFO L226 Difference]: Without dead ends: 196 [2024-11-19 01:09:49,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 377 SyntacticMatches, 12 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=330, Invalid=1740, Unknown=0, NotChecked=0, Total=2070 [2024-11-19 01:09:49,054 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 399 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:09:49,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 638 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1359 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 01:09:49,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-19 01:09:49,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 168. [2024-11-19 01:09:49,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 138 states have (on average 1.3115942028985508) internal successors, (181), 138 states have internal predecessors, (181), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 01:09:49,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 231 transitions. [2024-11-19 01:09:49,067 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 231 transitions. Word has length 190 [2024-11-19 01:09:49,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:09:49,067 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 231 transitions. [2024-11-19 01:09:49,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 8.0625) internal successors, (129), 20 states have internal predecessors, (129), 8 states have call successors, (71), 2 states have call predecessors, (71), 4 states have return successors, (71), 4 states have call predecessors, (71), 8 states have call successors, (71) [2024-11-19 01:09:49,067 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 231 transitions. [2024-11-19 01:09:49,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-19 01:09:49,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:09:49,068 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, 1, 1] [2024-11-19 01:09:49,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 01:09:49,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:09:49,269 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:09:49,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:09:49,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1268244171, now seen corresponding path program 1 times [2024-11-19 01:09:49,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:09:49,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070008811] [2024-11-19 01:09:49,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:09:49,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:09:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:09:50,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-19 01:09:50,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:09:50,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070008811] [2024-11-19 01:09:50,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070008811] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:09:50,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207762121] [2024-11-19 01:09:50,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:09:50,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:09:50,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:09:50,746 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:09:50,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 01:09:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:09:51,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-19 01:09:51,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:09:51,265 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-19 01:09:51,304 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-19 01:09:51,349 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-19 01:09:51,385 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-19 01:09:51,419 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-19 01:09:51,450 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-19 01:09:51,479 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-19 01:09:51,510 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-19 01:09:51,553 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-19 01:09:51,592 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-19 01:09:51,635 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-19 01:09:51,680 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-19 01:09:51,735 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-19 01:09:51,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 13 [2024-11-19 01:09:51,755 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 20 [2024-11-19 01:09:51,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:09:51,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 29 [2024-11-19 01:09:51,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 216 proven. 132 refuted. 0 times theorem prover too weak. 852 trivial. 0 not checked. [2024-11-19 01:09:51,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:09:52,400 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 23 treesize of output 11 [2024-11-19 01:09:52,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-19 01:09:52,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207762121] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:09:52,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:09:52,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 12] total 29 [2024-11-19 01:09:52,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65112447] [2024-11-19 01:09:52,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:09:52,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-19 01:09:52,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:09:52,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 01:09:52,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2024-11-19 01:09:52,415 INFO L87 Difference]: Start difference. First operand 168 states and 231 transitions. Second operand has 29 states, 26 states have (on average 6.923076923076923) internal successors, (180), 29 states have internal predecessors, (180), 8 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 5 states have call predecessors, (72), 8 states have call successors, (72) [2024-11-19 01:09:53,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:09:53,866 INFO L93 Difference]: Finished difference Result 392 states and 533 transitions. [2024-11-19 01:09:53,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 01:09:53,866 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 6.923076923076923) internal successors, (180), 29 states have internal predecessors, (180), 8 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 5 states have call predecessors, (72), 8 states have call successors, (72) Word has length 192 [2024-11-19 01:09:53,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:09:53,868 INFO L225 Difference]: With dead ends: 392 [2024-11-19 01:09:53,868 INFO L226 Difference]: Without dead ends: 227 [2024-11-19 01:09:53,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 381 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=305, Invalid=1255, Unknown=0, NotChecked=0, Total=1560 [2024-11-19 01:09:53,872 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 340 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 1768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:09:53,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 759 Invalid, 1768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1735 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 01:09:53,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-19 01:09:53,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 160. [2024-11-19 01:09:53,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 130 states have (on average 1.2923076923076924) internal successors, (168), 130 states have internal predecessors, (168), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 01:09:53,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 218 transitions. [2024-11-19 01:09:53,880 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 218 transitions. Word has length 192 [2024-11-19 01:09:53,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:09:53,880 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 218 transitions. [2024-11-19 01:09:53,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 6.923076923076923) internal successors, (180), 29 states have internal predecessors, (180), 8 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 5 states have call predecessors, (72), 8 states have call successors, (72) [2024-11-19 01:09:53,881 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 218 transitions. [2024-11-19 01:09:53,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-19 01:09:53,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:09:53,881 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, 1, 1] [2024-11-19 01:09:53,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 01:09:54,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-19 01:09:54,082 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:09:54,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:09:54,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1367387618, now seen corresponding path program 1 times [2024-11-19 01:09:54,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:09:54,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017196069] [2024-11-19 01:09:54,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:09:54,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:09:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:09:54,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:09:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:09:54,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:09:54,266 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:09:54,267 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 01:09:54,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 01:09:54,270 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:09:54,333 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:09:54,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:09:54 BoogieIcfgContainer [2024-11-19 01:09:54,335 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:09:54,335 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:09:54,337 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:09:54,337 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:09:54,337 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:09:15" (3/4) ... [2024-11-19 01:09:54,339 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 01:09:54,340 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:09:54,341 INFO L158 Benchmark]: Toolchain (without parser) took 40172.12ms. Allocated memory was 134.2MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 66.0MB in the beginning and 755.7MB in the end (delta: -689.7MB). Peak memory consumption was 555.0MB. Max. memory is 16.1GB. [2024-11-19 01:09:54,341 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory was 104.1MB in the beginning and 104.1MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:09:54,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.25ms. Allocated memory was 134.2MB in the beginning and 192.9MB in the end (delta: 58.7MB). Free memory was 65.7MB in the beginning and 154.8MB in the end (delta: -89.1MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2024-11-19 01:09:54,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.86ms. Allocated memory is still 192.9MB. Free memory was 154.8MB in the beginning and 149.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:09:54,341 INFO L158 Benchmark]: Boogie Preprocessor took 58.74ms. Allocated memory is still 192.9MB. Free memory was 149.5MB in the beginning and 145.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:09:54,342 INFO L158 Benchmark]: RCFGBuilder took 923.85ms. Allocated memory is still 192.9MB. Free memory was 145.3MB in the beginning and 107.6MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-19 01:09:54,342 INFO L158 Benchmark]: TraceAbstraction took 38833.65ms. Allocated memory was 192.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 106.5MB in the beginning and 755.7MB in the end (delta: -649.2MB). Peak memory consumption was 534.6MB. Max. memory is 16.1GB. [2024-11-19 01:09:54,342 INFO L158 Benchmark]: Witness Printer took 4.93ms. Allocated memory is still 1.4GB. Free memory is still 755.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:09:54,345 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory was 104.1MB in the beginning and 104.1MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.25ms. Allocated memory was 134.2MB in the beginning and 192.9MB in the end (delta: 58.7MB). Free memory was 65.7MB in the beginning and 154.8MB in the end (delta: -89.1MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.86ms. Allocated memory is still 192.9MB. Free memory was 154.8MB in the beginning and 149.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.74ms. Allocated memory is still 192.9MB. Free memory was 149.5MB in the beginning and 145.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 923.85ms. Allocated memory is still 192.9MB. Free memory was 145.3MB in the beginning and 107.6MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 38833.65ms. Allocated memory was 192.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 106.5MB in the beginning and 755.7MB in the end (delta: -649.2MB). Peak memory consumption was 534.6MB. Max. memory is 16.1GB. * Witness Printer took 4.93ms. Allocated memory is still 1.4GB. Free memory is still 755.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 138, overapproximation of someBinaryDOUBLEComparisonOperation at line 91. Possible FailurePath: [L44] unsigned char isInitial = 0; [L45-L66] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 8, 128, 64, 100, 5, 100, 32, 64, 50, 8, 0, 0, 255.5, 255.5, 64, 32.5 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L142] isInitial = 1 [L143] FCALL initially() [L144] COND TRUE 1 [L145] FCALL updateLastVariables() [L146] CALL updateVariables() [L96] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L110] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L112] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L115] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L116] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L117] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L118] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 32) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 32) VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L121] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 32) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 32) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 64) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 64) VAL [WrapperStruct00={4:0}, isInitial=1] [L123] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L124] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 32) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 32) VAL [WrapperStruct00={4:0}, isInitial=1] [L125] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L126] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L127] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1] [L127] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L127] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L128] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 64) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 64) VAL [WrapperStruct00={4:0}, isInitial=1] [L129] WrapperStruct00.var_1_18 = __VERIFIER_nondet_uchar() [L130] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L130] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L130] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L131] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L131] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L132] WrapperStruct00.var_1_21 = __VERIFIER_nondet_float() [L133] EXPR WrapperStruct00.var_1_21 [L133] EXPR WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F [L133] EXPR WrapperStruct00.var_1_21 [L133] EXPR WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L133] EXPR (WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L133] CALL assume_abort_if_not((WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L133] RET assume_abort_if_not((WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L146] RET updateVariables() [L147] CALL step() [L70] WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L70] COND TRUE WrapperStruct00.var_1_6 [L71] EXPR WrapperStruct00.var_1_10 [L71] EXPR WrapperStruct00.var_1_12 [L71] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L71] EXPR ((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13) [L71] EXPR WrapperStruct00.var_1_12 [L71] EXPR ((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13) VAL [WrapperStruct00={4:0}, isInitial=1] [L71] WrapperStruct00.var_1_11 = (WrapperStruct00.var_1_10 + ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))) [L75] EXPR WrapperStruct00.var_1_6 [L75] EXPR WrapperStruct00.var_1_6 || WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L75] unsigned char stepLocal_0 = WrapperStruct00.var_1_6 || WrapperStruct00.var_1_4; [L76] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=1] [L76] COND TRUE WrapperStruct00.var_1_5 || stepLocal_0 [L77] EXPR WrapperStruct00.var_1_15 [L77] WrapperStruct00.var_1_19 = WrapperStruct00.var_1_15 [L79] EXPR WrapperStruct00.var_1_21 [L79] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_21 [L80] EXPR WrapperStruct00.var_1_18 [L80] WrapperStruct00.var_1_22 = WrapperStruct00.var_1_18 [L81] WrapperStruct00.var_1_23 = 0.010000000000000009 [L82] EXPR WrapperStruct00.var_1_20 [L82] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L82] COND FALSE !(WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) [L85] EXPR WrapperStruct00.var_1_20 [L85] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L85] COND TRUE WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20 [L86] EXPR WrapperStruct00.var_1_5 [L86] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_5 [L91] EXPR WrapperStruct00.var_1_23 [L91] EXPR WrapperStruct00.var_1_20 [L91] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR ((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20) [L91] EXPR WrapperStruct00.var_1_20 [L91] EXPR ((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] COND FALSE !(WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) [L147] RET step() [L148] CALL, EXPR property() [L138] EXPR WrapperStruct00.var_1_20 [L138] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR (WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) [L138] EXPR WrapperStruct00.var_1_20 [L138] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR (WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) [L138] EXPR WrapperStruct00.var_1_1 [L138] EXPR WrapperStruct00.var_1_6 [L138] EXPR (WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR (WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR ((WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR (((WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : 1)) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_10 + ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))) : (WrapperStruct00.var_1_11 == ((unsigned char) (((64 + WrapperStruct00.var_1_14) + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16)) - (WrapperStruct00.var_1_17 + WrapperStruct00.var_1_18))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR ((((WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : 1)) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_10 + ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))) : (WrapperStruct00.var_1_11 == ((unsigned char) (((64 + WrapperStruct00.var_1_14) + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16)) - (WrapperStruct00.var_1_17 + WrapperStruct00.var_1_18)))))) && ((WrapperStruct00.var_1_5 || (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_15)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR (((((WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : 1)) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_10 + ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))) : (WrapperStruct00.var_1_11 == ((unsigned char) (((64 + WrapperStruct00.var_1_14) + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16)) - (WrapperStruct00.var_1_17 + WrapperStruct00.var_1_18)))))) && ((WrapperStruct00.var_1_5 || (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_15)) : 1)) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21)) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR ((((((WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : 1)) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_10 + ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))) : (WrapperStruct00.var_1_11 == ((unsigned char) (((64 + WrapperStruct00.var_1_14) + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16)) - (WrapperStruct00.var_1_17 + WrapperStruct00.var_1_18)))))) && ((WrapperStruct00.var_1_5 || (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_15)) : 1)) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21))) && (WrapperStruct00.var_1_22 == ((unsigned short int) WrapperStruct00.var_1_18)) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR (((((((WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : 1)) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_10 + ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))) : (WrapperStruct00.var_1_11 == ((unsigned char) (((64 + WrapperStruct00.var_1_14) + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16)) - (WrapperStruct00.var_1_17 + WrapperStruct00.var_1_18)))))) && ((WrapperStruct00.var_1_5 || (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_15)) : 1)) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21))) && (WrapperStruct00.var_1_22 == ((unsigned short int) WrapperStruct00.var_1_18))) && (WrapperStruct00.var_1_23 == ((double) 0.010000000000000009)) VAL [WrapperStruct00={4:0}, isInitial=1] [L138-L139] return (((((((WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : 1)) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_10 + ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))) : (WrapperStruct00.var_1_11 == ((unsigned char) (((64 + WrapperStruct00.var_1_14) + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16)) - (WrapperStruct00.var_1_17 + WrapperStruct00.var_1_18)))))) && ((WrapperStruct00.var_1_5 || (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_15)) : 1)) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21))) && (WrapperStruct00.var_1_22 == ((unsigned short int) WrapperStruct00.var_1_18))) && (WrapperStruct00.var_1_23 == ((double) 0.010000000000000009)) ; [L148] RET, EXPR property() [L148] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 120 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.7s, OverallIterations: 15, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3311 SdHoareTripleChecker+Valid, 9.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3293 mSDsluCounter, 9577 SdHoareTripleChecker+Invalid, 8.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7818 mSDsCounter, 413 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9551 IncrementalHoareTripleChecker+Invalid, 9964 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 413 mSolverCounterUnsat, 1759 mSDtfsCounter, 9551 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2068 GetRequests, 1813 SyntacticMatches, 33 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1517 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=344occurred in iteration=9, InterpolantAutomatonStates: 174, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 1115 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 23.3s InterpolantComputationTime, 3806 NumberOfCodeBlocks, 3806 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 4353 ConstructedInterpolants, 0 QuantifiedInterpolants, 21151 SizeOfPredicates, 17 NumberOfNonLiveVariables, 3327 ConjunctsInSsa, 205 ConjunctsInUnsatCore, 23 InterpolantComputations, 10 PerfectInterpolantSequences, 26715/27600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 01:09:54,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-61.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac494cf4bb95ee7173afff6e37d6c8217c99c93b386253d4b81910df4df15de3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:09:56,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:09:56,273 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 01:09:56,277 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:09:56,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:09:56,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:09:56,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:09:56,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:09:56,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:09:56,306 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:09:56,307 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:09:56,307 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:09:56,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:09:56,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:09:56,307 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:09:56,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:09:56,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:09:56,308 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:09:56,308 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:09:56,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:09:56,308 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:09:56,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:09:56,310 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:09:56,310 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 01:09:56,310 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 01:09:56,310 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:09:56,311 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 01:09:56,311 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:09:56,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:09:56,311 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:09:56,311 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:09:56,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:09:56,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:09:56,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:09:56,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:09:56,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:09:56,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:09:56,313 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:09:56,313 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 01:09:56,314 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 01:09:56,314 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:09:56,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:09:56,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:09:56,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:09:56,314 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 -> ac494cf4bb95ee7173afff6e37d6c8217c99c93b386253d4b81910df4df15de3 [2024-11-19 01:09:56,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:09:56,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:09:56,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:09:56,577 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:09:56,577 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:09:56,578 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-61.i [2024-11-19 01:09:57,818 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:09:57,980 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:09:57,981 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-61.i [2024-11-19 01:09:57,987 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a82e49cc9/cfd5223208f849fc916347aff129cc15/FLAG5b74aba37 [2024-11-19 01:09:58,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a82e49cc9/cfd5223208f849fc916347aff129cc15 [2024-11-19 01:09:58,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:09:58,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:09:58,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:09:58,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:09:58,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:09:58,393 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:09:58" (1/1) ... [2024-11-19 01:09:58,394 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50bdfed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:58, skipping insertion in model container [2024-11-19 01:09:58,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:09:58" (1/1) ... [2024-11-19 01:09:58,418 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:09:58,554 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-61.i[916,929] [2024-11-19 01:09:58,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:09:58,641 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:09:58,652 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-61.i[916,929] [2024-11-19 01:09:58,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:09:58,715 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:09:58,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:58 WrapperNode [2024-11-19 01:09:58,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:09:58,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:09:58,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:09:58,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:09:58,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:58" (1/1) ... [2024-11-19 01:09:58,743 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:58" (1/1) ... [2024-11-19 01:09:58,791 INFO L138 Inliner]: procedures = 37, calls = 184, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 503 [2024-11-19 01:09:58,795 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:09:58,796 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:09:58,796 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:09:58,796 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:09:58,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:58" (1/1) ... [2024-11-19 01:09:58,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:58" (1/1) ... [2024-11-19 01:09:58,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:58" (1/1) ... [2024-11-19 01:09:58,838 INFO L175 MemorySlicer]: Split 148 memory accesses to 2 slices as follows [2, 146]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 44 writes are split as follows [0, 44]. [2024-11-19 01:09:58,839 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:58" (1/1) ... [2024-11-19 01:09:58,839 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:58" (1/1) ... [2024-11-19 01:09:58,861 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:58" (1/1) ... [2024-11-19 01:09:58,868 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:58" (1/1) ... [2024-11-19 01:09:58,870 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:58" (1/1) ... [2024-11-19 01:09:58,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:58" (1/1) ... [2024-11-19 01:09:58,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:09:58,880 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:09:58,880 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:09:58,880 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:09:58,881 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:58" (1/1) ... [2024-11-19 01:09:58,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:09:58,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:09:58,909 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-19 01:09:58,911 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-19 01:09:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:09:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 01:09:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 01:09:58,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-19 01:09:58,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-19 01:09:58,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 01:09:58,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 01:09:58,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 01:09:58,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 01:09:58,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 01:09:58,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 01:09:58,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 01:09:58,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 01:09:58,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 01:09:58,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 01:09:58,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 01:09:58,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 01:09:58,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-19 01:09:58,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-19 01:09:58,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-19 01:09:58,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-19 01:09:58,954 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:09:58,954 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:09:58,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-19 01:09:58,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-19 01:09:58,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:09:58,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:09:58,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 01:09:58,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 01:09:58,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 01:09:58,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 01:09:59,070 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:09:59,071 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:09:59,707 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-11-19 01:09:59,707 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:09:59,718 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:09:59,718 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:09:59,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:09:59 BoogieIcfgContainer [2024-11-19 01:09:59,718 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:09:59,719 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:09:59,719 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:09:59,722 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:09:59,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:09:58" (1/3) ... [2024-11-19 01:09:59,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8690747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:09:59, skipping insertion in model container [2024-11-19 01:09:59,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:09:58" (2/3) ... [2024-11-19 01:09:59,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8690747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:09:59, skipping insertion in model container [2024-11-19 01:09:59,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:09:59" (3/3) ... [2024-11-19 01:09:59,723 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-61.i [2024-11-19 01:09:59,735 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:09:59,735 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:09:59,779 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:09:59,784 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;@341e477a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:09:59,785 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:09:59,788 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-19 01:09:59,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 01:09:59,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:09:59,803 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-19 01:09:59,803 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:09:59,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:09:59,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1439989331, now seen corresponding path program 1 times [2024-11-19 01:09:59,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:09:59,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [479844217] [2024-11-19 01:09:59,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:09:59,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:09:59,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:09:59,821 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:09:59,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 01:10:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:10:00,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:10:00,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:10:00,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-11-19 01:10:00,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:10:00,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:10:00,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [479844217] [2024-11-19 01:10:00,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [479844217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:10:00,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:10:00,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:10:00,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431552368] [2024-11-19 01:10:00,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:10:00,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:10:00,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:10:00,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:10:00,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:10:00,191 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 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 01:10:00,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:10:00,220 INFO L93 Difference]: Finished difference Result 233 states and 369 transitions. [2024-11-19 01:10:00,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:10:00,222 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 190 [2024-11-19 01:10:00,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:10:00,227 INFO L225 Difference]: With dead ends: 233 [2024-11-19 01:10:00,227 INFO L226 Difference]: Without dead ends: 116 [2024-11-19 01:10:00,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 189 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-19 01:10:00,232 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-19 01:10:00,233 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-19 01:10:00,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-19 01:10:00,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-19 01:10:00,270 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-19 01:10:00,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2024-11-19 01:10:00,273 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 190 [2024-11-19 01:10:00,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:10:00,275 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2024-11-19 01:10:00,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 01:10:00,275 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2024-11-19 01:10:00,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 01:10:00,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:10:00,278 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-19 01:10:00,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 01:10:00,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:10:00,479 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:10:00,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:10:00,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1080109377, now seen corresponding path program 1 times [2024-11-19 01:10:00,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:10:00,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028724529] [2024-11-19 01:10:00,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:10:00,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:10:00,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:10:00,483 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:10:00,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 01:10:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:10:00,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 01:10:00,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:10:00,809 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-19 01:10:00,809 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:10:00,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:10:00,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028724529] [2024-11-19 01:10:00,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028724529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:10:00,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:10:00,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:10:00,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510383102] [2024-11-19 01:10:00,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:10:00,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:10:00,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:10:00,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:10:00,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:10:00,813 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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-19 01:10:00,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:10:00,886 INFO L93 Difference]: Finished difference Result 236 states and 343 transitions. [2024-11-19 01:10:00,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:10:00,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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-19 01:10:00,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:10:00,888 INFO L225 Difference]: With dead ends: 236 [2024-11-19 01:10:00,888 INFO L226 Difference]: Without dead ends: 123 [2024-11-19 01:10:00,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:10:00,890 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:10:00,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 784 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:10:00,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-19 01:10:00,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-11-19 01:10:00,900 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-19 01:10:00,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 174 transitions. [2024-11-19 01:10:00,902 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 174 transitions. Word has length 190 [2024-11-19 01:10:00,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:10:00,903 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 174 transitions. [2024-11-19 01:10:00,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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-19 01:10:00,903 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 174 transitions. [2024-11-19 01:10:00,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 01:10:00,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:10:00,905 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-19 01:10:00,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 01:10:01,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:10:01,106 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:10:01,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:10:01,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1760167747, now seen corresponding path program 1 times [2024-11-19 01:10:01,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:10:01,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150286324] [2024-11-19 01:10:01,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:10:01,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:10:01,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:10:01,109 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:10:01,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 01:10:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:10:01,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 01:10:01,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:10:01,426 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-19 01:10:01,426 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:10:01,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:10:01,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150286324] [2024-11-19 01:10:01,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150286324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:10:01,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:10:01,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 01:10:01,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536353185] [2024-11-19 01:10:01,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:10:01,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:10:01,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:10:01,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:10:01,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:10:01,428 INFO L87 Difference]: Start difference. First operand 122 states and 174 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-19 01:10:01,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:10:01,529 INFO L93 Difference]: Finished difference Result 246 states and 352 transitions. [2024-11-19 01:10:01,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:10:01,530 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-19 01:10:01,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:10:01,531 INFO L225 Difference]: With dead ends: 246 [2024-11-19 01:10:01,531 INFO L226 Difference]: Without dead ends: 127 [2024-11-19 01:10:01,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:10:01,533 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:10:01,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1076 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:10:01,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-19 01:10:01,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2024-11-19 01:10:01,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 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-19 01:10:01,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 178 transitions. [2024-11-19 01:10:01,541 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 178 transitions. Word has length 190 [2024-11-19 01:10:01,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:10:01,542 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 178 transitions. [2024-11-19 01:10:01,542 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-19 01:10:01,542 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 178 transitions. [2024-11-19 01:10:01,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 01:10:01,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:10:01,547 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-19 01:10:01,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 01:10:01,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:10:01,748 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:10:01,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:10:01,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1762014789, now seen corresponding path program 1 times [2024-11-19 01:10:01,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:10:01,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365385060] [2024-11-19 01:10:01,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:10:01,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:10:01,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:10:01,752 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:10:01,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 01:10:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:10:01,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:10:01,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:10:02,031 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 55 treesize of output 19 [2024-11-19 01:10:02,091 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-19 01:10:02,092 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:10:02,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:10:02,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1365385060] [2024-11-19 01:10:02,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1365385060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:10:02,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:10:02,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:10:02,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053340922] [2024-11-19 01:10:02,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:10:02,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:10:02,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:10:02,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:10:02,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:10:02,097 INFO L87 Difference]: Start difference. First operand 126 states and 178 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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-19 01:10:02,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:10:02,223 INFO L93 Difference]: Finished difference Result 249 states and 353 transitions. [2024-11-19 01:10:02,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:10:02,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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-19 01:10:02,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:10:02,225 INFO L225 Difference]: With dead ends: 249 [2024-11-19 01:10:02,225 INFO L226 Difference]: Without dead ends: 126 [2024-11-19 01:10:02,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:10:02,227 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:10:02,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 327 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:10:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-19 01:10:02,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-19 01:10:02,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 99 states have (on average 1.2828282828282829) internal successors, (127), 99 states have internal predecessors, (127), 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-19 01:10:02,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 177 transitions. [2024-11-19 01:10:02,241 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 177 transitions. Word has length 190 [2024-11-19 01:10:02,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:10:02,243 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 177 transitions. [2024-11-19 01:10:02,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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-19 01:10:02,243 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 177 transitions. [2024-11-19 01:10:02,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 01:10:02,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:10:02,247 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-19 01:10:02,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-19 01:10:02,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:10:02,448 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:10:02,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:10:02,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1980869507, now seen corresponding path program 1 times [2024-11-19 01:10:02,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:10:02,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [15274130] [2024-11-19 01:10:02,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:10:02,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:10:02,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:10:02,451 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:10:02,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 01:10:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:10:02,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 01:10:02,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:10:02,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 01:10:02,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2024-11-19 01:10:02,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2024-11-19 01:10:03,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:03,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2024-11-19 01:10:03,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:03,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 56 [2024-11-19 01:10:03,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:03,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 69 [2024-11-19 01:10:03,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:03,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 82 treesize of output 72 [2024-11-19 01:10:04,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:04,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 77 treesize of output 82 [2024-11-19 01:10:04,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:04,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 87 treesize of output 95 [2024-11-19 01:10:04,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:04,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 97 treesize of output 108 [2024-11-19 01:10:05,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:05,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 112 treesize of output 111 [2024-11-19 01:10:05,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:05,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 103 treesize of output 43 [2024-11-19 01:10:05,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 998 proven. 114 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-19 01:10:05,346 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:10:05,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 24 proven. 114 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2024-11-19 01:10:05,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:10:05,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [15274130] [2024-11-19 01:10:05,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [15274130] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:10:05,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:10:05,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 23 [2024-11-19 01:10:05,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142675051] [2024-11-19 01:10:05,665 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:10:05,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-19 01:10:05,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:10:05,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 01:10:05,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2024-11-19 01:10:05,668 INFO L87 Difference]: Start difference. First operand 126 states and 177 transitions. Second operand has 23 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 23 states have internal predecessors, (128), 14 states have call successors, (46), 10 states have call predecessors, (46), 12 states have return successors, (46), 10 states have call predecessors, (46), 14 states have call successors, (46) [2024-11-19 01:10:09,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:10:09,121 INFO L93 Difference]: Finished difference Result 307 states and 404 transitions. [2024-11-19 01:10:09,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-19 01:10:09,122 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 23 states have internal predecessors, (128), 14 states have call successors, (46), 10 states have call predecessors, (46), 12 states have return successors, (46), 10 states have call predecessors, (46), 14 states have call successors, (46) Word has length 190 [2024-11-19 01:10:09,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:10:09,124 INFO L225 Difference]: With dead ends: 307 [2024-11-19 01:10:09,126 INFO L226 Difference]: Without dead ends: 184 [2024-11-19 01:10:09,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 356 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=592, Invalid=1664, Unknown=0, NotChecked=0, Total=2256 [2024-11-19 01:10:09,128 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 234 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-19 01:10:09,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 632 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-19 01:10:09,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-19 01:10:09,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 171. [2024-11-19 01:10:09,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 131 states have (on average 1.2061068702290076) internal successors, (158), 132 states have internal predecessors, (158), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-19 01:10:09,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 216 transitions. [2024-11-19 01:10:09,164 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 216 transitions. Word has length 190 [2024-11-19 01:10:09,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:10:09,165 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 216 transitions. [2024-11-19 01:10:09,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 23 states have internal predecessors, (128), 14 states have call successors, (46), 10 states have call predecessors, (46), 12 states have return successors, (46), 10 states have call predecessors, (46), 14 states have call successors, (46) [2024-11-19 01:10:09,165 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 216 transitions. [2024-11-19 01:10:09,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-19 01:10:09,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:10:09,168 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, 1, 1] [2024-11-19 01:10:09,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 01:10:09,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:10:09,373 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:10:09,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:10:09,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1126429922, now seen corresponding path program 1 times [2024-11-19 01:10:09,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:10:09,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454795034] [2024-11-19 01:10:09,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:10:09,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:10:09,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:10:09,377 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:10:09,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 01:10:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:10:09,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-19 01:10:09,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:10:09,679 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 19 treesize of output 1 [2024-11-19 01:10:09,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-19 01:10:09,796 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:09,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-11-19 01:10:09,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:09,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2024-11-19 01:10:09,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:09,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-11-19 01:10:10,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:10,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-11-19 01:10:10,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:10,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-11-19 01:10:10,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:10,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-11-19 01:10:10,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:10,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2024-11-19 01:10:10,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:10,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2024-11-19 01:10:10,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:10,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2024-11-19 01:10:10,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:10,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2024-11-19 01:10:10,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:10,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 68 [2024-11-19 01:10:10,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:10,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 75 treesize of output 71 [2024-11-19 01:10:10,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:10,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 98 treesize of output 91 [2024-11-19 01:10:13,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:13,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 95 treesize of output 106 [2024-11-19 01:10:13,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:13,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 110 treesize of output 109 [2024-11-19 01:10:13,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:13,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 135 treesize of output 63 [2024-11-19 01:10:13,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 834 proven. 63 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2024-11-19 01:10:13,884 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:10:14,049 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-19 01:10:14,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:10:14,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454795034] [2024-11-19 01:10:14,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454795034] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:10:14,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:10:14,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 18 [2024-11-19 01:10:14,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429258523] [2024-11-19 01:10:14,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:10:14,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:10:14,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:10:14,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:10:14,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=248, Unknown=1, NotChecked=0, Total=306 [2024-11-19 01:10:14,051 INFO L87 Difference]: Start difference. First operand 171 states and 216 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-19 01:10:14,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:10:14,588 INFO L93 Difference]: Finished difference Result 396 states and 500 transitions. [2024-11-19 01:10:14,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:10:14,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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 192 [2024-11-19 01:10:14,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:10:14,592 INFO L225 Difference]: With dead ends: 396 [2024-11-19 01:10:14,592 INFO L226 Difference]: Without dead ends: 237 [2024-11-19 01:10:14,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=69, Invalid=350, Unknown=1, NotChecked=0, Total=420 [2024-11-19 01:10:14,595 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 65 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 01:10:14,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 628 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 01:10:14,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-19 01:10:14,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 234. [2024-11-19 01:10:14,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 190 states have (on average 1.236842105263158) internal successors, (235), 192 states have internal predecessors, (235), 31 states have call successors, (31), 12 states have call predecessors, (31), 12 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-19 01:10:14,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 297 transitions. [2024-11-19 01:10:14,614 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 297 transitions. Word has length 192 [2024-11-19 01:10:14,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:10:14,615 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 297 transitions. [2024-11-19 01:10:14,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-19 01:10:14,616 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 297 transitions. [2024-11-19 01:10:14,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-19 01:10:14,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:10:14,617 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, 1, 1] [2024-11-19 01:10:14,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 01:10:14,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:10:14,820 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:10:14,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:10:14,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1174392668, now seen corresponding path program 1 times [2024-11-19 01:10:14,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:10:14,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987788158] [2024-11-19 01:10:14,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:10:14,821 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:10:14,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:10:14,822 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:10:14,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 01:10:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:10:15,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 01:10:15,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:10:15,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 01:10:15,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 48 [2024-11-19 01:10:15,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:15,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 51 [2024-11-19 01:10:15,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:15,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 94 [2024-11-19 01:10:15,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:15,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 151 treesize of output 88 [2024-11-19 01:10:15,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:10:15,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 214 treesize of output 76 [2024-11-19 01:10:16,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-19 01:10:16,012 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:10:16,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:10:16,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [987788158] [2024-11-19 01:10:16,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [987788158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:10:16,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:10:16,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 01:10:16,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257034256] [2024-11-19 01:10:16,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:10:16,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 01:10:16,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:10:16,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 01:10:16,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:10:16,016 INFO L87 Difference]: Start difference. First operand 234 states and 297 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 10 states have internal predecessors, (73), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 01:10:21,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 01:10:22,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:10:22,648 INFO L93 Difference]: Finished difference Result 671 states and 851 transitions. [2024-11-19 01:10:22,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 01:10:22,648 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 10 states have internal predecessors, (73), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 192 [2024-11-19 01:10:22,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:10:22,651 INFO L225 Difference]: With dead ends: 671 [2024-11-19 01:10:22,651 INFO L226 Difference]: Without dead ends: 453 [2024-11-19 01:10:22,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:10:22,652 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 345 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:10:22,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 474 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-11-19 01:10:22,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-11-19 01:10:22,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 450. [2024-11-19 01:10:22,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 367 states have (on average 1.2343324250681198) internal successors, (453), 371 states have internal predecessors, (453), 58 states have call successors, (58), 24 states have call predecessors, (58), 24 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-19 01:10:22,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 569 transitions. [2024-11-19 01:10:22,696 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 569 transitions. Word has length 192 [2024-11-19 01:10:22,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:10:22,697 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 569 transitions. [2024-11-19 01:10:22,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 10 states have internal predecessors, (73), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 01:10:22,697 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 569 transitions. [2024-11-19 01:10:22,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-19 01:10:22,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:10:22,698 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, 1, 1] [2024-11-19 01:10:22,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 01:10:22,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:10:22,899 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:10:22,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:10:22,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1597094494, now seen corresponding path program 1 times [2024-11-19 01:10:22,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:10:22,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511245680] [2024-11-19 01:10:22,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:10:22,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:10:22,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:10:22,902 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:10:22,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 01:10:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:10:23,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:10:23,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:10:23,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 01:10:23,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-11-19 01:10:23,225 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 82 treesize of output 28 [2024-11-19 01:10:23,262 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-19 01:10:23,262 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:10:23,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:10:23,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511245680] [2024-11-19 01:10:23,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1511245680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:10:23,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:10:23,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:10:23,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399863859] [2024-11-19 01:10:23,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:10:23,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:10:23,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:10:23,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:10:23,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:10:23,263 INFO L87 Difference]: Start difference. First operand 450 states and 569 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-19 01:10:27,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 01:10:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:10:29,079 INFO L93 Difference]: Finished difference Result 942 states and 1180 transitions. [2024-11-19 01:10:29,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:10:29,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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 192 [2024-11-19 01:10:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:10:29,082 INFO L225 Difference]: With dead ends: 942 [2024-11-19 01:10:29,082 INFO L226 Difference]: Without dead ends: 508 [2024-11-19 01:10:29,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:10:29,083 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 76 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-19 01:10:29,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 433 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 226 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2024-11-19 01:10:29,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-11-19 01:10:29,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 470. [2024-11-19 01:10:29,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 379 states have (on average 1.2216358839050132) internal successors, (463), 383 states have internal predecessors, (463), 63 states have call successors, (63), 27 states have call predecessors, (63), 27 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-19 01:10:29,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 589 transitions. [2024-11-19 01:10:29,125 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 589 transitions. Word has length 192 [2024-11-19 01:10:29,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:10:29,125 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 589 transitions. [2024-11-19 01:10:29,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-19 01:10:29,126 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 589 transitions. [2024-11-19 01:10:29,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-19 01:10:29,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:10:29,127 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, 1, 1] [2024-11-19 01:10:29,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 01:10:29,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:10:29,328 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:10:29,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:10:29,328 INFO L85 PathProgramCache]: Analyzing trace with hash -604584649, now seen corresponding path program 1 times [2024-11-19 01:10:29,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:10:29,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100470623] [2024-11-19 01:10:29,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:10:29,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:10:29,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:10:29,330 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:10:29,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 01:10:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:10:29,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:10:29,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:10:29,526 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 55 treesize of output 19 [2024-11-19 01:10:29,536 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-19 01:10:29,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:10:29,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:10:29,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1100470623] [2024-11-19 01:10:29,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1100470623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:10:29,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:10:29,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:10:29,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511376283] [2024-11-19 01:10:29,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:10:29,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:10:29,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:10:29,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:10:29,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:10:29,537 INFO L87 Difference]: Start difference. First operand 470 states and 589 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-19 01:10:29,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:10:29,579 INFO L93 Difference]: Finished difference Result 908 states and 1137 transitions. [2024-11-19 01:10:29,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:10:29,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 192 [2024-11-19 01:10:29,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:10:29,585 INFO L225 Difference]: With dead ends: 908 [2024-11-19 01:10:29,585 INFO L226 Difference]: Without dead ends: 454 [2024-11-19 01:10:29,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:10:29,587 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:10:29,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 319 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:10:29,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-11-19 01:10:29,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2024-11-19 01:10:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 363 states have (on average 1.2038567493112948) internal successors, (437), 367 states have internal predecessors, (437), 63 states have call successors, (63), 27 states have call predecessors, (63), 27 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-19 01:10:29,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 563 transitions. [2024-11-19 01:10:29,632 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 563 transitions. Word has length 192 [2024-11-19 01:10:29,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:10:29,632 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 563 transitions. [2024-11-19 01:10:29,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-19 01:10:29,633 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 563 transitions. [2024-11-19 01:10:29,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-19 01:10:29,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:10:29,634 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, 1, 1] [2024-11-19 01:10:29,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-19 01:10:29,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:10:29,834 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:10:29,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:10:29,835 INFO L85 PathProgramCache]: Analyzing trace with hash -837741602, now seen corresponding path program 1 times [2024-11-19 01:10:29,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:10:29,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018112564] [2024-11-19 01:10:29,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:10:29,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:10:29,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:10:29,838 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:10:29,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 01:10:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:10:30,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:10:30,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:10:30,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 01:10:30,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 26 [2024-11-19 01:10:30,152 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 80 treesize of output 26 [2024-11-19 01:10:30,170 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-19 01:10:30,170 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:10:30,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:10:30,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018112564] [2024-11-19 01:10:30,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018112564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:10:30,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:10:30,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:10:30,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541294354] [2024-11-19 01:10:30,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:10:30,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:10:30,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:10:30,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:10:30,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:10:30,172 INFO L87 Difference]: Start difference. First operand 454 states and 563 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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)