./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-43.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 3866fcabc53f8729ce5445d739af818fee4df02a7fd7be02b76364ea8cb9d346 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:41:26,853 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:41:26,928 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:41:26,931 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:41:26,932 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:41:26,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:41:26,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:41:26,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:41:26,950 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:41:26,950 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:41:26,951 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:41:26,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:41:26,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:41:26,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:41:26,952 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:41:26,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:41:26,952 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:41:26,953 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:41:26,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:41:26,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:41:26,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:41:26,956 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:41:26,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:41:26,957 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:41:26,957 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:41:26,957 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:41:26,957 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:41:26,957 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:41:26,958 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:41:26,958 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:41:26,958 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:41:26,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:41:26,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:41:26,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:41:26,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:41:26,959 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:41:26,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:41:26,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:41:26,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:41:26,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:41:26,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:41:26,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:41:26,961 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 -> 3866fcabc53f8729ce5445d739af818fee4df02a7fd7be02b76364ea8cb9d346 [2024-11-12 07:41:27,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:41:27,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:41:27,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:41:27,172 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:41:27,173 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:41:27,173 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-43.i [2024-11-12 07:41:28,430 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:41:28,588 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:41:28,588 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-43.i [2024-11-12 07:41:28,596 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853385fe5/e7a53b7e32bb48d1a20b193bdf529971/FLAGfadc13a0d [2024-11-12 07:41:28,999 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853385fe5/e7a53b7e32bb48d1a20b193bdf529971 [2024-11-12 07:41:29,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:41:29,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:41:29,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:41:29,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:41:29,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:41:29,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:41:29" (1/1) ... [2024-11-12 07:41:29,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e79688a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:29, skipping insertion in model container [2024-11-12 07:41:29,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:41:29" (1/1) ... [2024-11-12 07:41:29,041 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:41:29,196 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-43.i[916,929] [2024-11-12 07:41:29,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:41:29,263 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:41:29,272 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-43.i[916,929] [2024-11-12 07:41:29,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:41:29,328 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:41:29,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:29 WrapperNode [2024-11-12 07:41:29,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:41:29,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:41:29,330 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:41:29,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:41:29,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:29" (1/1) ... [2024-11-12 07:41:29,353 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:29" (1/1) ... [2024-11-12 07:41:29,383 INFO L138 Inliner]: procedures = 30, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 541 [2024-11-12 07:41:29,383 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:41:29,384 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:41:29,384 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:41:29,384 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:41:29,392 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:29" (1/1) ... [2024-11-12 07:41:29,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:29" (1/1) ... [2024-11-12 07:41:29,398 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:29" (1/1) ... [2024-11-12 07:41:29,403 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-12 07:41:29,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:29" (1/1) ... [2024-11-12 07:41:29,404 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:29" (1/1) ... [2024-11-12 07:41:29,417 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:29" (1/1) ... [2024-11-12 07:41:29,421 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:29" (1/1) ... [2024-11-12 07:41:29,423 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:29" (1/1) ... [2024-11-12 07:41:29,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:29" (1/1) ... [2024-11-12 07:41:29,437 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:41:29,438 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:41:29,438 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:41:29,438 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:41:29,439 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:29" (1/1) ... [2024-11-12 07:41:29,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:41:29,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:41:29,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 07:41:29,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 07:41:29,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:41:29,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-12 07:41:29,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-12 07:41:29,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-12 07:41:29,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 07:41:29,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-12 07:41:29,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 07:41:29,524 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:41:29,525 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:41:29,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 07:41:29,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:41:29,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:41:29,622 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:41:29,624 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:41:30,098 INFO L? ?]: Removed 133 outVars from TransFormulas that were not future-live. [2024-11-12 07:41:30,099 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:41:30,113 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:41:30,113 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:41:30,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:41:30 BoogieIcfgContainer [2024-11-12 07:41:30,114 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:41:30,115 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:41:30,115 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:41:30,119 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:41:30,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:41:29" (1/3) ... [2024-11-12 07:41:30,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6dc3b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:41:30, skipping insertion in model container [2024-11-12 07:41:30,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:29" (2/3) ... [2024-11-12 07:41:30,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6dc3b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:41:30, skipping insertion in model container [2024-11-12 07:41:30,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:41:30" (3/3) ... [2024-11-12 07:41:30,122 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-43.i [2024-11-12 07:41:30,135 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:41:30,136 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:41:30,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:41:30,194 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;@277478ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:41:30,194 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:41:30,199 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:41:30,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 07:41:30,208 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:41:30,209 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:41:30,209 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:41:30,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:41:30,213 INFO L85 PathProgramCache]: Analyzing trace with hash 2025586780, now seen corresponding path program 1 times [2024-11-12 07:41:30,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:41:30,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206687345] [2024-11-12 07:41:30,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:30,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:41:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:30,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:41:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:30,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:41:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:30,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:41:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:30,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:41:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:30,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:41:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:30,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:41:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:30,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:41:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:30,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:41:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:30,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:41:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:30,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:41:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:30,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:41:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:30,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:41:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:30,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:41:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:30,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:41:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:30,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:41:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:30,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:41:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:30,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:41:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:30,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:41:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:30,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 07:41:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:30,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 07:41:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:30,662 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:41:30,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:41:30,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206687345] [2024-11-12 07:41:30,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206687345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:41:30,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:41:30,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:41:30,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723883778] [2024-11-12 07:41:30,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:41:30,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:41:30,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:41:30,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:41:30,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:41:30,693 INFO L87 Difference]: Start difference. First operand has 126 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:41:30,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:41:30,719 INFO L93 Difference]: Finished difference Result 245 states and 388 transitions. [2024-11-12 07:41:30,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:41:30,721 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 168 [2024-11-12 07:41:30,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:41:30,727 INFO L225 Difference]: With dead ends: 245 [2024-11-12 07:41:30,727 INFO L226 Difference]: Without dead ends: 122 [2024-11-12 07:41:30,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:41:30,732 INFO L435 NwaCegarLoop]: 180 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, 180 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:41:30,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:41:30,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-12 07:41:30,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-12 07:41:30,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:41:30,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2024-11-12 07:41:30,765 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 168 [2024-11-12 07:41:30,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:41:30,766 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2024-11-12 07:41:30,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:41:30,766 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2024-11-12 07:41:30,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 07:41:30,769 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:41:30,769 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:41:30,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:41:30,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:41:30,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:41:30,770 INFO L85 PathProgramCache]: Analyzing trace with hash 176494844, now seen corresponding path program 1 times [2024-11-12 07:41:30,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:41:30,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653118343] [2024-11-12 07:41:30,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:30,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:41:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:41:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:41:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:41:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:41:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:41:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:41:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:41:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:41:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:41:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:41:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:41:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:41:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:41:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:41:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:41:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:41:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:41:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:41:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 07:41:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 07:41:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,059 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:41:31,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:41:31,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653118343] [2024-11-12 07:41:31,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653118343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:41:31,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:41:31,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:41:31,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234657334] [2024-11-12 07:41:31,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:41:31,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:41:31,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:41:31,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:41:31,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:41:31,064 INFO L87 Difference]: Start difference. First operand 122 states and 180 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:41:31,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:41:31,105 INFO L93 Difference]: Finished difference Result 243 states and 360 transitions. [2024-11-12 07:41:31,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:41:31,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 168 [2024-11-12 07:41:31,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:41:31,107 INFO L225 Difference]: With dead ends: 243 [2024-11-12 07:41:31,107 INFO L226 Difference]: Without dead ends: 124 [2024-11-12 07:41:31,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:41:31,109 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:41:31,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 523 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:41:31,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-12 07:41:31,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-12 07:41:31,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 102 states have (on average 1.392156862745098) internal successors, (142), 102 states have internal predecessors, (142), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:41:31,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 182 transitions. [2024-11-12 07:41:31,120 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 182 transitions. Word has length 168 [2024-11-12 07:41:31,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:41:31,121 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 182 transitions. [2024-11-12 07:41:31,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:41:31,122 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 182 transitions. [2024-11-12 07:41:31,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 07:41:31,127 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:41:31,127 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:41:31,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:41:31,127 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:41:31,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:41:31,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1720484614, now seen corresponding path program 1 times [2024-11-12 07:41:31,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:41:31,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592367510] [2024-11-12 07:41:31,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:31,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:41:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:41:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:41:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:41:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:41:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:41:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:41:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:41:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:41:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:41:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:41:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:41:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:41:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:41:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:41:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:41:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:41:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:41:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:41:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 07:41:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 07:41:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,377 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:41:31,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:41:31,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592367510] [2024-11-12 07:41:31,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592367510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:41:31,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:41:31,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:41:31,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795757082] [2024-11-12 07:41:31,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:41:31,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:41:31,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:41:31,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:41:31,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:41:31,383 INFO L87 Difference]: Start difference. First operand 124 states and 182 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:41:31,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:41:31,418 INFO L93 Difference]: Finished difference Result 248 states and 365 transitions. [2024-11-12 07:41:31,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:41:31,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 168 [2024-11-12 07:41:31,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:41:31,420 INFO L225 Difference]: With dead ends: 248 [2024-11-12 07:41:31,420 INFO L226 Difference]: Without dead ends: 127 [2024-11-12 07:41:31,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:41:31,421 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 1 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:41:31,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 520 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:41:31,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-12 07:41:31,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2024-11-12 07:41:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:41:31,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 184 transitions. [2024-11-12 07:41:31,437 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 184 transitions. Word has length 168 [2024-11-12 07:41:31,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:41:31,439 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 184 transitions. [2024-11-12 07:41:31,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:41:31,440 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 184 transitions. [2024-11-12 07:41:31,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 07:41:31,444 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:41:31,444 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:41:31,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:41:31,445 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:41:31,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:41:31,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1040426244, now seen corresponding path program 1 times [2024-11-12 07:41:31,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:41:31,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134810459] [2024-11-12 07:41:31,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:31,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:41:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:41:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:41:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:41:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:41:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:41:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:41:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:41:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:41:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:41:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:41:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:41:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:41:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:41:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:41:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:41:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:41:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:41:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:41:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 07:41:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 07:41:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,654 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:41:31,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:41:31,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134810459] [2024-11-12 07:41:31,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134810459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:41:31,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:41:31,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:41:31,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691195382] [2024-11-12 07:41:31,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:41:31,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:41:31,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:41:31,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:41:31,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:41:31,658 INFO L87 Difference]: Start difference. First operand 126 states and 184 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:41:31,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:41:31,685 INFO L93 Difference]: Finished difference Result 252 states and 369 transitions. [2024-11-12 07:41:31,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:41:31,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 168 [2024-11-12 07:41:31,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:41:31,690 INFO L225 Difference]: With dead ends: 252 [2024-11-12 07:41:31,691 INFO L226 Difference]: Without dead ends: 129 [2024-11-12 07:41:31,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:41:31,693 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 1 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:41:31,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 521 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:41:31,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-12 07:41:31,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2024-11-12 07:41:31,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 106 states have internal predecessors, (146), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:41:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 186 transitions. [2024-11-12 07:41:31,699 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 186 transitions. Word has length 168 [2024-11-12 07:41:31,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:41:31,700 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 186 transitions. [2024-11-12 07:41:31,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:41:31,700 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 186 transitions. [2024-11-12 07:41:31,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 07:41:31,702 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:41:31,702 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:41:31,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:41:31,702 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:41:31,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:41:31,703 INFO L85 PathProgramCache]: Analyzing trace with hash 734581118, now seen corresponding path program 1 times [2024-11-12 07:41:31,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:41:31,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081170167] [2024-11-12 07:41:31,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:31,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:41:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:41:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:41:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:41:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:41:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:41:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:41:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:41:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:41:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:41:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:41:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:41:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:41:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:41:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:41:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:41:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:41:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:41:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:41:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 07:41:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 07:41:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:31,885 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:41:31,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:41:31,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081170167] [2024-11-12 07:41:31,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081170167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:41:31,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:41:31,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:41:31,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198159914] [2024-11-12 07:41:31,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:41:31,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:41:31,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:41:31,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:41:31,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:41:31,889 INFO L87 Difference]: Start difference. First operand 128 states and 186 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:41:31,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:41:31,917 INFO L93 Difference]: Finished difference Result 256 states and 373 transitions. [2024-11-12 07:41:31,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:41:31,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 168 [2024-11-12 07:41:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:41:31,918 INFO L225 Difference]: With dead ends: 256 [2024-11-12 07:41:31,919 INFO L226 Difference]: Without dead ends: 131 [2024-11-12 07:41:31,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:41:31,920 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 1 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:41:31,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 523 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:41:31,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-12 07:41:31,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-12 07:41:31,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 108 states have internal predecessors, (148), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:41:31,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 188 transitions. [2024-11-12 07:41:31,926 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 188 transitions. Word has length 168 [2024-11-12 07:41:31,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:41:31,926 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 188 transitions. [2024-11-12 07:41:31,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:41:31,927 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 188 transitions. [2024-11-12 07:41:31,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 07:41:31,928 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:41:31,928 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:41:31,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 07:41:31,928 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:41:31,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:41:31,928 INFO L85 PathProgramCache]: Analyzing trace with hash 736428160, now seen corresponding path program 1 times [2024-11-12 07:41:31,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:41:31,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777672515] [2024-11-12 07:41:31,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:31,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:41:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:32,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:41:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:32,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:41:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:32,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:41:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:32,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:41:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:32,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:41:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:32,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:41:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:32,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:41:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:32,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:41:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:32,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:41:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:32,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:41:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:32,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:41:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:32,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:41:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:32,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:41:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:32,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:41:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:32,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:41:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:32,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:41:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:32,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:41:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:32,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:41:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:32,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 07:41:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:32,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 07:41:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:32,491 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:41:32,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:41:32,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777672515] [2024-11-12 07:41:32,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777672515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:41:32,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:41:32,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:41:32,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173766988] [2024-11-12 07:41:32,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:41:32,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:41:32,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:41:32,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:41:32,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:41:32,493 INFO L87 Difference]: Start difference. First operand 130 states and 188 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:41:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:41:32,800 INFO L93 Difference]: Finished difference Result 371 states and 535 transitions. [2024-11-12 07:41:32,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:41:32,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 168 [2024-11-12 07:41:32,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:41:32,803 INFO L225 Difference]: With dead ends: 371 [2024-11-12 07:41:32,803 INFO L226 Difference]: Without dead ends: 244 [2024-11-12 07:41:32,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:41:32,805 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 136 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:41:32,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1005 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:41:32,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-12 07:41:32,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 138. [2024-11-12 07:41:32,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:41:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 199 transitions. [2024-11-12 07:41:32,819 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 199 transitions. Word has length 168 [2024-11-12 07:41:32,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:41:32,819 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 199 transitions. [2024-11-12 07:41:32,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:41:32,820 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 199 transitions. [2024-11-12 07:41:32,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 07:41:32,823 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:41:32,823 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:41:32,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 07:41:32,823 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:41:32,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:41:32,824 INFO L85 PathProgramCache]: Analyzing trace with hash -284640194, now seen corresponding path program 1 times [2024-11-12 07:41:32,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:41:32,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559183341] [2024-11-12 07:41:32,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:32,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:41:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:33,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:41:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:33,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:41:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:33,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:41:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:33,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:41:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:33,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:41:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:33,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:41:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:33,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:41:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:33,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:41:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:33,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:41:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:33,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:41:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:33,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:41:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:33,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:41:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:33,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:41:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:33,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:41:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:33,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:41:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:33,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:41:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:33,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:41:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:33,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:41:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:33,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 07:41:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:33,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 07:41:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:33,574 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:41:33,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:41:33,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559183341] [2024-11-12 07:41:33,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559183341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:41:33,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:41:33,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:41:33,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62413113] [2024-11-12 07:41:33,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:41:33,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:41:33,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:41:33,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:41:33,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:41:33,576 INFO L87 Difference]: Start difference. First operand 138 states and 199 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:41:34,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:41:34,037 INFO L93 Difference]: Finished difference Result 378 states and 544 transitions. [2024-11-12 07:41:34,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:41:34,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 168 [2024-11-12 07:41:34,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:41:34,039 INFO L225 Difference]: With dead ends: 378 [2024-11-12 07:41:34,039 INFO L226 Difference]: Without dead ends: 243 [2024-11-12 07:41:34,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:41:34,040 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 225 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:41:34,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 696 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:41:34,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-12 07:41:34,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 138. [2024-11-12 07:41:34,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 116 states have internal predecessors, (158), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:41:34,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 198 transitions. [2024-11-12 07:41:34,046 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 198 transitions. Word has length 168 [2024-11-12 07:41:34,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:41:34,047 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 198 transitions. [2024-11-12 07:41:34,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:41:34,047 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 198 transitions. [2024-11-12 07:41:34,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 07:41:34,048 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:41:34,048 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:41:34,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 07:41:34,048 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:41:34,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:41:34,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1058318679, now seen corresponding path program 1 times [2024-11-12 07:41:34,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:41:34,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052476240] [2024-11-12 07:41:34,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:34,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:41:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:34,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:41:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:34,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:41:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:34,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:41:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:34,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:41:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:34,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:41:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:34,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:41:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:34,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:41:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:34,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:41:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:34,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:41:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:34,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:41:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:35,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:41:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:35,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:41:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:35,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:41:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:35,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:41:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:35,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:41:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:35,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:41:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:35,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:41:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:35,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:41:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:35,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 07:41:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:35,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 07:41:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:35,027 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-12 07:41:35,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:41:35,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052476240] [2024-11-12 07:41:35,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052476240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:41:35,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914010890] [2024-11-12 07:41:35,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:35,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:41:35,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:41:35,030 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 07:41:35,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 07:41:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:35,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-12 07:41:35,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:41:35,386 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 29 treesize of output 13 [2024-11-12 07:41:35,411 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 29 treesize of output 13 [2024-11-12 07:41:35,430 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 29 treesize of output 13 [2024-11-12 07:41:35,462 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 29 treesize of output 13 [2024-11-12 07:41:35,501 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 29 treesize of output 13 [2024-11-12 07:41:35,526 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 29 treesize of output 13 [2024-11-12 07:41:35,548 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 29 treesize of output 13 [2024-11-12 07:41:35,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:41:35,576 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 40 treesize of output 49 [2024-11-12 07:41:35,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:41:35,626 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 49 treesize of output 13 [2024-11-12 07:41:35,643 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 267 proven. 45 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-11-12 07:41:35,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:41:35,853 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-12 07:41:35,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914010890] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 07:41:35,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 07:41:35,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2024-11-12 07:41:35,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624426013] [2024-11-12 07:41:35,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 07:41:35,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 07:41:35,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:41:35,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 07:41:35,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-11-12 07:41:35,856 INFO L87 Difference]: Start difference. First operand 138 states and 198 transitions. Second operand has 17 states, 14 states have (on average 10.285714285714286) internal successors, (144), 17 states have internal predecessors, (144), 8 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (56), 5 states have call predecessors, (56), 8 states have call successors, (56) [2024-11-12 07:41:36,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:41:36,752 INFO L93 Difference]: Finished difference Result 315 states and 449 transitions. [2024-11-12 07:41:36,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 07:41:36,754 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 10.285714285714286) internal successors, (144), 17 states have internal predecessors, (144), 8 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (56), 5 states have call predecessors, (56), 8 states have call successors, (56) Word has length 168 [2024-11-12 07:41:36,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:41:36,755 INFO L225 Difference]: With dead ends: 315 [2024-11-12 07:41:36,755 INFO L226 Difference]: Without dead ends: 180 [2024-11-12 07:41:36,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2024-11-12 07:41:36,756 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 503 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:41:36,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 622 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 07:41:36,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-12 07:41:36,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2024-11-12 07:41:36,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 149 states have (on average 1.3557046979865772) internal successors, (202), 150 states have internal predecessors, (202), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 07:41:36,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 250 transitions. [2024-11-12 07:41:36,766 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 250 transitions. Word has length 168 [2024-11-12 07:41:36,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:41:36,766 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 250 transitions. [2024-11-12 07:41:36,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 10.285714285714286) internal successors, (144), 17 states have internal predecessors, (144), 8 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (56), 5 states have call predecessors, (56), 8 states have call successors, (56) [2024-11-12 07:41:36,766 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 250 transitions. [2024-11-12 07:41:36,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-12 07:41:36,767 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:41:36,768 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:41:36,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 07:41:36,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:41:36,972 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:41:36,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:41:36,972 INFO L85 PathProgramCache]: Analyzing trace with hash 39089738, now seen corresponding path program 1 times [2024-11-12 07:41:36,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:41:36,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292477163] [2024-11-12 07:41:36,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:36,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:41:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:37,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:41:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:37,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:41:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:37,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:41:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:37,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:41:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:37,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:41:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:37,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:41:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:37,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:41:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:37,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:41:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:37,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:41:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:37,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:41:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:37,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:41:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:37,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:41:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:37,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:41:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:37,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:41:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:37,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:41:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:37,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:41:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:37,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:41:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:37,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:41:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:37,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 07:41:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:37,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 07:41:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:37,865 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-12 07:41:37,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:41:37,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292477163] [2024-11-12 07:41:37,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292477163] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:41:37,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992955361] [2024-11-12 07:41:37,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:37,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:41:37,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:41:37,868 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 07:41:37,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 07:41:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:38,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-12 07:41:38,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:41:38,168 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 29 treesize of output 13 [2024-11-12 07:41:38,192 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 29 treesize of output 13 [2024-11-12 07:41:38,215 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 29 treesize of output 13 [2024-11-12 07:41:38,235 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 29 treesize of output 13 [2024-11-12 07:41:38,258 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 29 treesize of output 13 [2024-11-12 07:41:38,281 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 29 treesize of output 13 [2024-11-12 07:41:38,303 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 29 treesize of output 13 [2024-11-12 07:41:38,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:41:38,335 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 40 treesize of output 49 [2024-11-12 07:41:38,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:41:38,373 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 49 treesize of output 13 [2024-11-12 07:41:38,404 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 267 proven. 45 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-11-12 07:41:38,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:41:38,609 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-12 07:41:38,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992955361] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 07:41:38,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 07:41:38,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 20 [2024-11-12 07:41:38,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172174026] [2024-11-12 07:41:38,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 07:41:38,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-12 07:41:38,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:41:38,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-12 07:41:38,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2024-11-12 07:41:38,612 INFO L87 Difference]: Start difference. First operand 177 states and 250 transitions. Second operand has 20 states, 18 states have (on average 6.333333333333333) internal successors, (114), 20 states have internal predecessors, (114), 5 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (51), 3 states have call predecessors, (51), 5 states have call successors, (51) [2024-11-12 07:41:39,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:41:39,583 INFO L93 Difference]: Finished difference Result 325 states and 456 transitions. [2024-11-12 07:41:39,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 07:41:39,584 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 6.333333333333333) internal successors, (114), 20 states have internal predecessors, (114), 5 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (51), 3 states have call predecessors, (51), 5 states have call successors, (51) Word has length 169 [2024-11-12 07:41:39,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:41:39,585 INFO L225 Difference]: With dead ends: 325 [2024-11-12 07:41:39,585 INFO L226 Difference]: Without dead ends: 182 [2024-11-12 07:41:39,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2024-11-12 07:41:39,586 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 258 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:41:39,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 958 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 07:41:39,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-12 07:41:39,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2024-11-12 07:41:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 151 states have (on average 1.3509933774834437) internal successors, (204), 152 states have internal predecessors, (204), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 07:41:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 252 transitions. [2024-11-12 07:41:39,593 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 252 transitions. Word has length 169 [2024-11-12 07:41:39,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:41:39,594 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 252 transitions. [2024-11-12 07:41:39,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 6.333333333333333) internal successors, (114), 20 states have internal predecessors, (114), 5 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (51), 3 states have call predecessors, (51), 5 states have call successors, (51) [2024-11-12 07:41:39,594 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 252 transitions. [2024-11-12 07:41:39,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-12 07:41:39,595 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:41:39,595 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:41:39,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 07:41:39,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-12 07:41:39,796 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:41:39,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:41:39,796 INFO L85 PathProgramCache]: Analyzing trace with hash 179638348, now seen corresponding path program 1 times [2024-11-12 07:41:39,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:41:39,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221699052] [2024-11-12 07:41:39,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:39,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:41:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:40,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:41:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:40,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:41:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:40,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:41:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:40,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:41:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:40,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:41:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:40,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:41:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:40,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:41:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:40,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:41:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:40,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:41:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:40,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:41:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:40,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:41:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:40,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:41:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:40,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:41:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:40,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:41:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:40,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:41:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:40,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:41:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:40,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:41:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:40,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:41:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:40,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 07:41:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:40,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 07:41:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:40,162 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-12 07:41:40,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:41:40,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221699052] [2024-11-12 07:41:40,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221699052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:41:40,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:41:40,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 07:41:40,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999567215] [2024-11-12 07:41:40,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:41:40,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:41:40,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:41:40,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:41:40,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:41:40,165 INFO L87 Difference]: Start difference. First operand 179 states and 252 transitions. Second operand has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:41:40,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:41:40,654 INFO L93 Difference]: Finished difference Result 324 states and 451 transitions. [2024-11-12 07:41:40,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 07:41:40,655 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-12 07:41:40,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:41:40,657 INFO L225 Difference]: With dead ends: 324 [2024-11-12 07:41:40,657 INFO L226 Difference]: Without dead ends: 179 [2024-11-12 07:41:40,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-11-12 07:41:40,658 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 233 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:41:40,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 406 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:41:40,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-12 07:41:40,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2024-11-12 07:41:40,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 146 states have (on average 1.3424657534246576) internal successors, (196), 147 states have internal predecessors, (196), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 07:41:40,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 244 transitions. [2024-11-12 07:41:40,668 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 244 transitions. Word has length 169 [2024-11-12 07:41:40,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:41:40,669 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 244 transitions. [2024-11-12 07:41:40,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:41:40,669 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 244 transitions. [2024-11-12 07:41:40,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-12 07:41:40,671 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:41:40,671 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:41:40,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 07:41:40,671 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:41:40,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:41:40,672 INFO L85 PathProgramCache]: Analyzing trace with hash 280449655, now seen corresponding path program 1 times [2024-11-12 07:41:40,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:41:40,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417339720] [2024-11-12 07:41:40,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:40,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:41:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:41,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:41:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:41,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:41:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:41,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:41:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:41,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:41:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:41,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:41:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:41,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:41:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:41,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:41:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:41,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:41:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:41,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:41:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:41,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:41:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:41,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:41:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:41,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:41:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:41,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:41:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:41,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:41:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:41,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:41:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:41,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:41:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:41,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:41:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:41,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:41:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:41,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 07:41:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:41,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 07:41:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:41,080 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:41:41,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:41:41,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417339720] [2024-11-12 07:41:41,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417339720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:41:41,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:41:41,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:41:41,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019068512] [2024-11-12 07:41:41,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:41:41,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:41:41,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:41:41,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:41:41,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:41:41,082 INFO L87 Difference]: Start difference. First operand 175 states and 244 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:41:41,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:41:41,447 INFO L93 Difference]: Finished difference Result 439 states and 605 transitions. [2024-11-12 07:41:41,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:41:41,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-12 07:41:41,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:41:41,450 INFO L225 Difference]: With dead ends: 439 [2024-11-12 07:41:41,450 INFO L226 Difference]: Without dead ends: 298 [2024-11-12 07:41:41,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:41:41,451 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 229 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:41:41,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 432 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:41:41,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-12 07:41:41,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 286. [2024-11-12 07:41:41,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 236 states have (on average 1.3305084745762712) internal successors, (314), 238 states have internal predecessors, (314), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-12 07:41:41,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 398 transitions. [2024-11-12 07:41:41,470 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 398 transitions. Word has length 169 [2024-11-12 07:41:41,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:41:41,471 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 398 transitions. [2024-11-12 07:41:41,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:41:41,471 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 398 transitions. [2024-11-12 07:41:41,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-12 07:41:41,473 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:41:41,473 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:41:41,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 07:41:41,474 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:41:41,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:41:41,474 INFO L85 PathProgramCache]: Analyzing trace with hash -740618699, now seen corresponding path program 1 times [2024-11-12 07:41:41,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:41:41,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424173040] [2024-11-12 07:41:41,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:41,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:41:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:42,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:41:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:42,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:41:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:42,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:41:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:42,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:41:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:42,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:41:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:42,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:41:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:42,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:41:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:42,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:41:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:42,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:41:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:42,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:41:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:42,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:41:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:42,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:41:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:42,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:41:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:42,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:41:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:42,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:41:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:42,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:41:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:42,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:41:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:42,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:41:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:42,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 07:41:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:42,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 07:41:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:42,694 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:41:42,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:41:42,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424173040] [2024-11-12 07:41:42,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424173040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:41:42,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:41:42,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:41:42,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884774725] [2024-11-12 07:41:42,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:41:42,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:41:42,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:41:42,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:41:42,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:41:42,695 INFO L87 Difference]: Start difference. First operand 286 states and 398 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:41:43,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:41:43,196 INFO L93 Difference]: Finished difference Result 972 states and 1343 transitions. [2024-11-12 07:41:43,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:41:43,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 169 [2024-11-12 07:41:43,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:41:43,200 INFO L225 Difference]: With dead ends: 972 [2024-11-12 07:41:43,200 INFO L226 Difference]: Without dead ends: 720 [2024-11-12 07:41:43,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:41:43,201 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 309 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:41:43,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 940 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:41:43,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2024-11-12 07:41:43,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 499. [2024-11-12 07:41:43,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 406 states have (on average 1.3152709359605912) internal successors, (534), 407 states have internal predecessors, (534), 78 states have call successors, (78), 14 states have call predecessors, (78), 14 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-12 07:41:43,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 690 transitions. [2024-11-12 07:41:43,240 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 690 transitions. Word has length 169 [2024-11-12 07:41:43,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:41:43,241 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 690 transitions. [2024-11-12 07:41:43,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:41:43,241 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 690 transitions. [2024-11-12 07:41:43,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-12 07:41:43,242 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:41:43,242 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:41:43,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 07:41:43,242 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:41:43,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:41:43,243 INFO L85 PathProgramCache]: Analyzing trace with hash 602340174, now seen corresponding path program 1 times [2024-11-12 07:41:43,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:41:43,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672597892] [2024-11-12 07:41:43,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:43,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:41:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:43,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:41:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:43,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:41:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:43,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:41:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:43,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:41:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:43,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:41:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:43,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:41:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:43,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:41:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:43,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:41:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:43,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:41:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:43,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:41:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:43,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:41:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:43,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:41:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:43,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:41:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:43,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:41:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:43,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:41:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:43,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:41:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:43,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:41:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:43,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:41:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:43,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 07:41:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:43,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 07:41:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:43,676 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:41:43,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:41:43,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672597892] [2024-11-12 07:41:43,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672597892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:41:43,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:41:43,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:41:43,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753393707] [2024-11-12 07:41:43,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:41:43,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:41:43,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:41:43,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:41:43,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:41:43,678 INFO L87 Difference]: Start difference. First operand 499 states and 690 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:41:44,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:41:44,056 INFO L93 Difference]: Finished difference Result 1174 states and 1612 transitions. [2024-11-12 07:41:44,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:41:44,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-12 07:41:44,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:41:44,060 INFO L225 Difference]: With dead ends: 1174 [2024-11-12 07:41:44,060 INFO L226 Difference]: Without dead ends: 745 [2024-11-12 07:41:44,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:41:44,063 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 133 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:41:44,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 541 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:41:44,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2024-11-12 07:41:44,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 501. [2024-11-12 07:41:44,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 408 states have (on average 1.3137254901960784) internal successors, (536), 409 states have internal predecessors, (536), 78 states have call successors, (78), 14 states have call predecessors, (78), 14 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-12 07:41:44,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 692 transitions. [2024-11-12 07:41:44,089 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 692 transitions. Word has length 169 [2024-11-12 07:41:44,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:41:44,091 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 692 transitions. [2024-11-12 07:41:44,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:41:44,091 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 692 transitions. [2024-11-12 07:41:44,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-12 07:41:44,092 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:41:44,093 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:41:44,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 07:41:44,093 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:41:44,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:41:44,093 INFO L85 PathProgramCache]: Analyzing trace with hash -418728180, now seen corresponding path program 1 times [2024-11-12 07:41:44,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:41:44,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980607452] [2024-11-12 07:41:44,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:44,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:41:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:41:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:41:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:41:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:41:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:41:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:41:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:41:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:41:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:41:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:41:44,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:41:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:41:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:41:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:41:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:41:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:41:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:41:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:41:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 07:41:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 07:41:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,226 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:41:44,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:41:44,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980607452] [2024-11-12 07:41:44,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980607452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:41:44,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:41:44,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:41:44,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791736271] [2024-11-12 07:41:44,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:41:44,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:41:44,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:41:44,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:41:44,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:41:44,229 INFO L87 Difference]: Start difference. First operand 501 states and 692 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:41:44,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:41:44,262 INFO L93 Difference]: Finished difference Result 941 states and 1298 transitions. [2024-11-12 07:41:44,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:41:44,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 169 [2024-11-12 07:41:44,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:41:44,264 INFO L225 Difference]: With dead ends: 941 [2024-11-12 07:41:44,264 INFO L226 Difference]: Without dead ends: 510 [2024-11-12 07:41:44,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:41:44,265 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:41:44,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 690 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:41:44,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-11-12 07:41:44,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 508. [2024-11-12 07:41:44,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 415 states have (on average 1.308433734939759) internal successors, (543), 416 states have internal predecessors, (543), 78 states have call successors, (78), 14 states have call predecessors, (78), 14 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-12 07:41:44,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 699 transitions. [2024-11-12 07:41:44,284 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 699 transitions. Word has length 169 [2024-11-12 07:41:44,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:41:44,285 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 699 transitions. [2024-11-12 07:41:44,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:41:44,285 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 699 transitions. [2024-11-12 07:41:44,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-12 07:41:44,285 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:41:44,286 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:41:44,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 07:41:44,286 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:41:44,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:41:44,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1586488949, now seen corresponding path program 1 times [2024-11-12 07:41:44,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:41:44,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327844479] [2024-11-12 07:41:44,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:44,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:41:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:41:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:41:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:41:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:41:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:41:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:41:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:41:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:41:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:41:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:41:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:41:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:41:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:41:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:41:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:41:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:41:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:41:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:41:44,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 07:41:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 07:41:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:44,724 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-12 07:41:44,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:41:44,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327844479] [2024-11-12 07:41:44,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327844479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:41:44,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:41:44,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 07:41:44,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327645125] [2024-11-12 07:41:44,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:41:44,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:41:44,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:41:44,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:41:44,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:41:44,726 INFO L87 Difference]: Start difference. First operand 508 states and 699 transitions. Second operand has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:41:45,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:41:45,257 INFO L93 Difference]: Finished difference Result 960 states and 1314 transitions. [2024-11-12 07:41:45,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 07:41:45,258 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-12 07:41:45,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:41:45,260 INFO L225 Difference]: With dead ends: 960 [2024-11-12 07:41:45,260 INFO L226 Difference]: Without dead ends: 522 [2024-11-12 07:41:45,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2024-11-12 07:41:45,261 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 339 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:41:45,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 401 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:41:45,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-11-12 07:41:45,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 508. [2024-11-12 07:41:45,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 415 states have (on average 1.3012048192771084) internal successors, (540), 416 states have internal predecessors, (540), 78 states have call successors, (78), 14 states have call predecessors, (78), 14 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-12 07:41:45,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 696 transitions. [2024-11-12 07:41:45,282 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 696 transitions. Word has length 169 [2024-11-12 07:41:45,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:41:45,282 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 696 transitions. [2024-11-12 07:41:45,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:41:45,282 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 696 transitions. [2024-11-12 07:41:45,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-12 07:41:45,283 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:41:45,283 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:41:45,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 07:41:45,283 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:41:45,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:41:45,283 INFO L85 PathProgramCache]: Analyzing trace with hash 2009190775, now seen corresponding path program 1 times [2024-11-12 07:41:45,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:41:45,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81837805] [2024-11-12 07:41:45,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:45,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:41:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:45,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:41:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:45,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:41:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:45,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:41:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:45,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:41:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:45,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:41:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:45,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:41:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:45,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:41:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:45,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:41:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:45,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:41:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:45,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:41:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:45,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:41:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:45,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:41:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:45,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:41:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:45,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:41:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:45,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:41:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:45,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:41:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:45,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:41:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:45,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:41:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:45,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 07:41:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:45,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 07:41:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:45,612 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:41:45,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:41:45,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81837805] [2024-11-12 07:41:45,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81837805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:41:45,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:41:45,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:41:45,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93035555] [2024-11-12 07:41:45,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:41:45,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:41:45,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:41:45,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:41:45,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:41:45,613 INFO L87 Difference]: Start difference. First operand 508 states and 696 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:41:46,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:41:46,050 INFO L93 Difference]: Finished difference Result 1179 states and 1607 transitions. [2024-11-12 07:41:46,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:41:46,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-12 07:41:46,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:41:46,053 INFO L225 Difference]: With dead ends: 1179 [2024-11-12 07:41:46,053 INFO L226 Difference]: Without dead ends: 741 [2024-11-12 07:41:46,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:41:46,056 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 229 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:41:46,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 476 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:41:46,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2024-11-12 07:41:46,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 505. [2024-11-12 07:41:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 412 states have (on average 1.296116504854369) internal successors, (534), 413 states have internal predecessors, (534), 78 states have call successors, (78), 14 states have call predecessors, (78), 14 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-12 07:41:46,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 690 transitions. [2024-11-12 07:41:46,087 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 690 transitions. Word has length 169 [2024-11-12 07:41:46,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:41:46,087 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 690 transitions. [2024-11-12 07:41:46,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:41:46,088 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 690 transitions. [2024-11-12 07:41:46,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-12 07:41:46,088 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:41:46,089 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:41:46,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 07:41:46,089 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:41:46,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:41:46,089 INFO L85 PathProgramCache]: Analyzing trace with hash 988122421, now seen corresponding path program 1 times [2024-11-12 07:41:46,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:41:46,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958726162] [2024-11-12 07:41:46,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:46,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:41:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 07:41:46,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [561917110] [2024-11-12 07:41:46,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:46,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:41:46,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:41:46,159 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 07:41:46,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 07:41:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:41:47,365 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 07:41:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:41:48,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 07:41:48,151 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 07:41:48,152 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 07:41:48,172 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-12 07:41:48,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:41:48,356 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:41:48,403 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 07:41:48,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:41:48 BoogieIcfgContainer [2024-11-12 07:41:48,405 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 07:41:48,405 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 07:41:48,405 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 07:41:48,405 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 07:41:48,406 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:41:30" (3/4) ... [2024-11-12 07:41:48,407 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 07:41:48,408 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 07:41:48,409 INFO L158 Benchmark]: Toolchain (without parser) took 19403.76ms. Allocated memory was 130.0MB in the beginning and 604.0MB in the end (delta: 474.0MB). Free memory was 61.0MB in the beginning and 524.8MB in the end (delta: -463.7MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-11-12 07:41:48,409 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 130.0MB. Free memory is still 91.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:41:48,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.69ms. Allocated memory was 130.0MB in the beginning and 197.1MB in the end (delta: 67.1MB). Free memory was 60.8MB in the beginning and 155.7MB in the end (delta: -95.0MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2024-11-12 07:41:48,411 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.11ms. Allocated memory is still 197.1MB. Free memory was 155.7MB in the beginning and 150.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:41:48,411 INFO L158 Benchmark]: Boogie Preprocessor took 53.28ms. Allocated memory is still 197.1MB. Free memory was 150.5MB in the beginning and 146.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:41:48,411 INFO L158 Benchmark]: RCFGBuilder took 676.03ms. Allocated memory is still 197.1MB. Free memory was 146.3MB in the beginning and 108.6MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-12 07:41:48,411 INFO L158 Benchmark]: TraceAbstraction took 18289.66ms. Allocated memory was 197.1MB in the beginning and 604.0MB in the end (delta: 406.8MB). Free memory was 107.5MB in the beginning and 524.8MB in the end (delta: -417.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:41:48,411 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 604.0MB. Free memory is still 524.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:41:48,412 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 130.0MB. Free memory is still 91.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.69ms. Allocated memory was 130.0MB in the beginning and 197.1MB in the end (delta: 67.1MB). Free memory was 60.8MB in the beginning and 155.7MB in the end (delta: -95.0MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.11ms. Allocated memory is still 197.1MB. Free memory was 155.7MB in the beginning and 150.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.28ms. Allocated memory is still 197.1MB. Free memory was 150.5MB in the beginning and 146.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 676.03ms. Allocated memory is still 197.1MB. Free memory was 146.3MB in the beginning and 108.6MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 18289.66ms. Allocated memory was 197.1MB in the beginning and 604.0MB in the end (delta: 406.8MB). Free memory was 107.5MB in the beginning and 524.8MB in the end (delta: -417.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 604.0MB. Free memory is still 524.8MB. 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 131. Possible FailurePath: [L42] unsigned char isInitial = 0; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 64, 4.5, 64.8, 64.4, 0.2, 10000, 1, 50, 8, 2, 100, 128, 23647, 32, 0, -50, 0, 0 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] FCALL updateLastVariables() [L139] CALL updateVariables() [L95] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L96] EXPR WrapperStruct00.var_1_2 [L96] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_2 [L96] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L96] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 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] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L98] EXPR WrapperStruct00.var_1_3 [L98] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L98] EXPR WrapperStruct00.var_1_3 [L98] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 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] [L98] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L100] EXPR WrapperStruct00.var_1_4 [L100] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F [L100] EXPR WrapperStruct00.var_1_4 [L100] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L100] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 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] [L100] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] WrapperStruct00.var_1_5 = __VERIFIER_nondet_float() [L102] EXPR WrapperStruct00.var_1_5 [L102] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_5 [L102] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR (WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 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] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L103] WrapperStruct00.var_1_7 = __VERIFIER_nondet_short() [L104] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 8191) 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_7 >= 8191) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] WrapperStruct00.var_1_8 = __VERIFIER_nondet_short() [L107] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) 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_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 8192) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 8192) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] WrapperStruct00.var_1_9 = __VERIFIER_nondet_short() [L110] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 8191) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 8191) VAL [WrapperStruct00={4:0}, isInitial=1] [L112] WrapperStruct00.var_1_10 = __VERIFIER_nondet_short() [L113] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L113] 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] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L116] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) 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_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L117] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] WrapperStruct00.var_1_16 = __VERIFIER_nondet_ushort() [L119] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 16383) 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_16 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L121] WrapperStruct00.var_1_19 = __VERIFIER_nondet_char() [L122] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= -127) 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_19 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1] [L123] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L124] WrapperStruct00.var_1_21 = __VERIFIER_nondet_uchar() [L125] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_21 >= 0) 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_21 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L126] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_21 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_21 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L139] RET updateVariables() [L140] CALL step() [L66] EXPR WrapperStruct00.var_1_19 [L66] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_19 [L67] EXPR WrapperStruct00.var_1_21 [L67] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_21 [L68] EXPR WrapperStruct00.var_1_18 [L68] signed char stepLocal_1 = WrapperStruct00.var_1_18; [L69] EXPR WrapperStruct00.var_1_9 [L69] EXPR WrapperStruct00.var_1_7 [L69] signed long int stepLocal_0 = WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7; [L70] EXPR WrapperStruct00.var_1_8 [L70] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0, stepLocal_1=0] [L70] EXPR WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0, stepLocal_1=0] [L70] COND FALSE !(stepLocal_1 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) [L77] EXPR WrapperStruct00.var_1_7 [L77] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0] [L77] EXPR WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0] [L77] signed long int stepLocal_2 = WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18; [L78] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0, stepLocal_2=10001] [L78] COND FALSE !(WrapperStruct00.var_1_14 >= stepLocal_2) [L81] EXPR WrapperStruct00.var_1_2 [L81] EXPR WrapperStruct00.var_1_3 [L81] EXPR WrapperStruct00.var_1_4 [L81] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0] [L81] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) [L81] EXPR WrapperStruct00.var_1_3 [L81] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0] [L81] COND TRUE WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) [L82] WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0] [L82] COND FALSE !(WrapperStruct00.var_1_20) [L92] EXPR WrapperStruct00.var_1_1 [L92] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_1 [L140] RET step() [L141] CALL, EXPR property() [L131] EXPR WrapperStruct00.var_1_2 [L131] EXPR WrapperStruct00.var_1_3 [L131] EXPR WrapperStruct00.var_1_4 [L131] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) [L131] EXPR WrapperStruct00.var_1_3 [L131] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13))) [L131] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)) [L131] EXPR WrapperStruct00.var_1_1 [L131] EXPR WrapperStruct00.var_1_13 [L131] EXPR WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13))) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)))) && ((WrapperStruct00.var_1_18 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) ? (((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7) > -25) ? (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (((WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)))) && ((WrapperStruct00.var_1_18 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) ? (((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7) > -25) ? (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14))) : 1)) && ((WrapperStruct00.var_1_14 >= (WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_15 == ((unsigned short int) (WrapperStruct00.var_1_14 + (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_13)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((((WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)))) && ((WrapperStruct00.var_1_18 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) ? (((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7) > -25) ? (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14))) : 1)) && ((WrapperStruct00.var_1_14 >= (WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_15 == ((unsigned short int) (WrapperStruct00.var_1_14 + (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_13)))) : 1)) && (WrapperStruct00.var_1_17 == ((unsigned short int) WrapperStruct00.var_1_1)) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (((((WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)))) && ((WrapperStruct00.var_1_18 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) ? (((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7) > -25) ? (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14))) : 1)) && ((WrapperStruct00.var_1_14 >= (WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_15 == ((unsigned short int) (WrapperStruct00.var_1_14 + (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_13)))) : 1)) && (WrapperStruct00.var_1_17 == ((unsigned short int) WrapperStruct00.var_1_1))) && (WrapperStruct00.var_1_18 == ((signed char) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((((((WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)))) && ((WrapperStruct00.var_1_18 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) ? (((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7) > -25) ? (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14))) : 1)) && ((WrapperStruct00.var_1_14 >= (WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_15 == ((unsigned short int) (WrapperStruct00.var_1_14 + (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_13)))) : 1)) && (WrapperStruct00.var_1_17 == ((unsigned short int) WrapperStruct00.var_1_1))) && (WrapperStruct00.var_1_18 == ((signed char) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((unsigned char) WrapperStruct00.var_1_21)) VAL [WrapperStruct00={4:0}, isInitial=1] [L131-L132] return ((((((WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)))) && ((WrapperStruct00.var_1_18 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) ? (((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7) > -25) ? (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14))) : 1)) && ((WrapperStruct00.var_1_14 >= (WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_15 == ((unsigned short int) (WrapperStruct00.var_1_14 + (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_13)))) : 1)) && (WrapperStruct00.var_1_17 == ((unsigned short int) WrapperStruct00.var_1_1))) && (WrapperStruct00.var_1_18 == ((signed char) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((unsigned char) WrapperStruct00.var_1_21)) ; [L141] RET, EXPR property() [L141] 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, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.2s, OverallIterations: 17, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2611 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2597 mSDsluCounter, 9434 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6912 mSDsCounter, 680 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5242 IncrementalHoareTripleChecker+Invalid, 5922 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 680 mSolverCounterUnsat, 2522 mSDtfsCounter, 5242 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1527 GetRequests, 1389 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=508occurred in iteration=14, InterpolantAutomatonStates: 121, 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, 16 MinimizatonAttempts, 953 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 3371 NumberOfCodeBlocks, 3371 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 3350 ConstructedInterpolants, 0 QuantifiedInterpolants, 7997 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1253 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 14930/15200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 07:41:48,445 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-43.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 3866fcabc53f8729ce5445d739af818fee4df02a7fd7be02b76364ea8cb9d346 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:41:50,225 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:41:50,287 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 07:41:50,292 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:41:50,293 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:41:50,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:41:50,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:41:50,316 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:41:50,316 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:41:50,319 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:41:50,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:41:50,320 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:41:50,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:41:50,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:41:50,321 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:41:50,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:41:50,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:41:50,322 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:41:50,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:41:50,323 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:41:50,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:41:50,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:41:50,323 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:41:50,323 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 07:41:50,324 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 07:41:50,324 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:41:50,324 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 07:41:50,324 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:41:50,324 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:41:50,324 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:41:50,325 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:41:50,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:41:50,325 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:41:50,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:41:50,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:41:50,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:41:50,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:41:50,330 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:41:50,330 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 07:41:50,331 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 07:41:50,331 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:41:50,331 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:41:50,331 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:41:50,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:41:50,332 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 -> 3866fcabc53f8729ce5445d739af818fee4df02a7fd7be02b76364ea8cb9d346 [2024-11-12 07:41:50,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:41:50,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:41:50,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:41:50,608 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:41:50,608 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:41:50,609 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-43.i [2024-11-12 07:41:51,931 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:41:52,093 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:41:52,095 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-43.i [2024-11-12 07:41:52,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53d2a10d2/d3dcac273c894f99a038efba225de65c/FLAGc3dc418f2 [2024-11-12 07:41:52,121 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53d2a10d2/d3dcac273c894f99a038efba225de65c [2024-11-12 07:41:52,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:41:52,124 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:41:52,126 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:41:52,127 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:41:52,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:41:52,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:41:52" (1/1) ... [2024-11-12 07:41:52,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e93a5a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:52, skipping insertion in model container [2024-11-12 07:41:52,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:41:52" (1/1) ... [2024-11-12 07:41:52,159 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:41:52,310 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-43.i[916,929] [2024-11-12 07:41:52,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:41:52,390 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:41:52,410 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-43.i[916,929] [2024-11-12 07:41:52,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:41:52,481 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:41:52,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:52 WrapperNode [2024-11-12 07:41:52,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:41:52,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:41:52,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:41:52,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:41:52,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:52" (1/1) ... [2024-11-12 07:41:52,503 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:52" (1/1) ... [2024-11-12 07:41:52,538 INFO L138 Inliner]: procedures = 34, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 500 [2024-11-12 07:41:52,539 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:41:52,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:41:52,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:41:52,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:41:52,553 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:52" (1/1) ... [2024-11-12 07:41:52,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:52" (1/1) ... [2024-11-12 07:41:52,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:52" (1/1) ... [2024-11-12 07:41:52,591 INFO L175 MemorySlicer]: Split 145 memory accesses to 2 slices as follows [2, 143]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 40 writes are split as follows [0, 40]. [2024-11-12 07:41:52,592 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:52" (1/1) ... [2024-11-12 07:41:52,592 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:52" (1/1) ... [2024-11-12 07:41:52,616 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:52" (1/1) ... [2024-11-12 07:41:52,622 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:52" (1/1) ... [2024-11-12 07:41:52,624 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:52" (1/1) ... [2024-11-12 07:41:52,626 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:52" (1/1) ... [2024-11-12 07:41:52,636 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:41:52,636 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:41:52,636 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:41:52,637 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:41:52,637 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:52" (1/1) ... [2024-11-12 07:41:52,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:41:52,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:41:52,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 07:41:52,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 07:41:52,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:41:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 07:41:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 07:41:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 07:41:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 07:41:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-12 07:41:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-12 07:41:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-12 07:41:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-12 07:41:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-12 07:41:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-12 07:41:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-12 07:41:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-12 07:41:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-12 07:41:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-12 07:41:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:41:52,709 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:41:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-12 07:41:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-12 07:41:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:41:52,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:41:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-12 07:41:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-12 07:41:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-12 07:41:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-12 07:41:52,824 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:41:52,825 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:41:53,935 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2024-11-12 07:41:53,936 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:41:53,945 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:41:53,945 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:41:53,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:41:53 BoogieIcfgContainer [2024-11-12 07:41:53,946 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:41:53,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:41:53,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:41:53,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:41:53,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:41:52" (1/3) ... [2024-11-12 07:41:53,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@441f49d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:41:53, skipping insertion in model container [2024-11-12 07:41:53,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:41:52" (2/3) ... [2024-11-12 07:41:53,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@441f49d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:41:53, skipping insertion in model container [2024-11-12 07:41:53,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:41:53" (3/3) ... [2024-11-12 07:41:53,951 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-43.i [2024-11-12 07:41:53,965 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:41:53,966 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:41:54,009 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:41:54,014 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;@54128aa4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:41:54,014 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:41:54,017 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 90 states have (on average 1.4) internal successors, (126), 91 states have internal predecessors, (126), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:41:54,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-12 07:41:54,026 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:41:54,027 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:41:54,027 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:41:54,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:41:54,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1561133314, now seen corresponding path program 1 times [2024-11-12 07:41:54,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:41:54,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952703459] [2024-11-12 07:41:54,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:54,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:41:54,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:41:54,043 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:41:54,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 07:41:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:54,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 07:41:54,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:41:54,455 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-11-12 07:41:54,455 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:41:54,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:41:54,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952703459] [2024-11-12 07:41:54,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952703459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:41:54,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:41:54,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:41:54,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974510029] [2024-11-12 07:41:54,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:41:54,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:41:54,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:41:54,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:41:54,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:41:54,487 INFO L87 Difference]: Start difference. First operand has 113 states, 90 states have (on average 1.4) internal successors, (126), 91 states have internal predecessors, (126), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:41:54,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:41:54,528 INFO L93 Difference]: Finished difference Result 219 states and 346 transitions. [2024-11-12 07:41:54,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:41:54,529 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-12 07:41:54,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:41:54,535 INFO L225 Difference]: With dead ends: 219 [2024-11-12 07:41:54,535 INFO L226 Difference]: Without dead ends: 109 [2024-11-12 07:41:54,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:41:54,540 INFO L435 NwaCegarLoop]: 159 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, 159 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:41:54,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:41:54,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-12 07:41:54,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-12 07:41:54,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.367816091954023) internal successors, (119), 87 states have internal predecessors, (119), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:41:54,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2024-11-12 07:41:54,574 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 165 [2024-11-12 07:41:54,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:41:54,584 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2024-11-12 07:41:54,585 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:41:54,585 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2024-11-12 07:41:54,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-12 07:41:54,588 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:41:54,588 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:41:54,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 07:41:54,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:41:54,790 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:41:54,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:41:54,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1953213538, now seen corresponding path program 1 times [2024-11-12 07:41:54,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:41:54,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981988714] [2024-11-12 07:41:54,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:54,792 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:41:54,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:41:54,795 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:41:54,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 07:41:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:55,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 07:41:55,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:41:55,219 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:41:55,219 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:41:55,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:41:55,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981988714] [2024-11-12 07:41:55,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1981988714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:41:55,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:41:55,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:41:55,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438941917] [2024-11-12 07:41:55,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:41:55,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:41:55,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:41:55,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:41:55,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:41:55,222 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:41:55,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:41:55,301 INFO L93 Difference]: Finished difference Result 220 states and 322 transitions. [2024-11-12 07:41:55,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:41:55,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 165 [2024-11-12 07:41:55,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:41:55,305 INFO L225 Difference]: With dead ends: 220 [2024-11-12 07:41:55,306 INFO L226 Difference]: Without dead ends: 114 [2024-11-12 07:41:55,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:41:55,308 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:41:55,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 600 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:41:55,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-12 07:41:55,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-12 07:41:55,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 91 states have internal predecessors, (123), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:41:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2024-11-12 07:41:55,327 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 165 [2024-11-12 07:41:55,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:41:55,328 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2024-11-12 07:41:55,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:41:55,329 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2024-11-12 07:41:55,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-12 07:41:55,330 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:41:55,331 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:41:55,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 07:41:55,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:41:55,532 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:41:55,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:41:55,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1661695388, now seen corresponding path program 1 times [2024-11-12 07:41:55,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:41:55,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547912009] [2024-11-12 07:41:55,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:55,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:41:55,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:41:55,535 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:41:55,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 07:41:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:55,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 07:41:55,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:41:55,918 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:41:55,925 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:41:55,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:41:55,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547912009] [2024-11-12 07:41:55,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547912009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:41:55,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:41:55,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:41:55,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075379698] [2024-11-12 07:41:55,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:41:55,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:41:55,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:41:55,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:41:55,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:41:55,927 INFO L87 Difference]: Start difference. First operand 113 states and 163 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:41:55,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:41:55,993 INFO L93 Difference]: Finished difference Result 226 states and 327 transitions. [2024-11-12 07:41:55,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:41:55,993 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 165 [2024-11-12 07:41:55,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:41:55,995 INFO L225 Difference]: With dead ends: 226 [2024-11-12 07:41:55,995 INFO L226 Difference]: Without dead ends: 116 [2024-11-12 07:41:55,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:41:55,996 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:41:55,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 740 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:41:56,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-12 07:41:56,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-12 07:41:56,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 93 states have internal predecessors, (125), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:41:56,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 165 transitions. [2024-11-12 07:41:56,014 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 165 transitions. Word has length 165 [2024-11-12 07:41:56,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:41:56,015 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 165 transitions. [2024-11-12 07:41:56,015 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:41:56,015 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 165 transitions. [2024-11-12 07:41:56,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-12 07:41:56,026 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:41:56,026 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:41:56,066 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-12 07:41:56,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:41:56,227 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:41:56,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:41:56,228 INFO L85 PathProgramCache]: Analyzing trace with hash 113311974, now seen corresponding path program 1 times [2024-11-12 07:41:56,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:41:56,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642463831] [2024-11-12 07:41:56,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:56,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:41:56,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:41:56,232 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:41:56,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 07:41:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:56,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:41:56,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:41:56,676 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 95 treesize of output 41 [2024-11-12 07:41:56,710 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-11-12 07:41:56,710 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:41:56,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:41:56,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642463831] [2024-11-12 07:41:56,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642463831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:41:56,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:41:56,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:41:56,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053655112] [2024-11-12 07:41:56,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:41:56,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:41:56,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:41:56,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:41:56,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:41:56,712 INFO L87 Difference]: Start difference. First operand 115 states and 165 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:41:57,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:41:57,691 INFO L93 Difference]: Finished difference Result 228 states and 328 transitions. [2024-11-12 07:41:57,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:41:57,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-12 07:41:57,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:41:57,694 INFO L225 Difference]: With dead ends: 228 [2024-11-12 07:41:57,694 INFO L226 Difference]: Without dead ends: 116 [2024-11-12 07:41:57,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:41:57,697 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 139 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 07:41:57,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 460 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 07:41:57,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-12 07:41:57,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-12 07:41:57,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:41:57,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 164 transitions. [2024-11-12 07:41:57,704 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 164 transitions. Word has length 165 [2024-11-12 07:41:57,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:41:57,704 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 164 transitions. [2024-11-12 07:41:57,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:41:57,704 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 164 transitions. [2024-11-12 07:41:57,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 07:41:57,706 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:41:57,706 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:41:57,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-12 07:41:57,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:41:57,907 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:41:57,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:41:57,907 INFO L85 PathProgramCache]: Analyzing trace with hash -709761824, now seen corresponding path program 1 times [2024-11-12 07:41:57,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:41:57,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271414865] [2024-11-12 07:41:57,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:57,908 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:41:57,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:41:57,910 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:41:57,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 07:41:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:58,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:41:58,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:41:58,330 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 95 treesize of output 41 [2024-11-12 07:41:58,348 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-12 07:41:58,348 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:41:58,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:41:58,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271414865] [2024-11-12 07:41:58,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271414865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:41:58,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:41:58,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:41:58,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4833950] [2024-11-12 07:41:58,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:41:58,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:41:58,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:41:58,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:41:58,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:41:58,350 INFO L87 Difference]: Start difference. First operand 115 states and 164 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:41:59,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:41:59,194 INFO L93 Difference]: Finished difference Result 228 states and 326 transitions. [2024-11-12 07:41:59,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:41:59,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 167 [2024-11-12 07:41:59,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:41:59,195 INFO L225 Difference]: With dead ends: 228 [2024-11-12 07:41:59,195 INFO L226 Difference]: Without dead ends: 116 [2024-11-12 07:41:59,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:41:59,196 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 129 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:41:59,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 456 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 07:41:59,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-12 07:41:59,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-12 07:41:59,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 93 states have (on average 1.3225806451612903) internal successors, (123), 93 states have internal predecessors, (123), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:41:59,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2024-11-12 07:41:59,202 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 167 [2024-11-12 07:41:59,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:41:59,202 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2024-11-12 07:41:59,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:41:59,203 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2024-11-12 07:41:59,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-12 07:41:59,204 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:41:59,204 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:41:59,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-12 07:41:59,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:41:59,404 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:41:59,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:41:59,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1995820070, now seen corresponding path program 1 times [2024-11-12 07:41:59,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:41:59,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1996322247] [2024-11-12 07:41:59,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:59,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:41:59,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:41:59,407 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:41:59,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 07:41:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:59,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 07:41:59,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:41:59,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:41:59,915 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 46 treesize of output 46 [2024-11-12 07:41:59,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:00,000 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 89 treesize of output 100 [2024-11-12 07:42:00,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:00,125 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 95 treesize of output 35 [2024-11-12 07:42:00,163 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-12 07:42:00,164 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:42:00,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:42:00,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1996322247] [2024-11-12 07:42:00,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1996322247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:42:00,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:42:00,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 07:42:00,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900573459] [2024-11-12 07:42:00,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:42:00,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:42:00,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:42:00,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:42:00,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:42:00,166 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:42:04,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:42:04,316 INFO L93 Difference]: Finished difference Result 386 states and 543 transitions. [2024-11-12 07:42:04,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 07:42:04,317 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-12 07:42:04,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:42:04,318 INFO L225 Difference]: With dead ends: 386 [2024-11-12 07:42:04,318 INFO L226 Difference]: Without dead ends: 274 [2024-11-12 07:42:04,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-11-12 07:42:04,320 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 346 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:42:04,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 515 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-12 07:42:04,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-12 07:42:04,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 264. [2024-11-12 07:42:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 211 states have (on average 1.3080568720379147) internal successors, (276), 213 states have internal predecessors, (276), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 07:42:04,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 372 transitions. [2024-11-12 07:42:04,341 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 372 transitions. Word has length 169 [2024-11-12 07:42:04,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:42:04,342 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 372 transitions. [2024-11-12 07:42:04,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:42:04,342 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 372 transitions. [2024-11-12 07:42:04,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-12 07:42:04,347 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:42:04,347 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:42:04,361 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 (7)] Forceful destruction successful, exit code 0 [2024-11-12 07:42:04,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:42:04,548 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:42:04,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:42:04,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1876445400, now seen corresponding path program 1 times [2024-11-12 07:42:04,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:42:04,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930529357] [2024-11-12 07:42:04,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:42:04,549 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:42:04,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:42:04,550 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:42:04,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 07:42:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:42:05,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-12 07:42:05,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:42:05,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:05,050 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 46 treesize of output 46 [2024-11-12 07:42:05,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:05,111 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 89 treesize of output 100 [2024-11-12 07:42:05,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:05,232 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 105 treesize of output 113 [2024-11-12 07:42:05,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:05,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 120 treesize of output 127 [2024-11-12 07:42:05,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:05,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 131 treesize of output 49 [2024-11-12 07:42:05,529 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-12 07:42:05,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:42:05,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:42:05,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930529357] [2024-11-12 07:42:05,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930529357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:42:05,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:42:05,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 07:42:05,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398732361] [2024-11-12 07:42:05,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:42:05,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 07:42:05,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:42:05,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 07:42:05,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:42:05,532 INFO L87 Difference]: Start difference. First operand 264 states and 372 transitions. Second operand has 11 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:42:11,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:42:11,774 INFO L93 Difference]: Finished difference Result 568 states and 790 transitions. [2024-11-12 07:42:11,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-12 07:42:11,775 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-12 07:42:11,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:42:11,777 INFO L225 Difference]: With dead ends: 568 [2024-11-12 07:42:11,777 INFO L226 Difference]: Without dead ends: 360 [2024-11-12 07:42:11,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2024-11-12 07:42:11,778 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 520 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:42:11,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 660 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-11-12 07:42:11,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-12 07:42:11,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 264. [2024-11-12 07:42:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 211 states have (on average 1.2985781990521328) internal successors, (274), 213 states have internal predecessors, (274), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 07:42:11,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 370 transitions. [2024-11-12 07:42:11,809 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 370 transitions. Word has length 169 [2024-11-12 07:42:11,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:42:11,809 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 370 transitions. [2024-11-12 07:42:11,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:42:11,810 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 370 transitions. [2024-11-12 07:42:11,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-12 07:42:11,811 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:42:11,811 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:42:11,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-12 07:42:12,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:42:12,012 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:42:12,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:42:12,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1397453542, now seen corresponding path program 1 times [2024-11-12 07:42:12,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:42:12,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713657485] [2024-11-12 07:42:12,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:42:12,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:42:12,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:42:12,014 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:42:12,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-12 07:42:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:42:12,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-12 07:42:12,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:42:12,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:42:12,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:42:12,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:42:12,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:42:12,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:42:12,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:42:12,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:42:12,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:42:12,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:42:12,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:42:12,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:42:12,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:42:12,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:42:12,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:42:12,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:42:12,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:42:12,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:42:12,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:42:12,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:42:12,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:42:12,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:42:12,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 91 [2024-11-12 07:42:12,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:12,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 110 treesize of output 118 [2024-11-12 07:42:13,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:13,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 110 treesize of output 118 [2024-11-12 07:42:13,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:13,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 110 treesize of output 118 [2024-11-12 07:42:13,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:13,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 110 treesize of output 118 [2024-11-12 07:42:13,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:13,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 105 treesize of output 119 [2024-11-12 07:42:14,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:14,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 110 treesize of output 109 [2024-11-12 07:42:14,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:14,743 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 95 treesize of output 115 [2024-11-12 07:42:15,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:15,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 105 treesize of output 119 [2024-11-12 07:42:15,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:15,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 105 treesize of output 119 [2024-11-12 07:42:15,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:15,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 105 treesize of output 128 [2024-11-12 07:42:16,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:16,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 120 treesize of output 122 [2024-11-12 07:42:16,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:16,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 110 treesize of output 109 [2024-11-12 07:42:17,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:17,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 113 treesize of output 107 [2024-11-12 07:42:17,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:17,194 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 121 treesize of output 123 [2024-11-12 07:42:17,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:17,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 127 treesize of output 138 [2024-11-12 07:42:17,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:17,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 142 treesize of output 152 [2024-11-12 07:42:17,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:17,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 179 treesize of output 85 [2024-11-12 07:42:17,934 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 32 proven. 672 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-12 07:42:17,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:42:18,104 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:42:18,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:42:18,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713657485] [2024-11-12 07:42:18,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713657485] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:42:18,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:42:18,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 21 [2024-11-12 07:42:18,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152343026] [2024-11-12 07:42:18,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:42:18,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:42:18,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:42:18,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:42:18,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-11-12 07:42:18,106 INFO L87 Difference]: Start difference. First operand 264 states and 370 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:42:19,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:42:19,443 INFO L93 Difference]: Finished difference Result 684 states and 952 transitions. [2024-11-12 07:42:19,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:42:19,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 169 [2024-11-12 07:42:19,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:42:19,447 INFO L225 Difference]: With dead ends: 684 [2024-11-12 07:42:19,447 INFO L226 Difference]: Without dead ends: 476 [2024-11-12 07:42:19,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2024-11-12 07:42:19,448 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 132 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:42:19,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 895 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-12 07:42:19,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-12 07:42:19,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 471. [2024-11-12 07:42:19,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 382 states have (on average 1.301047120418848) internal successors, (497), 385 states have internal predecessors, (497), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-12 07:42:19,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 657 transitions. [2024-11-12 07:42:19,488 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 657 transitions. Word has length 169 [2024-11-12 07:42:19,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:42:19,488 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 657 transitions. [2024-11-12 07:42:19,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:42:19,488 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 657 transitions. [2024-11-12 07:42:19,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-12 07:42:19,489 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:42:19,489 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:42:19,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-12 07:42:19,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:42:19,690 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:42:19,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:42:19,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1554554881, now seen corresponding path program 1 times [2024-11-12 07:42:19,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:42:19,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68243713] [2024-11-12 07:42:19,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:42:19,691 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:42:19,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:42:19,693 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:42:19,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-12 07:42:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:42:20,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-12 07:42:20,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:42:20,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:20,231 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 46 treesize of output 46 [2024-11-12 07:42:20,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:20,289 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 89 treesize of output 100 [2024-11-12 07:42:20,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:20,416 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 105 treesize of output 113 [2024-11-12 07:42:20,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:20,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 120 treesize of output 127 [2024-11-12 07:42:20,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:20,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 126 treesize of output 46 [2024-11-12 07:42:20,669 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-12 07:42:20,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:42:20,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:42:20,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68243713] [2024-11-12 07:42:20,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68243713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:42:20,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:42:20,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 07:42:20,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983357286] [2024-11-12 07:42:20,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:42:20,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 07:42:20,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:42:20,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 07:42:20,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:42:20,671 INFO L87 Difference]: Start difference. First operand 471 states and 657 transitions. Second operand has 11 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:42:27,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:42:27,336 INFO L93 Difference]: Finished difference Result 989 states and 1366 transitions. [2024-11-12 07:42:27,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-12 07:42:27,337 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-12 07:42:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:42:27,339 INFO L225 Difference]: With dead ends: 989 [2024-11-12 07:42:27,339 INFO L226 Difference]: Without dead ends: 574 [2024-11-12 07:42:27,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2024-11-12 07:42:27,340 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 514 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:42:27,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 624 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-12 07:42:27,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-12 07:42:27,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 471. [2024-11-12 07:42:27,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 382 states have (on average 1.2905759162303665) internal successors, (493), 385 states have internal predecessors, (493), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-12 07:42:27,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 653 transitions. [2024-11-12 07:42:27,369 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 653 transitions. Word has length 169 [2024-11-12 07:42:27,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:42:27,370 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 653 transitions. [2024-11-12 07:42:27,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:42:27,370 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 653 transitions. [2024-11-12 07:42:27,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-12 07:42:27,371 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:42:27,371 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:42:27,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-12 07:42:27,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:42:27,572 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:42:27,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:42:27,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1719344061, now seen corresponding path program 1 times [2024-11-12 07:42:27,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:42:27,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924960440] [2024-11-12 07:42:27,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:42:27,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:42:27,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:42:27,576 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:42:27,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-12 07:42:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:42:27,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 07:42:27,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:42:27,898 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:42:27,898 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:42:27,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:42:27,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924960440] [2024-11-12 07:42:27,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924960440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:42:27,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:42:27,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:42:27,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739491313] [2024-11-12 07:42:27,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:42:27,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:42:27,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:42:27,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:42:27,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:42:27,900 INFO L87 Difference]: Start difference. First operand 471 states and 653 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:42:27,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:42:27,944 INFO L93 Difference]: Finished difference Result 886 states and 1226 transitions. [2024-11-12 07:42:27,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:42:27,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 169 [2024-11-12 07:42:27,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:42:27,950 INFO L225 Difference]: With dead ends: 886 [2024-11-12 07:42:27,950 INFO L226 Difference]: Without dead ends: 471 [2024-11-12 07:42:27,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:42:27,951 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:42:27,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 595 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:42:27,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-11-12 07:42:27,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 467. [2024-11-12 07:42:27,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 378 states have (on average 1.2883597883597884) internal successors, (487), 381 states have internal predecessors, (487), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-12 07:42:27,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 647 transitions. [2024-11-12 07:42:27,981 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 647 transitions. Word has length 169 [2024-11-12 07:42:27,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:42:27,981 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 647 transitions. [2024-11-12 07:42:27,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:42:27,982 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 647 transitions. [2024-11-12 07:42:27,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-12 07:42:27,982 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:42:27,982 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:42:27,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-12 07:42:28,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:42:28,183 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:42:28,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:42:28,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1591474460, now seen corresponding path program 1 times [2024-11-12 07:42:28,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:42:28,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947870648] [2024-11-12 07:42:28,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:42:28,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:42:28,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:42:28,188 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:42:28,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-12 07:42:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:42:28,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 07:42:28,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:42:28,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:28,690 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 46 treesize of output 46 [2024-11-12 07:42:28,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:28,742 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 89 treesize of output 100 [2024-11-12 07:42:28,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:28,840 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 95 treesize of output 35 [2024-11-12 07:42:28,863 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-12 07:42:28,863 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:42:28,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:42:28,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947870648] [2024-11-12 07:42:28,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947870648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:42:28,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:42:28,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 07:42:28,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735205765] [2024-11-12 07:42:28,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:42:28,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:42:28,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:42:28,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:42:28,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:42:28,866 INFO L87 Difference]: Start difference. First operand 467 states and 647 transitions. Second operand has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:42:32,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:42:32,850 INFO L93 Difference]: Finished difference Result 893 states and 1226 transitions. [2024-11-12 07:42:32,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 07:42:32,851 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-12 07:42:32,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:42:32,853 INFO L225 Difference]: With dead ends: 893 [2024-11-12 07:42:32,854 INFO L226 Difference]: Without dead ends: 482 [2024-11-12 07:42:32,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-11-12 07:42:32,855 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 340 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:42:32,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 509 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-12 07:42:32,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-12 07:42:32,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 467. [2024-11-12 07:42:32,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 378 states have (on average 1.2777777777777777) internal successors, (483), 381 states have internal predecessors, (483), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-12 07:42:32,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 643 transitions. [2024-11-12 07:42:32,882 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 643 transitions. Word has length 169 [2024-11-12 07:42:32,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:42:32,883 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 643 transitions. [2024-11-12 07:42:32,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:42:32,883 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 643 transitions. [2024-11-12 07:42:32,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-12 07:42:32,884 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:42:32,884 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:42:32,898 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 (12)] Ended with exit code 0 [2024-11-12 07:42:33,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:42:33,085 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:42:33,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:42:33,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1168772634, now seen corresponding path program 1 times [2024-11-12 07:42:33,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:42:33,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1070002252] [2024-11-12 07:42:33,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:42:33,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:42:33,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:42:33,089 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:42:33,090 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 (13)] Waiting until timeout for monitored process [2024-11-12 07:42:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:42:33,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-12 07:42:33,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:42:33,588 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-12 07:42:33,612 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-12 07:42:33,781 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 80 treesize of output 34 [2024-11-12 07:42:33,876 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 80 treesize of output 34 [2024-11-12 07:42:33,966 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 80 treesize of output 34 [2024-11-12 07:42:34,078 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 75 treesize of output 44 [2024-11-12 07:42:34,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:34,247 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 85 treesize of output 57 [2024-11-12 07:42:34,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:34,448 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 95 treesize of output 70 [2024-11-12 07:42:34,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:34,686 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 110 treesize of output 73 [2024-11-12 07:42:34,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:34,890 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 110 treesize of output 73 [2024-11-12 07:42:35,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:35,097 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 105 treesize of output 83 [2024-11-12 07:42:35,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:35,432 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 120 treesize of output 86 [2024-11-12 07:42:35,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:35,719 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 133 treesize of output 97 [2024-11-12 07:42:35,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:35,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 161 treesize of output 148 [2024-11-12 07:42:38,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:38,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 258 treesize of output 206 [2024-11-12 07:42:42,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:42:42,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 333 treesize of output 125 [2024-11-12 07:42:46,105 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 628 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-11-12 07:42:46,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:42:46,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:42:46,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1070002252] [2024-11-12 07:42:46,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1070002252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:42:46,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:42:46,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-12 07:42:46,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301510431] [2024-11-12 07:42:46,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:42:46,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 07:42:46,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:42:46,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 07:42:46,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2024-11-12 07:42:46,107 INFO L87 Difference]: Start difference. First operand 467 states and 643 transitions. Second operand has 19 states, 19 states have (on average 4.578947368421052) internal successors, (87), 18 states have internal predecessors, (87), 6 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20)