./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-28.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 e1d78d248c74132bd311292745f8a4e0496a51de00b4b221480ef3ff016a6c65 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:05:20,881 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:05:20,963 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:05:20,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:05:20,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:05:20,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:05:20,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:05:20,988 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:05:20,989 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:05:20,989 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:05:20,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:05:20,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:05:20,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:05:20,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:05:20,991 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:05:20,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:05:20,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:05:20,992 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:05:20,993 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:05:20,993 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:05:20,994 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:05:20,994 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:05:20,995 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:05:20,995 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:05:20,995 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:05:20,999 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:05:21,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:05:21,000 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:05:21,000 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:05:21,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:05:21,001 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:05:21,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:05:21,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:05:21,001 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:05:21,002 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:05:21,002 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:05:21,002 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:05:21,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:05:21,003 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:05:21,003 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:05:21,003 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:05:21,011 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:05:21,012 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 -> e1d78d248c74132bd311292745f8a4e0496a51de00b4b221480ef3ff016a6c65 [2024-11-19 01:05:21,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:05:21,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:05:21,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:05:21,300 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:05:21,300 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:05:21,302 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-28.i [2024-11-19 01:05:22,832 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:05:23,039 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:05:23,040 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-28.i [2024-11-19 01:05:23,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65e911642/8a495794011f4441b1e52609b0230f6d/FLAG7ddac9ed8 [2024-11-19 01:05:23,414 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65e911642/8a495794011f4441b1e52609b0230f6d [2024-11-19 01:05:23,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:05:23,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:05:23,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:05:23,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:05:23,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:05:23,423 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:05:23" (1/1) ... [2024-11-19 01:05:23,423 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e63ca2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:23, skipping insertion in model container [2024-11-19 01:05:23,423 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:05:23" (1/1) ... [2024-11-19 01:05:23,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:05:23,634 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-28.i[916,929] [2024-11-19 01:05:23,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:05:23,736 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:05:23,750 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-28.i[916,929] [2024-11-19 01:05:23,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:05:23,830 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:05:23,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:23 WrapperNode [2024-11-19 01:05:23,831 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:05:23,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:05:23,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:05:23,832 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:05:23,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:23" (1/1) ... [2024-11-19 01:05:23,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:23" (1/1) ... [2024-11-19 01:05:23,894 INFO L138 Inliner]: procedures = 30, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 575 [2024-11-19 01:05:23,895 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:05:23,895 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:05:23,896 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:05:23,896 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:05:23,909 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:23" (1/1) ... [2024-11-19 01:05:23,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:23" (1/1) ... [2024-11-19 01:05:23,919 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:23" (1/1) ... [2024-11-19 01:05:23,930 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-19 01:05:23,930 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:23" (1/1) ... [2024-11-19 01:05:23,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:23" (1/1) ... [2024-11-19 01:05:23,950 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:23" (1/1) ... [2024-11-19 01:05:23,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:23" (1/1) ... [2024-11-19 01:05:23,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:23" (1/1) ... [2024-11-19 01:05:23,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:23" (1/1) ... [2024-11-19 01:05:23,968 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:05:23,969 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:05:23,969 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:05:23,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:05:23,971 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:23" (1/1) ... [2024-11-19 01:05:23,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:05:23,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:05:24,023 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 01:05:24,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 01:05:24,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:05:24,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-19 01:05:24,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-19 01:05:24,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 01:05:24,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-19 01:05:24,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-19 01:05:24,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 01:05:24,079 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:05:24,079 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:05:24,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 01:05:24,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:05:24,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:05:24,220 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:05:24,223 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:05:24,955 INFO L? ?]: Removed 172 outVars from TransFormulas that were not future-live. [2024-11-19 01:05:24,955 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:05:24,975 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:05:24,976 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:05:24,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:05:24 BoogieIcfgContainer [2024-11-19 01:05:24,977 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:05:24,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:05:24,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:05:24,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:05:24,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:05:23" (1/3) ... [2024-11-19 01:05:24,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b909f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:05:24, skipping insertion in model container [2024-11-19 01:05:24,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:23" (2/3) ... [2024-11-19 01:05:24,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b909f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:05:24, skipping insertion in model container [2024-11-19 01:05:24,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:05:24" (3/3) ... [2024-11-19 01:05:24,988 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-28.i [2024-11-19 01:05:25,007 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:05:25,007 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:05:25,074 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:05:25,080 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;@21ba23d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:05:25,080 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:05:25,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 106 states have (on average 1.4339622641509433) internal successors, (152), 107 states have internal predecessors, (152), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 01:05:25,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-19 01:05:25,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:25,096 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:25,097 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:25,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:25,102 INFO L85 PathProgramCache]: Analyzing trace with hash 771826097, now seen corresponding path program 1 times [2024-11-19 01:05:25,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:05:25,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669206188] [2024-11-19 01:05:25,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:25,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:05:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:25,577 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-19 01:05:25,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:05:25,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669206188] [2024-11-19 01:05:25,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669206188] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:05:25,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214023607] [2024-11-19 01:05:25,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:25,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:05:25,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:05:25,582 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:05:25,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 01:05:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:25,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:05:25,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:05:25,929 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-19 01:05:25,930 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:05:25,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214023607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:25,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:05:25,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 01:05:25,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261382377] [2024-11-19 01:05:25,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:25,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:05:25,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:05:25,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:05:25,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:05:26,003 INFO L87 Difference]: Start difference. First operand has 123 states, 106 states have (on average 1.4339622641509433) internal successors, (152), 107 states have internal predecessors, (152), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 01:05:26,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:26,070 INFO L93 Difference]: Finished difference Result 239 states and 368 transitions. [2024-11-19 01:05:26,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:05:26,072 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2024-11-19 01:05:26,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:26,080 INFO L225 Difference]: With dead ends: 239 [2024-11-19 01:05:26,080 INFO L226 Difference]: Without dead ends: 119 [2024-11-19 01:05:26,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:05:26,087 INFO L432 NwaCegarLoop]: 171 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, 171 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:26,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:05:26,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-19 01:05:26,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-19 01:05:26,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 103 states have internal predecessors, (143), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 01:05:26,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2024-11-19 01:05:26,144 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 130 [2024-11-19 01:05:26,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:26,144 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2024-11-19 01:05:26,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 01:05:26,145 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2024-11-19 01:05:26,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-19 01:05:26,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:26,148 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:26,167 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-19 01:05:26,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 01:05:26,350 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:26,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:26,351 INFO L85 PathProgramCache]: Analyzing trace with hash 158855109, now seen corresponding path program 1 times [2024-11-19 01:05:26,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:05:26,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358613829] [2024-11-19 01:05:26,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:26,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:05:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:26,744 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 01:05:26,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:05:26,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358613829] [2024-11-19 01:05:26,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358613829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:26,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:26,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:05:26,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590732277] [2024-11-19 01:05:26,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:26,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:05:26,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:05:26,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:05:26,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:05:26,750 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:05:26,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:26,808 INFO L93 Difference]: Finished difference Result 238 states and 343 transitions. [2024-11-19 01:05:26,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:05:26,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2024-11-19 01:05:26,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:26,811 INFO L225 Difference]: With dead ends: 238 [2024-11-19 01:05:26,811 INFO L226 Difference]: Without dead ends: 122 [2024-11-19 01:05:26,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:05:26,816 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 493 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-19 01:05:26,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 493 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:05:26,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-19 01:05:26,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2024-11-19 01:05:26,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 105 states have (on average 1.380952380952381) internal successors, (145), 105 states have internal predecessors, (145), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 01:05:26,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 173 transitions. [2024-11-19 01:05:26,837 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 173 transitions. Word has length 130 [2024-11-19 01:05:26,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:26,840 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 173 transitions. [2024-11-19 01:05:26,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:05:26,840 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 173 transitions. [2024-11-19 01:05:26,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-19 01:05:26,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:26,845 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:26,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:05:26,845 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:26,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:26,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1933862471, now seen corresponding path program 1 times [2024-11-19 01:05:26,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:05:26,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379200026] [2024-11-19 01:05:26,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:26,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:05:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:27,069 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 01:05:27,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:05:27,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379200026] [2024-11-19 01:05:27,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379200026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:27,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:27,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:05:27,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299774840] [2024-11-19 01:05:27,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:27,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:05:27,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:05:27,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:05:27,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:05:27,072 INFO L87 Difference]: Start difference. First operand 121 states and 173 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:05:27,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:27,118 INFO L93 Difference]: Finished difference Result 242 states and 347 transitions. [2024-11-19 01:05:27,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:05:27,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2024-11-19 01:05:27,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:27,121 INFO L225 Difference]: With dead ends: 242 [2024-11-19 01:05:27,123 INFO L226 Difference]: Without dead ends: 124 [2024-11-19 01:05:27,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:05:27,125 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:27,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 496 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:05:27,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-19 01:05:27,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2024-11-19 01:05:27,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 107 states have (on average 1.3738317757009346) internal successors, (147), 107 states have internal predecessors, (147), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 01:05:27,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2024-11-19 01:05:27,140 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 130 [2024-11-19 01:05:27,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:27,141 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2024-11-19 01:05:27,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:05:27,141 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2024-11-19 01:05:27,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-19 01:05:27,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:27,143 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:27,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:05:27,143 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:27,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:27,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1935709513, now seen corresponding path program 1 times [2024-11-19 01:05:27,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:05:27,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106967600] [2024-11-19 01:05:27,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:27,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:05:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:27,826 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 01:05:27,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:05:27,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106967600] [2024-11-19 01:05:27,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106967600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:27,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:27,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:05:27,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132202805] [2024-11-19 01:05:27,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:27,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:05:27,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:05:27,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:05:27,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:05:27,832 INFO L87 Difference]: Start difference. First operand 123 states and 175 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:05:28,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:28,213 INFO L93 Difference]: Finished difference Result 321 states and 455 transitions. [2024-11-19 01:05:28,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:05:28,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2024-11-19 01:05:28,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:28,216 INFO L225 Difference]: With dead ends: 321 [2024-11-19 01:05:28,216 INFO L226 Difference]: Without dead ends: 201 [2024-11-19 01:05:28,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:05:28,218 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 91 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:28,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 631 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 01:05:28,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-19 01:05:28,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2024-11-19 01:05:28,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 179 states have (on average 1.3854748603351956) internal successors, (248), 180 states have internal predecessors, (248), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 01:05:28,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 280 transitions. [2024-11-19 01:05:28,240 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 280 transitions. Word has length 130 [2024-11-19 01:05:28,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:28,241 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 280 transitions. [2024-11-19 01:05:28,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:05:28,241 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 280 transitions. [2024-11-19 01:05:28,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 01:05:28,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:28,247 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:28,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:05:28,248 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:28,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:28,250 INFO L85 PathProgramCache]: Analyzing trace with hash -374592594, now seen corresponding path program 1 times [2024-11-19 01:05:28,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:05:28,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738478536] [2024-11-19 01:05:28,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:28,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:05:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:29,949 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 01:05:29,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:05:29,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738478536] [2024-11-19 01:05:29,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738478536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:29,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:29,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 01:05:29,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033871237] [2024-11-19 01:05:29,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:29,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:05:29,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:05:29,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:05:29,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:05:29,954 INFO L87 Difference]: Start difference. First operand 198 states and 280 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:05:30,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:30,906 INFO L93 Difference]: Finished difference Result 631 states and 888 transitions. [2024-11-19 01:05:30,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:05:30,907 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 132 [2024-11-19 01:05:30,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:30,911 INFO L225 Difference]: With dead ends: 631 [2024-11-19 01:05:30,911 INFO L226 Difference]: Without dead ends: 436 [2024-11-19 01:05:30,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:05:30,913 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 255 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:30,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 699 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 01:05:30,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-19 01:05:30,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 372. [2024-11-19 01:05:30,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 345 states have (on average 1.3942028985507247) internal successors, (481), 348 states have internal predecessors, (481), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 01:05:30,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 525 transitions. [2024-11-19 01:05:30,936 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 525 transitions. Word has length 132 [2024-11-19 01:05:30,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:30,936 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 525 transitions. [2024-11-19 01:05:30,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:05:30,937 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 525 transitions. [2024-11-19 01:05:30,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 01:05:30,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:30,939 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:30,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 01:05:30,939 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:30,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:30,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1192241044, now seen corresponding path program 1 times [2024-11-19 01:05:30,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:05:30,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998284810] [2024-11-19 01:05:30,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:30,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:05:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:31,854 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 01:05:31,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:05:31,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998284810] [2024-11-19 01:05:31,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998284810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:31,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:31,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:05:31,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465523696] [2024-11-19 01:05:31,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:31,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:05:31,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:05:31,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:05:31,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:05:31,862 INFO L87 Difference]: Start difference. First operand 372 states and 525 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:05:32,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:32,173 INFO L93 Difference]: Finished difference Result 767 states and 1081 transitions. [2024-11-19 01:05:32,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:05:32,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 132 [2024-11-19 01:05:32,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:32,178 INFO L225 Difference]: With dead ends: 767 [2024-11-19 01:05:32,178 INFO L226 Difference]: Without dead ends: 398 [2024-11-19 01:05:32,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:05:32,180 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 107 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:32,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 507 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 01:05:32,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-19 01:05:32,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 372. [2024-11-19 01:05:32,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 345 states have (on average 1.3855072463768117) internal successors, (478), 348 states have internal predecessors, (478), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 01:05:32,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 522 transitions. [2024-11-19 01:05:32,204 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 522 transitions. Word has length 132 [2024-11-19 01:05:32,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:32,204 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 522 transitions. [2024-11-19 01:05:32,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:05:32,204 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 522 transitions. [2024-11-19 01:05:32,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 01:05:32,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:32,206 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:32,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:05:32,206 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:32,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:32,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1525223603, now seen corresponding path program 1 times [2024-11-19 01:05:32,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:05:32,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106447160] [2024-11-19 01:05:32,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:32,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:05:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:32,439 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 01:05:32,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:05:32,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106447160] [2024-11-19 01:05:32,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106447160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:32,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:32,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:05:32,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846612831] [2024-11-19 01:05:32,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:32,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:05:32,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:05:32,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:05:32,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:05:32,441 INFO L87 Difference]: Start difference. First operand 372 states and 522 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:05:32,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:32,462 INFO L93 Difference]: Finished difference Result 741 states and 1041 transitions. [2024-11-19 01:05:32,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:05:32,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 134 [2024-11-19 01:05:32,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:32,466 INFO L225 Difference]: With dead ends: 741 [2024-11-19 01:05:32,467 INFO L226 Difference]: Without dead ends: 372 [2024-11-19 01:05:32,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:05:32,468 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:32,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 334 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:05:32,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-19 01:05:32,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2024-11-19 01:05:32,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 345 states have (on average 1.3710144927536232) internal successors, (473), 348 states have internal predecessors, (473), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 01:05:32,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 517 transitions. [2024-11-19 01:05:32,493 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 517 transitions. Word has length 134 [2024-11-19 01:05:32,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:32,494 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 517 transitions. [2024-11-19 01:05:32,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:05:32,494 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 517 transitions. [2024-11-19 01:05:32,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 01:05:32,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:32,496 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:32,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:05:32,496 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:32,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:32,497 INFO L85 PathProgramCache]: Analyzing trace with hash -468921103, now seen corresponding path program 1 times [2024-11-19 01:05:32,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:05:32,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549095589] [2024-11-19 01:05:32,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:32,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:05:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:05:32,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:05:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:05:32,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:05:32,767 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:05:32,768 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 01:05:32,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 01:05:32,772 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:32,851 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:05:32,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:05:32 BoogieIcfgContainer [2024-11-19 01:05:32,857 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:05:32,858 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:05:32,858 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:05:32,858 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:05:32,859 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:05:24" (3/4) ... [2024-11-19 01:05:32,861 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 01:05:32,862 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:05:32,863 INFO L158 Benchmark]: Toolchain (without parser) took 9446.21ms. Allocated memory was 172.0MB in the beginning and 323.0MB in the end (delta: 151.0MB). Free memory was 115.4MB in the beginning and 141.7MB in the end (delta: -26.3MB). Peak memory consumption was 126.5MB. Max. memory is 16.1GB. [2024-11-19 01:05:32,863 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 172.0MB. Free memory is still 137.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:05:32,863 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.20ms. Allocated memory is still 172.0MB. Free memory was 115.1MB in the beginning and 96.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 01:05:32,864 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.02ms. Allocated memory is still 172.0MB. Free memory was 96.2MB in the beginning and 91.8MB in the end (delta: 4.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 01:05:32,864 INFO L158 Benchmark]: Boogie Preprocessor took 73.10ms. Allocated memory is still 172.0MB. Free memory was 91.8MB in the beginning and 87.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:05:32,864 INFO L158 Benchmark]: RCFGBuilder took 1008.35ms. Allocated memory was 172.0MB in the beginning and 222.3MB in the end (delta: 50.3MB). Free memory was 87.6MB in the beginning and 167.4MB in the end (delta: -79.9MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2024-11-19 01:05:32,865 INFO L158 Benchmark]: TraceAbstraction took 7877.19ms. Allocated memory was 222.3MB in the beginning and 323.0MB in the end (delta: 100.7MB). Free memory was 167.4MB in the beginning and 141.7MB in the end (delta: 25.8MB). Peak memory consumption was 126.4MB. Max. memory is 16.1GB. [2024-11-19 01:05:32,865 INFO L158 Benchmark]: Witness Printer took 4.68ms. Allocated memory is still 323.0MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:05:32,866 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.27ms. Allocated memory is still 172.0MB. Free memory is still 137.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 413.20ms. Allocated memory is still 172.0MB. Free memory was 115.1MB in the beginning and 96.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.02ms. Allocated memory is still 172.0MB. Free memory was 96.2MB in the beginning and 91.8MB in the end (delta: 4.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.10ms. Allocated memory is still 172.0MB. Free memory was 91.8MB in the beginning and 87.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1008.35ms. Allocated memory was 172.0MB in the beginning and 222.3MB in the end (delta: 50.3MB). Free memory was 87.6MB in the beginning and 167.4MB in the end (delta: -79.9MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7877.19ms. Allocated memory was 222.3MB in the beginning and 323.0MB in the end (delta: 100.7MB). Free memory was 167.4MB in the beginning and 141.7MB in the end (delta: 25.8MB). Peak memory consumption was 126.4MB. Max. memory is 16.1GB. * Witness Printer took 4.68ms. Allocated memory is still 323.0MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 107. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 1, 63.75, 255.75, 10, 4, -10, 4.75, 99.5, 255.9, 24.85, -2, 1629954775, 1928642731, 0, 5 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] FCALL updateLastVariables() [L115] CALL updateVariables() [L80] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L81] EXPR WrapperStruct00.var_1_2 [L81] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F [L81] EXPR WrapperStruct00.var_1_2 [L81] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L81] EXPR (WrapperStruct00.var_1_2 >= 0.0F && 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] [L81] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && 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] [L81] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && 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] [L82] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L83] EXPR WrapperStruct00.var_1_3 [L83] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F [L83] EXPR WrapperStruct00.var_1_3 [L83] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L83] EXPR (WrapperStruct00.var_1_3 >= 0.0F && 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] [L83] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && 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] [L83] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && 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] [L84] WrapperStruct00.var_1_5 = __VERIFIER_nondet_char() [L85] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1] [L86] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L87] WrapperStruct00.var_1_6 = __VERIFIER_nondet_char() [L88] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L89] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L91] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L94] EXPR WrapperStruct00.var_1_9 [L94] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L94] EXPR WrapperStruct00.var_1_9 [L94] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L94] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 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] [L94] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L96] EXPR WrapperStruct00.var_1_10 [L96] EXPR WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_10 [L96] EXPR WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L96] EXPR (WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 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_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] WrapperStruct00.var_1_13 = __VERIFIER_nondet_long() [L98] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 1073741822) 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_13 >= 1073741822) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483646) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483646) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] WrapperStruct00.var_1_15 = __VERIFIER_nondet_long() [L101] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 2147483646) 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_15 <= 2147483646) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] RET updateVariables() [L116] CALL step() [L60] signed long int stepLocal_0 = -4; [L61] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=-4] [L61] COND TRUE stepLocal_0 < WrapperStruct00.var_1_6 [L62] EXPR WrapperStruct00.var_1_9 [L62] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L62] EXPR ((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10) [L62] EXPR WrapperStruct00.var_1_9 [L62] EXPR ((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10) VAL [WrapperStruct00={4:0}, isInitial=1] [L62] WrapperStruct00.var_1_8 = ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))) [L64] EXPR WrapperStruct00.var_1_9 [L64] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L64] EXPR ((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10) [L64] EXPR WrapperStruct00.var_1_10 [L64] EXPR ((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10) VAL [WrapperStruct00={4:0}, isInitial=1] [L64] WrapperStruct00.var_1_11 = ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))) [L65] EXPR WrapperStruct00.var_1_5 [L65] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_5 [L66] EXPR WrapperStruct00.var_1_6 [L66] WrapperStruct00.var_1_19 = WrapperStruct00.var_1_6 [L67] EXPR WrapperStruct00.var_1_2 [L67] EXPR WrapperStruct00.var_1_3 [L67] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L67] COND TRUE (WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) <= (- WrapperStruct00.var_1_8) [L68] EXPR WrapperStruct00.var_1_5 [L68] EXPR WrapperStruct00.var_1_6 [L68] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L68] EXPR (((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) < (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_7) [L68] EXPR WrapperStruct00.var_1_5 [L68] EXPR WrapperStruct00.var_1_6 [L68] EXPR (((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) < (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_7) VAL [WrapperStruct00={4:0}, isInitial=1] [L68] WrapperStruct00.var_1_1 = (((((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) < (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_7))) [L72] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L72] EXPR WrapperStruct00.var_1_6 | 5 VAL [WrapperStruct00={4:0}, isInitial=1] [L72] signed long int stepLocal_1 = WrapperStruct00.var_1_6 | 5; [L73] EXPR WrapperStruct00.var_1_5 [L73] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=5] [L73] EXPR ((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_7) [L73] EXPR WrapperStruct00.var_1_5 [L73] EXPR ((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_7) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=5] [L73] COND FALSE !(stepLocal_1 <= ((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_7)))) [L76] EXPR WrapperStruct00.var_1_6 [L76] EXPR WrapperStruct00.var_1_19 [L76] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L76] EXPR ((WrapperStruct00.var_1_19) < (WrapperStruct00.var_1_19)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_19) [L76] EXPR WrapperStruct00.var_1_19 [L76] EXPR ((WrapperStruct00.var_1_19) < (WrapperStruct00.var_1_19)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_19) VAL [WrapperStruct00={4:0}, isInitial=1] [L76] EXPR WrapperStruct00.var_1_19 [L76] WrapperStruct00.var_1_12 = (WrapperStruct00.var_1_6 + (((((WrapperStruct00.var_1_19) < (WrapperStruct00.var_1_19)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_19))) - WrapperStruct00.var_1_19)) [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR WrapperStruct00.var_1_2 [L107] EXPR WrapperStruct00.var_1_3 [L107] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR ((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) <= (- WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed char) (((((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) < (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_7))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5)) [L107] EXPR WrapperStruct00.var_1_1 [L107] EXPR WrapperStruct00.var_1_5 [L107] EXPR ((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) <= (- WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed char) (((((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) < (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_7))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR (((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) <= (- WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed char) (((((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) < (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_7))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5))) && ((-4 < WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR ((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) <= (- WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed char) (((((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) < (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_7))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5))) && ((-4 < WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_11 == ((float) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR (((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) <= (- WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed char) (((((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) < (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_7))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5))) && ((-4 < WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_11 == ((float) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10)))))) && (((WrapperStruct00.var_1_6 | 5) <= ((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_7)))) ? (WrapperStruct00.var_1_12 == ((signed long int) (((((WrapperStruct00.var_1_6) < ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_6) : ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_19)))) - (WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_5) < 0 ) ? -(WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_5))))))) : (WrapperStruct00.var_1_12 == ((signed long int) (WrapperStruct00.var_1_6 + (((((WrapperStruct00.var_1_19) < (WrapperStruct00.var_1_19)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_19))) - WrapperStruct00.var_1_19))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR ((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) <= (- WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed char) (((((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) < (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_7))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5))) && ((-4 < WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_11 == ((float) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10)))))) && (((WrapperStruct00.var_1_6 | 5) <= ((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_7)))) ? (WrapperStruct00.var_1_12 == ((signed long int) (((((WrapperStruct00.var_1_6) < ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_6) : ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_19)))) - (WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_5) < 0 ) ? -(WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_5))))))) : (WrapperStruct00.var_1_12 == ((signed long int) (WrapperStruct00.var_1_6 + (((((WrapperStruct00.var_1_19) < (WrapperStruct00.var_1_19)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_19))) - WrapperStruct00.var_1_19)))))) && (WrapperStruct00.var_1_18 == ((signed short int) WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR (((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) <= (- WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed char) (((((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) < (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_7))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5))) && ((-4 < WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_11 == ((float) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10)))))) && (((WrapperStruct00.var_1_6 | 5) <= ((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_7)))) ? (WrapperStruct00.var_1_12 == ((signed long int) (((((WrapperStruct00.var_1_6) < ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_6) : ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_19)))) - (WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_5) < 0 ) ? -(WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_5))))))) : (WrapperStruct00.var_1_12 == ((signed long int) (WrapperStruct00.var_1_6 + (((((WrapperStruct00.var_1_19) < (WrapperStruct00.var_1_19)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_19))) - WrapperStruct00.var_1_19)))))) && (WrapperStruct00.var_1_18 == ((signed short int) WrapperStruct00.var_1_5))) && (WrapperStruct00.var_1_19 == ((unsigned short int) WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1] [L107-L108] return (((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) <= (- WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed char) (((((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) < (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_7))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5))) && ((-4 < WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_11 == ((float) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10)))))) && (((WrapperStruct00.var_1_6 | 5) <= ((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_7)))) ? (WrapperStruct00.var_1_12 == ((signed long int) (((((WrapperStruct00.var_1_6) < ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_6) : ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_19)))) - (WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_5) < 0 ) ? -(WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_5))))))) : (WrapperStruct00.var_1_12 == ((signed long int) (WrapperStruct00.var_1_6 + (((((WrapperStruct00.var_1_19) < (WrapperStruct00.var_1_19)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_19))) - WrapperStruct00.var_1_19)))))) && (WrapperStruct00.var_1_18 == ((signed short int) WrapperStruct00.var_1_5))) && (WrapperStruct00.var_1_19 == ((unsigned short int) WrapperStruct00.var_1_6)) ; [L117] RET, EXPR property() [L117] 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, 123 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 8, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 455 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 455 mSDsluCounter, 3331 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2148 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1218 IncrementalHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 1183 mSDtfsCounter, 1218 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=372occurred in iteration=5, InterpolantAutomatonStates: 31, 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, 7 MinimizatonAttempts, 95 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1182 NumberOfCodeBlocks, 1182 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1040 ConstructedInterpolants, 0 QuantifiedInterpolants, 1469 SizeOfPredicates, 0 NumberOfNonLiveVariables, 515 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 2886/2912 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 01:05:32,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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-28.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 e1d78d248c74132bd311292745f8a4e0496a51de00b4b221480ef3ff016a6c65 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:05:35,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:05:35,224 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 01:05:35,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:05:35,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:05:35,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:05:35,263 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:05:35,263 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:05:35,264 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:05:35,264 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:05:35,264 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:05:35,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:05:35,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:05:35,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:05:35,266 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:05:35,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:05:35,267 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:05:35,267 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:05:35,267 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:05:35,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:05:35,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:05:35,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:05:35,269 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:05:35,270 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 01:05:35,270 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 01:05:35,270 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:05:35,271 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 01:05:35,271 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:05:35,275 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:05:35,276 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:05:35,276 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:05:35,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:05:35,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:05:35,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:05:35,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:05:35,277 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:05:35,277 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:05:35,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:05:35,278 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 01:05:35,278 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 01:05:35,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:05:35,280 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:05:35,280 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:05:35,280 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:05:35,281 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 -> e1d78d248c74132bd311292745f8a4e0496a51de00b4b221480ef3ff016a6c65 [2024-11-19 01:05:35,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:05:35,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:05:35,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:05:35,648 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:05:35,649 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:05:35,650 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-28.i [2024-11-19 01:05:37,179 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:05:37,428 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:05:37,430 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-28.i [2024-11-19 01:05:37,440 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7f70fabb/db23d3c323434a84b5144baf393d402c/FLAG5d2affd07 [2024-11-19 01:05:37,454 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7f70fabb/db23d3c323434a84b5144baf393d402c [2024-11-19 01:05:37,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:05:37,457 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:05:37,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:05:37,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:05:37,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:05:37,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:05:37" (1/1) ... [2024-11-19 01:05:37,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ed55f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:37, skipping insertion in model container [2024-11-19 01:05:37,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:05:37" (1/1) ... [2024-11-19 01:05:37,494 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:05:37,699 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-28.i[916,929] [2024-11-19 01:05:37,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:05:37,807 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:05:37,834 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-28.i[916,929] [2024-11-19 01:05:37,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:05:37,940 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:05:37,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:37 WrapperNode [2024-11-19 01:05:37,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:05:37,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:05:37,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:05:37,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:05:37,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:37" (1/1) ... [2024-11-19 01:05:37,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:37" (1/1) ... [2024-11-19 01:05:38,027 INFO L138 Inliner]: procedures = 37, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 552 [2024-11-19 01:05:38,028 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:05:38,029 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:05:38,030 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:05:38,030 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:05:38,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:37" (1/1) ... [2024-11-19 01:05:38,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:37" (1/1) ... [2024-11-19 01:05:38,052 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:37" (1/1) ... [2024-11-19 01:05:38,086 INFO L175 MemorySlicer]: Split 153 memory accesses to 2 slices as follows [2, 151]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 33 writes are split as follows [0, 33]. [2024-11-19 01:05:38,086 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:37" (1/1) ... [2024-11-19 01:05:38,086 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:37" (1/1) ... [2024-11-19 01:05:38,121 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:37" (1/1) ... [2024-11-19 01:05:38,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:37" (1/1) ... [2024-11-19 01:05:38,136 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:37" (1/1) ... [2024-11-19 01:05:38,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:37" (1/1) ... [2024-11-19 01:05:38,150 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:05:38,153 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:05:38,153 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:05:38,153 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:05:38,154 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:37" (1/1) ... [2024-11-19 01:05:38,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:05:38,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:05:38,188 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 01:05:38,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 01:05:38,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:05:38,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 01:05:38,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 01:05:38,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 01:05:38,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 01:05:38,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 01:05:38,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 01:05:38,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 01:05:38,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 01:05:38,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 01:05:38,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 01:05:38,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-19 01:05:38,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-19 01:05:38,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 01:05:38,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 01:05:38,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-19 01:05:38,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-19 01:05:38,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-19 01:05:38,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-19 01:05:38,246 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:05:38,246 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:05:38,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-19 01:05:38,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-19 01:05:38,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:05:38,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:05:38,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 01:05:38,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 01:05:38,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 01:05:38,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 01:05:38,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 01:05:38,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 01:05:38,418 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:05:38,420 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:05:40,404 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2024-11-19 01:05:40,404 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:05:40,445 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:05:40,445 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:05:40,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:05:40 BoogieIcfgContainer [2024-11-19 01:05:40,446 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:05:40,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:05:40,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:05:40,453 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:05:40,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:05:37" (1/3) ... [2024-11-19 01:05:40,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ef1985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:05:40, skipping insertion in model container [2024-11-19 01:05:40,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:37" (2/3) ... [2024-11-19 01:05:40,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ef1985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:05:40, skipping insertion in model container [2024-11-19 01:05:40,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:05:40" (3/3) ... [2024-11-19 01:05:40,457 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-28.i [2024-11-19 01:05:40,475 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:05:40,476 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:05:40,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:05:40,552 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;@213c44a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:05:40,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:05:40,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 99 states have internal predecessors, (140), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 01:05:40,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 01:05:40,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:40,568 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:40,568 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:40,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:40,574 INFO L85 PathProgramCache]: Analyzing trace with hash 2114448736, now seen corresponding path program 1 times [2024-11-19 01:05:40,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:05:40,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699314376] [2024-11-19 01:05:40,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:40,588 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:40,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:05:40,591 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:05:40,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 01:05:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:40,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:05:41,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:05:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-19 01:05:41,062 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:05:41,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:05:41,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [699314376] [2024-11-19 01:05:41,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [699314376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:41,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:41,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:05:41,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975961673] [2024-11-19 01:05:41,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:41,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:05:41,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:05:41,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:05:41,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:05:41,100 INFO L87 Difference]: Start difference. First operand has 115 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 99 states have internal predecessors, (140), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 01:05:41,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:41,130 INFO L93 Difference]: Finished difference Result 223 states and 344 transitions. [2024-11-19 01:05:41,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:05:41,132 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2024-11-19 01:05:41,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:41,138 INFO L225 Difference]: With dead ends: 223 [2024-11-19 01:05:41,139 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 01:05:41,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:05:41,145 INFO L432 NwaCegarLoop]: 161 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, 161 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:41,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:05:41,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 01:05:41,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-19 01:05:41,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 01:05:41,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2024-11-19 01:05:41,185 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 128 [2024-11-19 01:05:41,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:41,186 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2024-11-19 01:05:41,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 01:05:41,186 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2024-11-19 01:05:41,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 01:05:41,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:41,189 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:41,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 01:05:41,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:41,392 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:41,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:41,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1153224588, now seen corresponding path program 1 times [2024-11-19 01:05:41,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:05:41,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970751523] [2024-11-19 01:05:41,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:41,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:41,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:05:41,397 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:05:41,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 01:05:41,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:41,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:05:41,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:05:41,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-19 01:05:41,967 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 01:05:41,967 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:05:41,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:05:41,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970751523] [2024-11-19 01:05:41,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970751523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:41,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:41,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:05:41,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769287077] [2024-11-19 01:05:41,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:41,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:05:41,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:05:41,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:05:41,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:05:41,973 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:05:42,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:42,029 INFO L93 Difference]: Finished difference Result 219 states and 319 transitions. [2024-11-19 01:05:42,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:05:42,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 128 [2024-11-19 01:05:42,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:42,036 INFO L225 Difference]: With dead ends: 219 [2024-11-19 01:05:42,036 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 01:05:42,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:05:42,039 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:42,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 314 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:05:42,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 01:05:42,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-19 01:05:42,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 95 states have internal predecessors, (132), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 01:05:42,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 160 transitions. [2024-11-19 01:05:42,062 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 160 transitions. Word has length 128 [2024-11-19 01:05:42,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:42,065 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 160 transitions. [2024-11-19 01:05:42,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:05:42,065 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 160 transitions. [2024-11-19 01:05:42,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 01:05:42,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:42,070 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:42,084 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 (3)] Forceful destruction successful, exit code 0 [2024-11-19 01:05:42,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:42,271 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:42,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:42,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1147598002, now seen corresponding path program 1 times [2024-11-19 01:05:42,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:05:42,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [774924298] [2024-11-19 01:05:42,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:42,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:42,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:05:42,277 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:05:42,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 01:05:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:42,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 01:05:42,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:05:42,723 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 01:05:42,724 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:05:42,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:05:42,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [774924298] [2024-11-19 01:05:42,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [774924298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:42,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:42,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:05:42,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940470386] [2024-11-19 01:05:42,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:42,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:05:42,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:05:42,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:05:42,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:05:42,727 INFO L87 Difference]: Start difference. First operand 111 states and 160 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:05:42,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:42,829 INFO L93 Difference]: Finished difference Result 226 states and 327 transitions. [2024-11-19 01:05:42,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:05:42,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 128 [2024-11-19 01:05:42,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:42,832 INFO L225 Difference]: With dead ends: 226 [2024-11-19 01:05:42,832 INFO L226 Difference]: Without dead ends: 118 [2024-11-19 01:05:42,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:05:42,837 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 1 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:42,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 744 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:05:42,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-19 01:05:42,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-11-19 01:05:42,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 101 states have (on average 1.3663366336633664) internal successors, (138), 101 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 01:05:42,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2024-11-19 01:05:42,856 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 128 [2024-11-19 01:05:42,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:42,857 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2024-11-19 01:05:42,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:05:42,858 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2024-11-19 01:05:42,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 01:05:42,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:42,860 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:42,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 01:05:43,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:43,061 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:43,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:43,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1372361932, now seen corresponding path program 1 times [2024-11-19 01:05:43,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:05:43,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [59680576] [2024-11-19 01:05:43,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:43,064 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:43,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:05:43,067 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:05:43,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 01:05:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:43,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:05:43,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:05:43,527 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-19 01:05:43,562 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 01:05:43,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:05:43,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:05:43,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [59680576] [2024-11-19 01:05:43,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [59680576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:43,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:43,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:05:43,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177707104] [2024-11-19 01:05:43,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:43,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:05:43,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:05:43,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:05:43,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:05:43,566 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:05:44,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:05:45,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:45,481 INFO L93 Difference]: Finished difference Result 232 states and 330 transitions. [2024-11-19 01:05:45,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:05:45,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 128 [2024-11-19 01:05:45,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:45,484 INFO L225 Difference]: With dead ends: 232 [2024-11-19 01:05:45,485 INFO L226 Difference]: Without dead ends: 118 [2024-11-19 01:05:45,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 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-19 01:05:45,488 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 154 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:45,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 458 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 01:05:45,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-19 01:05:45,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-11-19 01:05:45,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 101 states have internal predecessors, (137), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 01:05:45,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 165 transitions. [2024-11-19 01:05:45,497 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 165 transitions. Word has length 128 [2024-11-19 01:05:45,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:45,497 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 165 transitions. [2024-11-19 01:05:45,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:05:45,497 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 165 transitions. [2024-11-19 01:05:45,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-19 01:05:45,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:45,499 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:45,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-19 01:05:45,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:45,700 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:45,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:45,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1025550586, now seen corresponding path program 1 times [2024-11-19 01:05:45,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:05:45,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992542502] [2024-11-19 01:05:45,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:45,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:45,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:05:45,703 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:05:45,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 01:05:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:46,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:05:46,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:05:46,149 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-19 01:05:46,176 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 01:05:46,176 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:05:46,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:05:46,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992542502] [2024-11-19 01:05:46,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992542502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:46,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:46,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:05:46,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505712683] [2024-11-19 01:05:46,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:46,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:05:46,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:05:46,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:05:46,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:05:46,179 INFO L87 Difference]: Start difference. First operand 117 states and 165 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 01:05:48,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:48,019 INFO L93 Difference]: Finished difference Result 232 states and 328 transitions. [2024-11-19 01:05:48,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:05:48,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2024-11-19 01:05:48,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:48,021 INFO L225 Difference]: With dead ends: 232 [2024-11-19 01:05:48,021 INFO L226 Difference]: Without dead ends: 118 [2024-11-19 01:05:48,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 125 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-19 01:05:48,022 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 142 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:48,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 453 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 01:05:48,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-19 01:05:48,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-11-19 01:05:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 101 states have internal predecessors, (136), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 01:05:48,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 164 transitions. [2024-11-19 01:05:48,031 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 164 transitions. Word has length 130 [2024-11-19 01:05:48,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:48,032 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 164 transitions. [2024-11-19 01:05:48,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 01:05:48,032 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 164 transitions. [2024-11-19 01:05:48,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 01:05:48,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:48,034 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:48,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 01:05:48,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:48,236 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:48,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:48,236 INFO L85 PathProgramCache]: Analyzing trace with hash -727615500, now seen corresponding path program 1 times [2024-11-19 01:05:48,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:05:48,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100054009] [2024-11-19 01:05:48,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:48,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:48,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:05:48,238 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:05:48,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 01:05:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:48,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 01:05:48,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:05:48,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-19 01:05:48,990 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 36 treesize of output 29 [2024-11-19 01:05:49,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:49,246 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 51 treesize of output 32 [2024-11-19 01:05:49,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:49,426 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 51 treesize of output 32 [2024-11-19 01:05:49,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:49,573 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 51 treesize of output 32 [2024-11-19 01:05:49,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:49,776 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 51 treesize of output 32 [2024-11-19 01:05:49,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:49,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 42 treesize of output 18 [2024-11-19 01:05:50,003 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 201 proven. 27 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-19 01:05:50,003 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:05:50,355 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-19 01:05:50,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:05:50,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1100054009] [2024-11-19 01:05:50,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1100054009] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:05:50,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:05:50,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2024-11-19 01:05:50,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287645363] [2024-11-19 01:05:50,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:05:50,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 01:05:50,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:05:50,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 01:05:50,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:05:50,360 INFO L87 Difference]: Start difference. First operand 117 states and 164 transitions. Second operand has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 6 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-19 01:05:54,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:54,947 INFO L93 Difference]: Finished difference Result 239 states and 331 transitions. [2024-11-19 01:05:54,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 01:05:54,948 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 6 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 132 [2024-11-19 01:05:54,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:54,949 INFO L225 Difference]: With dead ends: 239 [2024-11-19 01:05:54,949 INFO L226 Difference]: Without dead ends: 125 [2024-11-19 01:05:54,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2024-11-19 01:05:54,951 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 301 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:54,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 330 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-19 01:05:54,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-19 01:05:54,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-19 01:05:54,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 107 states have internal predecessors, (141), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 01:05:54,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 169 transitions. [2024-11-19 01:05:54,973 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 169 transitions. Word has length 132 [2024-11-19 01:05:54,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:54,973 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 169 transitions. [2024-11-19 01:05:54,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 6 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-19 01:05:54,974 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 169 transitions. [2024-11-19 01:05:54,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 01:05:54,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:54,975 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:54,991 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-19 01:05:55,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:55,177 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:55,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:55,177 INFO L85 PathProgramCache]: Analyzing trace with hash 57038841, now seen corresponding path program 1 times [2024-11-19 01:05:55,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:05:55,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490138812] [2024-11-19 01:05:55,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:55,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:55,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:05:55,179 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:05:55,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 01:05:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:55,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-19 01:05:55,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:05:55,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 01:05:55,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-19 01:05:55,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:55,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2024-11-19 01:05:56,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:56,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-11-19 01:05:56,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:56,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-11-19 01:05:56,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:56,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-11-19 01:05:56,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:56,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-11-19 01:05:56,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:56,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-11-19 01:05:56,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:56,719 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 76 treesize of output 53 [2024-11-19 01:05:56,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:56,789 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 69 treesize of output 65 [2024-11-19 01:05:56,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:56,954 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 84 treesize of output 68 [2024-11-19 01:05:57,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:57,009 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 109 treesize of output 49 [2024-11-19 01:05:57,064 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 209 proven. 33 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-11-19 01:05:57,064 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:05:57,197 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 01:05:57,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:05:57,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490138812] [2024-11-19 01:05:57,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490138812] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:05:57,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:05:57,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 14 [2024-11-19 01:05:57,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673270212] [2024-11-19 01:05:57,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:57,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:05:57,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:05:57,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:05:57,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:05:57,200 INFO L87 Difference]: Start difference. First operand 125 states and 169 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:05:58,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:58,539 INFO L93 Difference]: Finished difference Result 319 states and 432 transitions. [2024-11-19 01:05:58,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:05:58,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 134 [2024-11-19 01:05:58,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:58,542 INFO L225 Difference]: With dead ends: 319 [2024-11-19 01:05:58,542 INFO L226 Difference]: Without dead ends: 197 [2024-11-19 01:05:58,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-11-19 01:05:58,543 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 80 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:58,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 464 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 01:05:58,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-19 01:05:58,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2024-11-19 01:05:58,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 173 states have (on average 1.3352601156069364) internal successors, (231), 174 states have internal predecessors, (231), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 01:05:58,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 263 transitions. [2024-11-19 01:05:58,558 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 263 transitions. Word has length 134 [2024-11-19 01:05:58,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:58,558 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 263 transitions. [2024-11-19 01:05:58,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:05:58,559 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 263 transitions. [2024-11-19 01:05:58,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-19 01:05:58,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:58,560 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:58,576 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 (8)] Forceful destruction successful, exit code 0 [2024-11-19 01:05:58,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:58,761 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:58,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:58,762 INFO L85 PathProgramCache]: Analyzing trace with hash 712789963, now seen corresponding path program 1 times [2024-11-19 01:05:58,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:05:58,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144649001] [2024-11-19 01:05:58,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:58,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:58,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:05:58,764 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:05:58,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 01:05:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:59,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:05:59,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:05:59,113 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 01:05:59,113 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:05:59,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:05:59,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144649001] [2024-11-19 01:05:59,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144649001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:59,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:59,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:05:59,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454091782] [2024-11-19 01:05:59,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:59,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:05:59,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:05:59,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:05:59,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:05:59,116 INFO L87 Difference]: Start difference. First operand 194 states and 263 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:05:59,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:59,160 INFO L93 Difference]: Finished difference Result 391 states and 531 transitions. [2024-11-19 01:05:59,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:05:59,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 136 [2024-11-19 01:05:59,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:59,165 INFO L225 Difference]: With dead ends: 391 [2024-11-19 01:05:59,165 INFO L226 Difference]: Without dead ends: 200 [2024-11-19 01:05:59,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:05:59,167 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 599 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-19 01:05:59,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:05:59,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-19 01:05:59,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-11-19 01:05:59,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 179 states have (on average 1.324022346368715) internal successors, (237), 180 states have internal predecessors, (237), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 01:05:59,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 269 transitions. [2024-11-19 01:05:59,183 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 269 transitions. Word has length 136 [2024-11-19 01:05:59,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:59,184 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 269 transitions. [2024-11-19 01:05:59,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:05:59,185 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 269 transitions. [2024-11-19 01:05:59,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-19 01:05:59,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:59,187 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:59,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 01:05:59,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:59,387 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:59,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:59,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1945888692, now seen corresponding path program 1 times [2024-11-19 01:05:59,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:05:59,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950662922] [2024-11-19 01:05:59,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:59,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:59,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:05:59,391 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:05:59,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 01:06:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:06:20,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-19 01:06:20,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:06:20,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 01:06:20,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 32 [2024-11-19 01:06:21,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:06:21,662 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 136 treesize of output 63 [2024-11-19 01:06:22,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:06:22,003 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 136 treesize of output 63 [2024-11-19 01:06:22,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:06:22,244 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 131 treesize of output 73 [2024-11-19 01:06:22,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 76 [2024-11-19 01:06:23,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:06:23,812 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 206 treesize of output 109 [2024-11-19 01:06:24,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:06:24,205 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 206 treesize of output 109 [2024-11-19 01:06:24,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:06:24,687 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 206 treesize of output 109 [2024-11-19 01:06:25,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:06:25,832 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 284 treesize of output 151 [2024-11-19 01:06:26,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 45 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 312 treesize of output 184 [2024-11-19 01:06:26,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:06:26,886 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 396 treesize of output 216 [2024-11-19 01:06:36,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:06:36,939 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 312 treesize of output 182 [2024-11-19 01:06:37,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:06:37,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 374 treesize of output 128 [2024-11-19 01:06:39,389 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 204 proven. 72 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-19 01:06:39,389 INFO L311 TraceCheckSpWp]: Computing backward predicates...