./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-14.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 03015dc15296b27011ea4abd50b336e0db146e7d4accd33e7d5903aad3a9693d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 13:03:31,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 13:03:31,929 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 13:03:31,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 13:03:31,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 13:03:31,956 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 13:03:31,957 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 13:03:31,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 13:03:31,958 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 13:03:31,959 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 13:03:31,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 13:03:31,960 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 13:03:31,960 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 13:03:31,960 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 13:03:31,962 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 13:03:31,962 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 13:03:31,962 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 13:03:31,962 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 13:03:31,962 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 13:03:31,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 13:03:31,963 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 13:03:31,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 13:03:31,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 13:03:31,965 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 13:03:31,965 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 13:03:31,965 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 13:03:31,966 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 13:03:31,966 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 13:03:31,966 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 13:03:31,966 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 13:03:31,966 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 13:03:31,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 13:03:31,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:03:31,967 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 13:03:31,967 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 13:03:31,967 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 13:03:31,967 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 13:03:31,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 13:03:31,967 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 13:03:31,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 13:03:31,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 13:03:31,969 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 13:03:31,969 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 -> 03015dc15296b27011ea4abd50b336e0db146e7d4accd33e7d5903aad3a9693d [2024-11-22 13:03:32,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 13:03:32,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 13:03:32,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 13:03:32,216 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 13:03:32,216 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 13:03:32,217 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-14.i [2024-11-22 13:03:33,414 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 13:03:33,585 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 13:03:33,588 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-14.i [2024-11-22 13:03:33,595 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4af3fd45b/6d519ad2aa524d30bc4a0ce455a27f90/FLAG60489e7c8 [2024-11-22 13:03:33,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4af3fd45b/6d519ad2aa524d30bc4a0ce455a27f90 [2024-11-22 13:03:33,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 13:03:33,610 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 13:03:33,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 13:03:33,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 13:03:33,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 13:03:33,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:03:33" (1/1) ... [2024-11-22 13:03:33,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b647544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:03:33, skipping insertion in model container [2024-11-22 13:03:33,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:03:33" (1/1) ... [2024-11-22 13:03:33,641 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 13:03:33,762 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-14.i[916,929] [2024-11-22 13:03:33,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:03:33,817 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 13:03:33,825 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-14.i[916,929] [2024-11-22 13:03:33,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:03:33,886 INFO L204 MainTranslator]: Completed translation [2024-11-22 13:03:33,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:03:33 WrapperNode [2024-11-22 13:03:33,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 13:03:33,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 13:03:33,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 13:03:33,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 13:03:33,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:03:33" (1/1) ... [2024-11-22 13:03:33,906 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:03:33" (1/1) ... [2024-11-22 13:03:33,941 INFO L138 Inliner]: procedures = 30, calls = 183, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 561 [2024-11-22 13:03:33,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 13:03:33,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 13:03:33,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 13:03:33,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 13:03:33,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:03:33" (1/1) ... [2024-11-22 13:03:33,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:03:33" (1/1) ... [2024-11-22 13:03:33,959 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:03:33" (1/1) ... [2024-11-22 13:03:33,967 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-22 13:03:33,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:03:33" (1/1) ... [2024-11-22 13:03:33,968 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:03:33" (1/1) ... [2024-11-22 13:03:33,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:03:33" (1/1) ... [2024-11-22 13:03:33,986 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:03:33" (1/1) ... [2024-11-22 13:03:33,992 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:03:33" (1/1) ... [2024-11-22 13:03:33,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:03:33" (1/1) ... [2024-11-22 13:03:34,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 13:03:34,001 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 13:03:34,001 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 13:03:34,002 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 13:03:34,002 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:03:33" (1/1) ... [2024-11-22 13:03:34,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:03:34,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:03:34,037 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 13:03:34,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 13:03:34,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 13:03:34,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-22 13:03:34,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-22 13:03:34,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-22 13:03:34,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-22 13:03:34,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-22 13:03:34,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-22 13:03:34,082 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 13:03:34,083 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 13:03:34,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-22 13:03:34,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 13:03:34,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 13:03:34,181 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 13:03:34,183 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 13:03:34,701 INFO L? ?]: Removed 141 outVars from TransFormulas that were not future-live. [2024-11-22 13:03:34,701 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 13:03:34,714 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 13:03:34,714 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 13:03:34,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:03:34 BoogieIcfgContainer [2024-11-22 13:03:34,715 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 13:03:34,718 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 13:03:34,719 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 13:03:34,721 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 13:03:34,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:03:33" (1/3) ... [2024-11-22 13:03:34,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3232c72f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:03:34, skipping insertion in model container [2024-11-22 13:03:34,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:03:33" (2/3) ... [2024-11-22 13:03:34,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3232c72f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:03:34, skipping insertion in model container [2024-11-22 13:03:34,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:03:34" (3/3) ... [2024-11-22 13:03:34,724 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-14.i [2024-11-22 13:03:34,737 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 13:03:34,737 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 13:03:34,787 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 13:03:34,792 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;@6239281b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 13:03:34,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 13:03:34,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 105 states have internal predecessors, (148), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 13:03:34,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 13:03:34,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:03:34,810 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:03:34,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:03:34,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:03:34,819 INFO L85 PathProgramCache]: Analyzing trace with hash 774334680, now seen corresponding path program 1 times [2024-11-22 13:03:34,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:03:34,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150324572] [2024-11-22 13:03:34,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:03:34,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:03:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:03:35,173 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-11-22 13:03:35,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:03:35,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150324572] [2024-11-22 13:03:35,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150324572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:03:35,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176052817] [2024-11-22 13:03:35,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:03:35,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:03:35,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:03:35,178 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:03:35,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 13:03:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:03:35,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 13:03:35,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:03:35,448 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-11-22 13:03:35,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:03:35,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176052817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:03:35,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:03:35,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 13:03:35,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263524019] [2024-11-22 13:03:35,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:03:35,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 13:03:35,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:03:35,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 13:03:35,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 13:03:35,478 INFO L87 Difference]: Start difference. First operand has 128 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 105 states have internal predecessors, (148), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 13:03:35,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:03:35,511 INFO L93 Difference]: Finished difference Result 249 states and 395 transitions. [2024-11-22 13:03:35,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 13:03:35,513 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-22 13:03:35,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:03:35,522 INFO L225 Difference]: With dead ends: 249 [2024-11-22 13:03:35,522 INFO L226 Difference]: Without dead ends: 124 [2024-11-22 13:03:35,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 13:03:35,529 INFO L432 NwaCegarLoop]: 183 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, 183 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:03:35,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:03:35,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-22 13:03:35,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-22 13:03:35,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 101 states have (on average 1.396039603960396) internal successors, (141), 101 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 13:03:35,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 183 transitions. [2024-11-22 13:03:35,589 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 183 transitions. Word has length 168 [2024-11-22 13:03:35,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:03:35,590 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 183 transitions. [2024-11-22 13:03:35,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 13:03:35,590 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 183 transitions. [2024-11-22 13:03:35,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 13:03:35,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:03:35,598 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:03:35,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 13:03:35,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 13:03:35,799 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:03:35,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:03:35,800 INFO L85 PathProgramCache]: Analyzing trace with hash -812687366, now seen corresponding path program 1 times [2024-11-22 13:03:35,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:03:35,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909037112] [2024-11-22 13:03:35,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:03:35,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:03:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:03:36,133 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 13:03:36,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:03:36,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909037112] [2024-11-22 13:03:36,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909037112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:03:36,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:03:36,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:03:36,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739357456] [2024-11-22 13:03:36,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:03:36,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:03:36,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:03:36,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:03:36,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:03:36,139 INFO L87 Difference]: Start difference. First operand 124 states and 183 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 13:03:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:03:36,179 INFO L93 Difference]: Finished difference Result 247 states and 366 transitions. [2024-11-22 13:03:36,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:03:36,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-22 13:03:36,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:03:36,184 INFO L225 Difference]: With dead ends: 247 [2024-11-22 13:03:36,184 INFO L226 Difference]: Without dead ends: 126 [2024-11-22 13:03:36,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:03:36,185 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:03:36,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 532 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:03:36,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-22 13:03:36,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-22 13:03:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 103 states have internal predecessors, (143), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 13:03:36,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 185 transitions. [2024-11-22 13:03:36,201 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 185 transitions. Word has length 168 [2024-11-22 13:03:36,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:03:36,204 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 185 transitions. [2024-11-22 13:03:36,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 13:03:36,204 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 185 transitions. [2024-11-22 13:03:36,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 13:03:36,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:03:36,206 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:03:36,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 13:03:36,206 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:03:36,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:03:36,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1052927112, now seen corresponding path program 1 times [2024-11-22 13:03:36,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:03:36,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463941132] [2024-11-22 13:03:36,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:03:36,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:03:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:03:36,372 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 13:03:36,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:03:36,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463941132] [2024-11-22 13:03:36,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463941132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:03:36,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:03:36,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 13:03:36,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026469213] [2024-11-22 13:03:36,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:03:36,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 13:03:36,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:03:36,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 13:03:36,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 13:03:36,377 INFO L87 Difference]: Start difference. First operand 126 states and 185 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 13:03:36,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:03:36,401 INFO L93 Difference]: Finished difference Result 250 states and 369 transitions. [2024-11-22 13:03:36,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 13:03:36,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-22 13:03:36,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:03:36,405 INFO L225 Difference]: With dead ends: 250 [2024-11-22 13:03:36,405 INFO L226 Difference]: Without dead ends: 127 [2024-11-22 13:03:36,406 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-22 13:03:36,407 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:03:36,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:03:36,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-22 13:03:36,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-22 13:03:36,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 13:03:36,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 186 transitions. [2024-11-22 13:03:36,423 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 186 transitions. Word has length 168 [2024-11-22 13:03:36,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:03:36,424 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 186 transitions. [2024-11-22 13:03:36,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 13:03:36,426 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 186 transitions. [2024-11-22 13:03:36,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 13:03:36,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:03:36,429 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:03:36,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 13:03:36,429 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:03:36,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:03:36,432 INFO L85 PathProgramCache]: Analyzing trace with hash -351862534, now seen corresponding path program 1 times [2024-11-22 13:03:36,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:03:36,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345094254] [2024-11-22 13:03:36,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:03:36,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:03:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:03:36,724 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-22 13:03:36,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:03:36,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345094254] [2024-11-22 13:03:36,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345094254] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:03:36,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544780172] [2024-11-22 13:03:36,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:03:36,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:03:36,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:03:36,728 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:03:36,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 13:03:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:03:36,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 13:03:36,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:03:36,994 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 13:03:36,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:03:36,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544780172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:03:36,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:03:36,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-22 13:03:36,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523170607] [2024-11-22 13:03:36,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:03:36,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:03:36,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:03:36,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:03:36,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:03:36,998 INFO L87 Difference]: Start difference. First operand 127 states and 186 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 13:03:37,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:03:37,021 INFO L93 Difference]: Finished difference Result 253 states and 372 transitions. [2024-11-22 13:03:37,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:03:37,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-22 13:03:37,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:03:37,025 INFO L225 Difference]: With dead ends: 253 [2024-11-22 13:03:37,027 INFO L226 Difference]: Without dead ends: 129 [2024-11-22 13:03:37,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:03:37,028 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:03:37,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 532 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:03:37,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-22 13:03:37,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-22 13:03:37,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 106 states have internal predecessors, (146), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 13:03:37,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 188 transitions. [2024-11-22 13:03:37,034 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 188 transitions. Word has length 168 [2024-11-22 13:03:37,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:03:37,035 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 188 transitions. [2024-11-22 13:03:37,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 13:03:37,035 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 188 transitions. [2024-11-22 13:03:37,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 13:03:37,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:03:37,037 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:03:37,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-22 13:03:37,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-22 13:03:37,241 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:03:37,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:03:37,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1311092550, now seen corresponding path program 1 times [2024-11-22 13:03:37,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:03:37,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587921716] [2024-11-22 13:03:37,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:03:37,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:03:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:03:37,723 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 13:03:37,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:03:37,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587921716] [2024-11-22 13:03:37,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587921716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:03:37,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:03:37,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:03:37,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594812120] [2024-11-22 13:03:37,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:03:37,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:03:37,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:03:37,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:03:37,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:03:37,728 INFO L87 Difference]: Start difference. First operand 129 states and 188 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 13:03:38,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:03:38,065 INFO L93 Difference]: Finished difference Result 363 states and 529 transitions. [2024-11-22 13:03:38,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:03:38,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-22 13:03:38,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:03:38,067 INFO L225 Difference]: With dead ends: 363 [2024-11-22 13:03:38,067 INFO L226 Difference]: Without dead ends: 237 [2024-11-22 13:03:38,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-22 13:03:38,069 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 134 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:03:38,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 876 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 13:03:38,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-22 13:03:38,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 132. [2024-11-22 13:03:38,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 109 states have (on average 1.385321100917431) internal successors, (151), 109 states have internal predecessors, (151), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 13:03:38,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 193 transitions. [2024-11-22 13:03:38,086 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 193 transitions. Word has length 168 [2024-11-22 13:03:38,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:03:38,086 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 193 transitions. [2024-11-22 13:03:38,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 13:03:38,086 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 193 transitions. [2024-11-22 13:03:38,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 13:03:38,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:03:38,089 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:03:38,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 13:03:38,090 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:03:38,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:03:38,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1972757496, now seen corresponding path program 1 times [2024-11-22 13:03:38,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:03:38,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780644585] [2024-11-22 13:03:38,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:03:38,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:03:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:03:38,681 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 13:03:38,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:03:38,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780644585] [2024-11-22 13:03:38,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780644585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:03:38,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:03:38,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:03:38,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398686504] [2024-11-22 13:03:38,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:03:38,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:03:38,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:03:38,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:03:38,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:03:38,685 INFO L87 Difference]: Start difference. First operand 132 states and 193 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 13:03:39,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:03:39,075 INFO L93 Difference]: Finished difference Result 262 states and 385 transitions. [2024-11-22 13:03:39,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:03:39,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-22 13:03:39,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:03:39,077 INFO L225 Difference]: With dead ends: 262 [2024-11-22 13:03:39,077 INFO L226 Difference]: Without dead ends: 133 [2024-11-22 13:03:39,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:03:39,078 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 164 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 13:03:39,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 258 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 13:03:39,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-22 13:03:39,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-22 13:03:39,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 110 states have (on average 1.3818181818181818) internal successors, (152), 110 states have internal predecessors, (152), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 13:03:39,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 194 transitions. [2024-11-22 13:03:39,087 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 194 transitions. Word has length 168 [2024-11-22 13:03:39,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:03:39,088 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 194 transitions. [2024-11-22 13:03:39,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 13:03:39,088 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 194 transitions. [2024-11-22 13:03:39,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 13:03:39,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:03:39,090 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:03:39,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 13:03:39,090 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:03:39,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:03:39,090 INFO L85 PathProgramCache]: Analyzing trace with hash 692893818, now seen corresponding path program 1 times [2024-11-22 13:03:39,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:03:39,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274471382] [2024-11-22 13:03:39,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:03:39,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:03:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:03:39,669 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 13:03:39,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:03:39,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274471382] [2024-11-22 13:03:39,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274471382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:03:39,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:03:39,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:03:39,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6786102] [2024-11-22 13:03:39,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:03:39,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:03:39,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:03:39,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:03:39,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:03:39,672 INFO L87 Difference]: Start difference. First operand 133 states and 194 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 13:03:40,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:03:40,124 INFO L93 Difference]: Finished difference Result 380 states and 555 transitions. [2024-11-22 13:03:40,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:03:40,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-22 13:03:40,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:03:40,126 INFO L225 Difference]: With dead ends: 380 [2024-11-22 13:03:40,127 INFO L226 Difference]: Without dead ends: 250 [2024-11-22 13:03:40,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:03:40,128 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 381 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 13:03:40,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 348 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 13:03:40,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-22 13:03:40,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 130. [2024-11-22 13:03:40,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 107 states have internal predecessors, (146), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 13:03:40,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 188 transitions. [2024-11-22 13:03:40,138 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 188 transitions. Word has length 168 [2024-11-22 13:03:40,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:03:40,139 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 188 transitions. [2024-11-22 13:03:40,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 13:03:40,139 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 188 transitions. [2024-11-22 13:03:40,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-22 13:03:40,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:03:40,140 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:03:40,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 13:03:40,141 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:03:40,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:03:40,141 INFO L85 PathProgramCache]: Analyzing trace with hash -353407885, now seen corresponding path program 1 times [2024-11-22 13:03:40,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:03:40,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626213978] [2024-11-22 13:03:40,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:03:40,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:03:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:03:40,727 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 13:03:40,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:03:40,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626213978] [2024-11-22 13:03:40,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626213978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:03:40,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:03:40,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:03:40,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996368222] [2024-11-22 13:03:40,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:03:40,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:03:40,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:03:40,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:03:40,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:03:40,730 INFO L87 Difference]: Start difference. First operand 130 states and 188 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 13:03:41,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:03:41,199 INFO L93 Difference]: Finished difference Result 376 states and 546 transitions. [2024-11-22 13:03:41,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:03:41,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 170 [2024-11-22 13:03:41,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:03:41,201 INFO L225 Difference]: With dead ends: 376 [2024-11-22 13:03:41,201 INFO L226 Difference]: Without dead ends: 247 [2024-11-22 13:03:41,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:03:41,202 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 312 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 13:03:41,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 453 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 13:03:41,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-22 13:03:41,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 130. [2024-11-22 13:03:41,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 107 states have (on average 1.3364485981308412) internal successors, (143), 107 states have internal predecessors, (143), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 13:03:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 185 transitions. [2024-11-22 13:03:41,209 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 185 transitions. Word has length 170 [2024-11-22 13:03:41,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:03:41,209 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 185 transitions. [2024-11-22 13:03:41,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 13:03:41,210 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 185 transitions. [2024-11-22 13:03:41,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-22 13:03:41,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:03:41,211 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:03:41,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 13:03:41,211 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:03:41,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:03:41,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1244515379, now seen corresponding path program 1 times [2024-11-22 13:03:41,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:03:41,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179833558] [2024-11-22 13:03:41,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:03:41,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:03:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:03:42,433 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-22 13:03:42,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:03:42,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179833558] [2024-11-22 13:03:42,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179833558] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:03:42,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133613549] [2024-11-22 13:03:42,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:03:42,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:03:42,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:03:42,436 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:03:42,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 13:03:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:03:42,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-22 13:03:42,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:03:42,884 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 85 treesize of output 84 [2024-11-22 13:03:43,597 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 130 treesize of output 114 [2024-11-22 13:03:43,720 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-22 13:03:43,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-22 13:03:44,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-22 13:03:44,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-22 13:03:44,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-22 13:03:44,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-22 13:03:44,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-22 13:03:44,288 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 131 treesize of output 101 [2024-11-22 13:03:44,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:03:44,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 123 [2024-11-22 13:03:44,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 37 [2024-11-22 13:03:44,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:03:44,459 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 147 treesize of output 92 [2024-11-22 13:03:44,577 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 186 treesize of output 146 [2024-11-22 13:03:44,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:03:44,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 146 treesize of output 162 [2024-11-22 13:03:44,767 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 30 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-22 13:03:44,768 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:03:45,260 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-22 13:03:45,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133613549] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 13:03:45,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 13:03:45,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 22 [2024-11-22 13:03:45,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723786507] [2024-11-22 13:03:45,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 13:03:45,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-22 13:03:45,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:03:45,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-22 13:03:45,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2024-11-22 13:03:45,264 INFO L87 Difference]: Start difference. First operand 130 states and 185 transitions. Second operand has 22 states, 19 states have (on average 9.105263157894736) internal successors, (173), 22 states have internal predecessors, (173), 9 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 9 states have call successors, (63) [2024-11-22 13:03:48,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:03:48,026 INFO L93 Difference]: Finished difference Result 603 states and 837 transitions. [2024-11-22 13:03:48,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-22 13:03:48,027 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 9.105263157894736) internal successors, (173), 22 states have internal predecessors, (173), 9 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 9 states have call successors, (63) Word has length 170 [2024-11-22 13:03:48,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:03:48,029 INFO L225 Difference]: With dead ends: 603 [2024-11-22 13:03:48,029 INFO L226 Difference]: Without dead ends: 476 [2024-11-22 13:03:48,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 336 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=637, Invalid=2443, Unknown=0, NotChecked=0, Total=3080 [2024-11-22 13:03:48,031 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 1603 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 1896 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1604 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 2284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 1896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:03:48,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1604 Valid, 876 Invalid, 2284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 1896 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-22 13:03:48,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-22 13:03:48,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 402. [2024-11-22 13:03:48,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 341 states have (on average 1.313782991202346) internal successors, (448), 343 states have internal predecessors, (448), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-22 13:03:48,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 556 transitions. [2024-11-22 13:03:48,061 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 556 transitions. Word has length 170 [2024-11-22 13:03:48,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:03:48,062 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 556 transitions. [2024-11-22 13:03:48,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 9.105263157894736) internal successors, (173), 22 states have internal predecessors, (173), 9 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 9 states have call successors, (63) [2024-11-22 13:03:48,062 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 556 transitions. [2024-11-22 13:03:48,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-22 13:03:48,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:03:48,064 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:03:48,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 13:03:48,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:03:48,265 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:03:48,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:03:48,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1332143155, now seen corresponding path program 1 times [2024-11-22 13:03:48,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:03:48,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221016983] [2024-11-22 13:03:48,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:03:48,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:03:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:03:50,209 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 13:03:50,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:03:50,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221016983] [2024-11-22 13:03:50,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221016983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:03:50,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:03:50,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 13:03:50,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662208504] [2024-11-22 13:03:50,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:03:50,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 13:03:50,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:03:50,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 13:03:50,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-22 13:03:50,211 INFO L87 Difference]: Start difference. First operand 402 states and 556 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 13:03:51,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:03:51,375 INFO L93 Difference]: Finished difference Result 1265 states and 1712 transitions. [2024-11-22 13:03:51,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 13:03:51,376 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 170 [2024-11-22 13:03:51,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:03:51,380 INFO L225 Difference]: With dead ends: 1265 [2024-11-22 13:03:51,380 INFO L226 Difference]: Without dead ends: 866 [2024-11-22 13:03:51,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2024-11-22 13:03:51,382 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 877 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 13:03:51,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 675 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-22 13:03:51,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2024-11-22 13:03:51,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 462. [2024-11-22 13:03:51,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 401 states have (on average 1.2917705735660847) internal successors, (518), 403 states have internal predecessors, (518), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-22 13:03:51,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 626 transitions. [2024-11-22 13:03:51,431 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 626 transitions. Word has length 170 [2024-11-22 13:03:51,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:03:51,431 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 626 transitions. [2024-11-22 13:03:51,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 13:03:51,432 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 626 transitions. [2024-11-22 13:03:51,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-22 13:03:51,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:03:51,433 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:03:51,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 13:03:51,434 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:03:51,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:03:51,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1550997873, now seen corresponding path program 1 times [2024-11-22 13:03:51,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:03:51,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938309175] [2024-11-22 13:03:51,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:03:51,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:03:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:03:51,548 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 13:03:51,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:03:51,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938309175] [2024-11-22 13:03:51,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938309175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:03:51,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:03:51,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:03:51,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959918047] [2024-11-22 13:03:51,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:03:51,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:03:51,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:03:51,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:03:51,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:03:51,552 INFO L87 Difference]: Start difference. First operand 462 states and 626 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 13:03:51,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:03:51,586 INFO L93 Difference]: Finished difference Result 908 states and 1239 transitions. [2024-11-22 13:03:51,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:03:51,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 170 [2024-11-22 13:03:51,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:03:51,590 INFO L225 Difference]: With dead ends: 908 [2024-11-22 13:03:51,590 INFO L226 Difference]: Without dead ends: 449 [2024-11-22 13:03:51,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:03:51,592 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:03:51,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 531 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:03:51,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-22 13:03:51,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2024-11-22 13:03:51,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 388 states have (on average 1.288659793814433) internal successors, (500), 390 states have internal predecessors, (500), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-22 13:03:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 608 transitions. [2024-11-22 13:03:51,617 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 608 transitions. Word has length 170 [2024-11-22 13:03:51,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:03:51,617 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 608 transitions. [2024-11-22 13:03:51,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 13:03:51,618 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 608 transitions. [2024-11-22 13:03:51,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-22 13:03:51,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:03:51,618 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:03:51,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 13:03:51,619 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:03:51,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:03:51,619 INFO L85 PathProgramCache]: Analyzing trace with hash -130573131, now seen corresponding path program 1 times [2024-11-22 13:03:51,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:03:51,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714628183] [2024-11-22 13:03:51,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:03:51,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:03:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:03:51,867 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 13:03:51,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:03:51,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714628183] [2024-11-22 13:03:51,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714628183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:03:51,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:03:51,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:03:51,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054654324] [2024-11-22 13:03:51,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:03:51,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:03:51,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:03:51,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:03:51,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:03:51,868 INFO L87 Difference]: Start difference. First operand 449 states and 608 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 13:03:52,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:03:52,139 INFO L93 Difference]: Finished difference Result 1238 states and 1683 transitions. [2024-11-22 13:03:52,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:03:52,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2024-11-22 13:03:52,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:03:52,144 INFO L225 Difference]: With dead ends: 1238 [2024-11-22 13:03:52,144 INFO L226 Difference]: Without dead ends: 792 [2024-11-22 13:03:52,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-22 13:03:52,145 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 158 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 13:03:52,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 470 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 13:03:52,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2024-11-22 13:03:52,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 541. [2024-11-22 13:03:52,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 456 states have (on average 1.2719298245614035) internal successors, (580), 459 states have internal predecessors, (580), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 72 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-22 13:03:52,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 730 transitions. [2024-11-22 13:03:52,182 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 730 transitions. Word has length 172 [2024-11-22 13:03:52,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:03:52,183 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 730 transitions. [2024-11-22 13:03:52,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 13:03:52,183 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 730 transitions. [2024-11-22 13:03:52,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-22 13:03:52,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:03:52,184 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:03:52,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 13:03:52,184 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:03:52,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:03:52,184 INFO L85 PathProgramCache]: Analyzing trace with hash -42945355, now seen corresponding path program 1 times [2024-11-22 13:03:52,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:03:52,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778669347] [2024-11-22 13:03:52,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:03:52,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:03:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:03:53,735 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 13:03:53,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:03:53,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778669347] [2024-11-22 13:03:53,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778669347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:03:53,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:03:53,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:03:53,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922731721] [2024-11-22 13:03:53,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:03:53,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:03:53,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:03:53,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:03:53,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:03:53,737 INFO L87 Difference]: Start difference. First operand 541 states and 730 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 13:03:54,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:03:54,168 INFO L93 Difference]: Finished difference Result 1009 states and 1357 transitions. [2024-11-22 13:03:54,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:03:54,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2024-11-22 13:03:54,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:03:54,171 INFO L225 Difference]: With dead ends: 1009 [2024-11-22 13:03:54,171 INFO L226 Difference]: Without dead ends: 548 [2024-11-22 13:03:54,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:03:54,175 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 77 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:03:54,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 694 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 13:03:54,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-22 13:03:54,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 503. [2024-11-22 13:03:54,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 418 states have (on average 1.284688995215311) internal successors, (537), 421 states have internal predecessors, (537), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 72 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-22 13:03:54,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 687 transitions. [2024-11-22 13:03:54,214 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 687 transitions. Word has length 172 [2024-11-22 13:03:54,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:03:54,214 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 687 transitions. [2024-11-22 13:03:54,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 13:03:54,214 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 687 transitions. [2024-11-22 13:03:54,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-22 13:03:54,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:03:54,215 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:03:54,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 13:03:54,215 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:03:54,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:03:54,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2076672266, now seen corresponding path program 1 times [2024-11-22 13:03:54,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:03:54,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698922286] [2024-11-22 13:03:54,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:03:54,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:03:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:03:55,433 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 13:03:55,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:03:55,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698922286] [2024-11-22 13:03:55,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698922286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:03:55,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:03:55,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 13:03:55,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202161292] [2024-11-22 13:03:55,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:03:55,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 13:03:55,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:03:55,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 13:03:55,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-22 13:03:55,435 INFO L87 Difference]: Start difference. First operand 503 states and 687 transitions. Second operand has 10 states, 8 states have (on average 9.125) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-22 13:03:55,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:03:55,944 INFO L93 Difference]: Finished difference Result 942 states and 1279 transitions. [2024-11-22 13:03:55,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 13:03:55,944 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.125) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) Word has length 175 [2024-11-22 13:03:55,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:03:55,946 INFO L225 Difference]: With dead ends: 942 [2024-11-22 13:03:55,947 INFO L226 Difference]: Without dead ends: 519 [2024-11-22 13:03:55,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-22 13:03:55,948 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 68 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 13:03:55,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 993 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 13:03:55,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-11-22 13:03:55,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 465. [2024-11-22 13:03:55,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 391 states have (on average 1.2736572890025575) internal successors, (498), 394 states have internal predecessors, (498), 64 states have call successors, (64), 9 states have call predecessors, (64), 9 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-22 13:03:55,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 626 transitions. [2024-11-22 13:03:55,977 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 626 transitions. Word has length 175 [2024-11-22 13:03:55,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:03:55,977 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 626 transitions. [2024-11-22 13:03:55,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.125) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-22 13:03:55,978 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 626 transitions. [2024-11-22 13:03:55,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-22 13:03:55,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:03:55,978 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:03:55,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 13:03:55,979 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:03:55,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:03:55,979 INFO L85 PathProgramCache]: Analyzing trace with hash 754401480, now seen corresponding path program 1 times [2024-11-22 13:03:55,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:03:55,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6050523] [2024-11-22 13:03:55,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:03:55,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:03:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:03:57,039 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 13:03:57,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:03:57,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6050523] [2024-11-22 13:03:57,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6050523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:03:57,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:03:57,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 13:03:57,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316247605] [2024-11-22 13:03:57,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:03:57,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 13:03:57,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:03:57,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 13:03:57,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:03:57,041 INFO L87 Difference]: Start difference. First operand 465 states and 626 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 13:03:57,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:03:57,347 INFO L93 Difference]: Finished difference Result 780 states and 1034 transitions. [2024-11-22 13:03:57,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:03:57,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 177 [2024-11-22 13:03:57,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:03:57,351 INFO L225 Difference]: With dead ends: 780 [2024-11-22 13:03:57,351 INFO L226 Difference]: Without dead ends: 778 [2024-11-22 13:03:57,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-22 13:03:57,353 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 65 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 13:03:57,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 921 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 13:03:57,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2024-11-22 13:03:57,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 774. [2024-11-22 13:03:57,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 668 states have (on average 1.2604790419161678) internal successors, (842), 675 states have internal predecessors, (842), 92 states have call successors, (92), 13 states have call predecessors, (92), 13 states have return successors, (92), 85 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-22 13:03:57,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1026 transitions. [2024-11-22 13:03:57,400 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1026 transitions. Word has length 177 [2024-11-22 13:03:57,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:03:57,401 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1026 transitions. [2024-11-22 13:03:57,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 13:03:57,401 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1026 transitions. [2024-11-22 13:03:57,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-22 13:03:57,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:03:57,402 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:03:57,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 13:03:57,402 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:03:57,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:03:57,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1488434106, now seen corresponding path program 1 times [2024-11-22 13:03:57,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:03:57,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581700222] [2024-11-22 13:03:57,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:03:57,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:03:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:03:58,364 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 13:03:58,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:03:58,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581700222] [2024-11-22 13:03:58,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581700222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:03:58,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:03:58,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:03:58,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310067356] [2024-11-22 13:03:58,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:03:58,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:03:58,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:03:58,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:03:58,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:03:58,366 INFO L87 Difference]: Start difference. First operand 774 states and 1026 transitions. Second operand has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 13:03:58,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:03:58,655 INFO L93 Difference]: Finished difference Result 1542 states and 2036 transitions. [2024-11-22 13:03:58,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:03:58,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2024-11-22 13:03:58,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:03:58,659 INFO L225 Difference]: With dead ends: 1542 [2024-11-22 13:03:58,659 INFO L226 Difference]: Without dead ends: 800 [2024-11-22 13:03:58,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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-22 13:03:58,661 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 46 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 13:03:58,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 589 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 13:03:58,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-22 13:03:58,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 798. [2024-11-22 13:03:58,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 687 states have (on average 1.2532751091703056) internal successors, (861), 694 states have internal predecessors, (861), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 85 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-22 13:03:58,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1045 transitions. [2024-11-22 13:03:58,731 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1045 transitions. Word has length 177 [2024-11-22 13:03:58,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:03:58,731 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1045 transitions. [2024-11-22 13:03:58,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 13:03:58,732 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1045 transitions. [2024-11-22 13:03:58,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-22 13:03:58,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:03:58,734 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:03:58,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 13:03:58,734 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:03:58,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:03:58,735 INFO L85 PathProgramCache]: Analyzing trace with hash -787369528, now seen corresponding path program 1 times [2024-11-22 13:03:58,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:03:58,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234555580] [2024-11-22 13:03:58,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:03:58,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:03:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:03:59,923 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 13:03:59,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:03:59,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234555580] [2024-11-22 13:03:59,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234555580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:03:59,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:03:59,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:03:59,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280931195] [2024-11-22 13:03:59,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:03:59,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 13:03:59,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:03:59,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 13:03:59,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:03:59,925 INFO L87 Difference]: Start difference. First operand 798 states and 1045 transitions. Second operand has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 13:04:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:04:00,480 INFO L93 Difference]: Finished difference Result 1808 states and 2366 transitions. [2024-11-22 13:04:00,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 13:04:00,481 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2024-11-22 13:04:00,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:04:00,484 INFO L225 Difference]: With dead ends: 1808 [2024-11-22 13:04:00,484 INFO L226 Difference]: Without dead ends: 1046 [2024-11-22 13:04:00,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-22 13:04:00,486 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 136 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 13:04:00,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 724 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 13:04:00,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2024-11-22 13:04:00,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 944. [2024-11-22 13:04:00,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 833 states have (on average 1.2376950780312126) internal successors, (1031), 840 states have internal predecessors, (1031), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 85 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-22 13:04:00,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1215 transitions. [2024-11-22 13:04:00,544 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1215 transitions. Word has length 177 [2024-11-22 13:04:00,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:04:00,544 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1215 transitions. [2024-11-22 13:04:00,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 13:04:00,544 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1215 transitions. [2024-11-22 13:04:00,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-22 13:04:00,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:04:00,545 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:04:00,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 13:04:00,546 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:04:00,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:04:00,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1374175542, now seen corresponding path program 1 times [2024-11-22 13:04:00,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:04:00,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407269398] [2024-11-22 13:04:00,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:04:00,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:04:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:04:01,657 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 13:04:01,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:04:01,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407269398] [2024-11-22 13:04:01,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407269398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:04:01,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:04:01,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 13:04:01,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591875661] [2024-11-22 13:04:01,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:04:01,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 13:04:01,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:04:01,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 13:04:01,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:04:01,660 INFO L87 Difference]: Start difference. First operand 944 states and 1215 transitions. Second operand has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-22 13:04:02,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:04:02,898 INFO L93 Difference]: Finished difference Result 2237 states and 2893 transitions. [2024-11-22 13:04:02,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 13:04:02,899 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 177 [2024-11-22 13:04:02,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:04:02,905 INFO L225 Difference]: With dead ends: 2237 [2024-11-22 13:04:02,906 INFO L226 Difference]: Without dead ends: 1329 [2024-11-22 13:04:02,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2024-11-22 13:04:02,908 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 824 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:04:02,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 641 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-22 13:04:02,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2024-11-22 13:04:03,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1046. [2024-11-22 13:04:03,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 918 states have (on average 1.2298474945533768) internal successors, (1129), 924 states have internal predecessors, (1129), 105 states have call successors, (105), 22 states have call predecessors, (105), 22 states have return successors, (105), 99 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-22 13:04:03,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1339 transitions. [2024-11-22 13:04:03,007 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1339 transitions. Word has length 177 [2024-11-22 13:04:03,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:04:03,008 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1339 transitions. [2024-11-22 13:04:03,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-22 13:04:03,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1339 transitions. [2024-11-22 13:04:03,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-22 13:04:03,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:04:03,010 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:04:03,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 13:04:03,010 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:04:03,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:04:03,011 INFO L85 PathProgramCache]: Analyzing trace with hash 871614276, now seen corresponding path program 1 times [2024-11-22 13:04:03,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:04:03,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17338831] [2024-11-22 13:04:03,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:04:03,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:04:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:04:04,018 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 13:04:04,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:04:04,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17338831] [2024-11-22 13:04:04,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17338831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:04:04,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:04:04,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:04:04,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811462785] [2024-11-22 13:04:04,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:04:04,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:04:04,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:04:04,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:04:04,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:04:04,021 INFO L87 Difference]: Start difference. First operand 1046 states and 1339 transitions. Second operand has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 13:04:04,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:04:04,448 INFO L93 Difference]: Finished difference Result 2225 states and 2857 transitions. [2024-11-22 13:04:04,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:04:04,449 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2024-11-22 13:04:04,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:04:04,454 INFO L225 Difference]: With dead ends: 2225 [2024-11-22 13:04:04,454 INFO L226 Difference]: Without dead ends: 1182 [2024-11-22 13:04:04,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 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-22 13:04:04,457 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 46 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 13:04:04,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 724 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 13:04:04,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2024-11-22 13:04:04,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1176. [2024-11-22 13:04:04,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 1036 states have (on average 1.2345559845559846) internal successors, (1279), 1046 states have internal predecessors, (1279), 113 states have call successors, (113), 26 states have call predecessors, (113), 26 states have return successors, (113), 103 states have call predecessors, (113), 113 states have call successors, (113) [2024-11-22 13:04:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1505 transitions. [2024-11-22 13:04:04,527 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1505 transitions. Word has length 177 [2024-11-22 13:04:04,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:04:04,527 INFO L471 AbstractCegarLoop]: Abstraction has 1176 states and 1505 transitions. [2024-11-22 13:04:04,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 13:04:04,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1505 transitions. [2024-11-22 13:04:04,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-22 13:04:04,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:04:04,529 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:04:04,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 13:04:04,529 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:04:04,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:04:04,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1500124986, now seen corresponding path program 1 times [2024-11-22 13:04:04,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:04:04,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31895489] [2024-11-22 13:04:04,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:04:04,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:04:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:04:05,551 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 13:04:05,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:04:05,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31895489] [2024-11-22 13:04:05,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31895489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:04:05,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:04:05,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:04:05,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668237073] [2024-11-22 13:04:05,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:04:05,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 13:04:05,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:04:05,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 13:04:05,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:04:05,554 INFO L87 Difference]: Start difference. First operand 1176 states and 1505 transitions. Second operand has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 13:04:05,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:04:05,944 INFO L93 Difference]: Finished difference Result 2555 states and 3269 transitions. [2024-11-22 13:04:05,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 13:04:05,945 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2024-11-22 13:04:05,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:04:05,950 INFO L225 Difference]: With dead ends: 2555 [2024-11-22 13:04:05,950 INFO L226 Difference]: Without dead ends: 1382 [2024-11-22 13:04:05,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-22 13:04:05,953 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 124 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:04:05,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 889 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 13:04:05,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2024-11-22 13:04:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1275. [2024-11-22 13:04:06,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 1135 states have (on average 1.2237885462555067) internal successors, (1389), 1145 states have internal predecessors, (1389), 113 states have call successors, (113), 26 states have call predecessors, (113), 26 states have return successors, (113), 103 states have call predecessors, (113), 113 states have call successors, (113) [2024-11-22 13:04:06,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1615 transitions. [2024-11-22 13:04:06,028 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1615 transitions. Word has length 177 [2024-11-22 13:04:06,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:04:06,029 INFO L471 AbstractCegarLoop]: Abstraction has 1275 states and 1615 transitions. [2024-11-22 13:04:06,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 13:04:06,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1615 transitions. [2024-11-22 13:04:06,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-22 13:04:06,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:04:06,030 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:04:06,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-22 13:04:06,030 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:04:06,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:04:06,031 INFO L85 PathProgramCache]: Analyzing trace with hash -113921592, now seen corresponding path program 1 times [2024-11-22 13:04:06,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:04:06,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983725173] [2024-11-22 13:04:06,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:04:06,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:04:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:04:07,253 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 13:04:07,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:04:07,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983725173] [2024-11-22 13:04:07,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983725173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:04:07,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:04:07,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 13:04:07,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985373538] [2024-11-22 13:04:07,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:04:07,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 13:04:07,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:04:07,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 13:04:07,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:04:07,256 INFO L87 Difference]: Start difference. First operand 1275 states and 1615 transitions. Second operand has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-22 13:04:08,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:04:08,309 INFO L93 Difference]: Finished difference Result 2814 states and 3576 transitions. [2024-11-22 13:04:08,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 13:04:08,309 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 177 [2024-11-22 13:04:08,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:04:08,314 INFO L225 Difference]: With dead ends: 2814 [2024-11-22 13:04:08,314 INFO L226 Difference]: Without dead ends: 1542 [2024-11-22 13:04:08,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-11-22 13:04:08,317 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 804 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 13:04:08,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 528 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [409 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-22 13:04:08,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2024-11-22 13:04:08,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1272. [2024-11-22 13:04:08,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1132 states have (on average 1.221731448763251) internal successors, (1383), 1142 states have internal predecessors, (1383), 113 states have call successors, (113), 26 states have call predecessors, (113), 26 states have return successors, (113), 103 states have call predecessors, (113), 113 states have call successors, (113) [2024-11-22 13:04:08,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1609 transitions. [2024-11-22 13:04:08,386 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1609 transitions. Word has length 177 [2024-11-22 13:04:08,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:04:08,387 INFO L471 AbstractCegarLoop]: Abstraction has 1272 states and 1609 transitions. [2024-11-22 13:04:08,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-22 13:04:08,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1609 transitions. [2024-11-22 13:04:08,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-22 13:04:08,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:04:08,388 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:04:08,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-22 13:04:08,388 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:04:08,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:04:08,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1813063538, now seen corresponding path program 1 times [2024-11-22 13:04:08,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:04:08,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349781234] [2024-11-22 13:04:08,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:04:08,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:04:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 13:04:08,485 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 13:04:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 13:04:08,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 13:04:08,584 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 13:04:08,586 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 13:04:08,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-22 13:04:08,589 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:04:08,640 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 13:04:08,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:04:08 BoogieIcfgContainer [2024-11-22 13:04:08,642 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 13:04:08,643 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 13:04:08,643 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 13:04:08,643 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 13:04:08,643 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:03:34" (3/4) ... [2024-11-22 13:04:08,645 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 13:04:08,646 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 13:04:08,646 INFO L158 Benchmark]: Toolchain (without parser) took 35036.57ms. Allocated memory was 169.9MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 100.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 196.9MB. Max. memory is 16.1GB. [2024-11-22 13:04:08,646 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 13:04:08,646 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.06ms. Allocated memory is still 169.9MB. Free memory was 100.5MB in the beginning and 80.8MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-22 13:04:08,647 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.35ms. Allocated memory is still 169.9MB. Free memory was 80.8MB in the beginning and 76.2MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 13:04:08,647 INFO L158 Benchmark]: Boogie Preprocessor took 56.62ms. Allocated memory is still 169.9MB. Free memory was 76.2MB in the beginning and 72.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 13:04:08,647 INFO L158 Benchmark]: RCFGBuilder took 713.33ms. Allocated memory is still 169.9MB. Free memory was 72.0MB in the beginning and 108.3MB in the end (delta: -36.3MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-11-22 13:04:08,647 INFO L158 Benchmark]: TraceAbstraction took 33923.67ms. Allocated memory was 169.9MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 107.5MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 203.0MB. Max. memory is 16.1GB. [2024-11-22 13:04:08,647 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 1.5GB. Free memory is still 1.3GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 13:04:08,648 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.06ms. Allocated memory is still 169.9MB. Free memory was 100.5MB in the beginning and 80.8MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.35ms. Allocated memory is still 169.9MB. Free memory was 80.8MB in the beginning and 76.2MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.62ms. Allocated memory is still 169.9MB. Free memory was 76.2MB in the beginning and 72.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 713.33ms. Allocated memory is still 169.9MB. Free memory was 72.0MB in the beginning and 108.3MB in the end (delta: -36.3MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * TraceAbstraction took 33923.67ms. Allocated memory was 169.9MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 107.5MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 203.0MB. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 1.5GB. Free memory is still 1.3GB. 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 126, overapproximation of someBinaryDOUBLEComparisonOperation at line 69. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 1000000, 0, 1, -64, -64, 10, 8, 0, 1, 0, 2, 32.25, 15.5, 256.25, 8.6, 57581 }; [L59] unsigned char last_1_WrapperStruct00_var_1_9 = 0; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_9=0] [L130] isInitial = 1 [L131] FCALL initially() [L132] COND TRUE 1 [L133] CALL updateLastVariables() [L123] EXPR WrapperStruct00.var_1_9 [L123] last_1_WrapperStruct00_var_1_9 = WrapperStruct00.var_1_9 [L133] RET updateLastVariables() [L134] CALL updateVariables() [L88] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L89] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L90] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L91] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L93] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L94] WrapperStruct00.var_1_6 = __VERIFIER_nondet_short() [L95] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= -32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= -32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L96] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L97] WrapperStruct00.var_1_7 = __VERIFIER_nondet_short() [L98] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L99] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L100] WrapperStruct00.var_1_8 = __VERIFIER_nondet_short() [L101] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L102] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L103] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L105] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L106] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L107] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L108] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L109] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L110] EXPR WrapperStruct00.var_1_13 [L110] EXPR WrapperStruct00.var_1_13 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L110] EXPR WrapperStruct00.var_1_13 [L110] EXPR WrapperStruct00.var_1_13 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L110] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L110] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L110] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L111] WrapperStruct00.var_1_14 = __VERIFIER_nondet_float() [L112] EXPR WrapperStruct00.var_1_14 [L112] EXPR WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L112] EXPR WrapperStruct00.var_1_14 [L112] EXPR WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L112] EXPR (WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L112] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L112] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L113] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_14 != 0.0F) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_14 != 0.0F) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L114] WrapperStruct00.var_1_15 = __VERIFIER_nondet_float() [L115] EXPR WrapperStruct00.var_1_15 [L115] EXPR WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_15 [L115] EXPR WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L115] EXPR (WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L116] WrapperStruct00.var_1_16 = __VERIFIER_nondet_double() [L117] EXPR WrapperStruct00.var_1_16 [L117] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F [L117] EXPR WrapperStruct00.var_1_16 [L117] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L117] EXPR (WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L117] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L117] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L118] WrapperStruct00.var_1_17 = __VERIFIER_nondet_ushort() [L119] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L120] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L134] RET updateVariables() [L135] CALL step() [L63] COND FALSE !(\read(last_1_WrapperStruct00_var_1_9)) [L66] EXPR WrapperStruct00.var_1_7 [L66] EXPR WrapperStruct00.var_1_8 [L66] WrapperStruct00.var_1_5 = ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8) [L68] EXPR WrapperStruct00.var_1_13 [L68] EXPR WrapperStruct00.var_1_14 [L68] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L68] COND TRUE (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_14) <= WrapperStruct00.var_1_15 [L69] EXPR WrapperStruct00.var_1_16 [L69] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L69] COND TRUE (WrapperStruct00.var_1_16 - 2.3) > WrapperStruct00.var_1_14 [L70] EXPR WrapperStruct00.var_1_17 [L70] EXPR WrapperStruct00.var_1_7 [L70] WrapperStruct00.var_1_12 = (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_7) [L77] EXPR WrapperStruct00.var_1_5 [L77] EXPR WrapperStruct00.var_1_12 [L77] EXPR (WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2 [L77] EXPR WrapperStruct00.var_1_2 [L77] EXPR (WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L77] ((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3 [L77] EXPR WrapperStruct00.var_1_3 [L77] ((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L77] COND TRUE ((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3 [L78] EXPR WrapperStruct00.var_1_10 [L78] WrapperStruct00.var_1_9 = (! WrapperStruct00.var_1_10) [L82] EXPR WrapperStruct00.var_1_9 [L82] unsigned char stepLocal_0 = WrapperStruct00.var_1_9; [L83] stepLocal_0 && WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L83] COND FALSE !(stepLocal_0 && WrapperStruct00.var_1_9) [L135] RET step() [L136] CALL, EXPR property() [L126] EXPR WrapperStruct00.var_1_9 [L126] EXPR WrapperStruct00.var_1_9 && WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR (WrapperStruct00.var_1_9 && WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_5)) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR ((WrapperStruct00.var_1_9 && WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_5)) : 1) && (last_1_WrapperStruct00_var_1_9 ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_5 == ((signed short int) ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR last_1_WrapperStruct00_var_1_9 ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_5 == ((signed short int) ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8))) [L126] EXPR WrapperStruct00.var_1_5 [L126] EXPR WrapperStruct00.var_1_7 [L126] EXPR WrapperStruct00.var_1_8 [L126] EXPR last_1_WrapperStruct00_var_1_9 ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_5 == ((signed short int) ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR ((WrapperStruct00.var_1_9 && WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_5)) : 1) && (last_1_WrapperStruct00_var_1_9 ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_5 == ((signed short int) ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR (((WrapperStruct00.var_1_9 && WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_5)) : 1) && (last_1_WrapperStruct00_var_1_9 ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_5 == ((signed short int) ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8))))) && ((((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_9 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_9 == ((unsigned char) (! (WrapperStruct00.var_1_11 || WrapperStruct00.var_1_10))))) [L126] EXPR WrapperStruct00.var_1_5 [L126] EXPR WrapperStruct00.var_1_12 [L126] EXPR (WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2 [L126] EXPR WrapperStruct00.var_1_2 [L126] EXPR (WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR ((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3 [L126] EXPR WrapperStruct00.var_1_3 [L126] EXPR ((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR (((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_9 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_9 == ((unsigned char) (! (WrapperStruct00.var_1_11 || WrapperStruct00.var_1_10)))) [L126] EXPR WrapperStruct00.var_1_9 [L126] EXPR WrapperStruct00.var_1_10 [L126] EXPR (((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_9 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_9 == ((unsigned char) (! (WrapperStruct00.var_1_11 || WrapperStruct00.var_1_10)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR (((WrapperStruct00.var_1_9 && WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_5)) : 1) && (last_1_WrapperStruct00_var_1_9 ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_5 == ((signed short int) ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8))))) && ((((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_9 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_9 == ((unsigned char) (! (WrapperStruct00.var_1_11 || WrapperStruct00.var_1_10))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR ((((WrapperStruct00.var_1_9 && WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_5)) : 1) && (last_1_WrapperStruct00_var_1_9 ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_5 == ((signed short int) ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8))))) && ((((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_9 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_9 == ((unsigned char) (! (WrapperStruct00.var_1_11 || WrapperStruct00.var_1_10)))))) && (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_14) <= WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_16 - 2.3) > WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_7) > (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_7) : (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_8))) [L126] EXPR WrapperStruct00.var_1_13 [L126] EXPR WrapperStruct00.var_1_14 [L126] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR ((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_14) <= WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_16 - 2.3) > WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_7) > (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_7) : (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_8)) [L126] EXPR WrapperStruct00.var_1_12 [L126] EXPR WrapperStruct00.var_1_8 [L126] EXPR ((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_14) <= WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_16 - 2.3) > WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_7) > (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_7) : (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR ((((WrapperStruct00.var_1_9 && WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_5)) : 1) && (last_1_WrapperStruct00_var_1_9 ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_5 == ((signed short int) ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8))))) && ((((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_9 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_9 == ((unsigned char) (! (WrapperStruct00.var_1_11 || WrapperStruct00.var_1_10)))))) && (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_14) <= WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_16 - 2.3) > WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_7) > (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_7) : (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_8))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126-L127] return ((((WrapperStruct00.var_1_9 && WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_5)) : 1) && (last_1_WrapperStruct00_var_1_9 ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_5 == ((signed short int) ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8))))) && ((((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_9 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_9 == ((unsigned char) (! (WrapperStruct00.var_1_11 || WrapperStruct00.var_1_10)))))) && (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_14) <= WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_16 - 2.3) > WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_7) > (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_7) : (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_8))) ; [L136] RET, EXPR property() [L136] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.8s, OverallIterations: 22, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5828 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5819 mSDsluCounter, 12795 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9416 mSDsCounter, 1543 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9065 IncrementalHoareTripleChecker+Invalid, 10608 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1543 mSolverCounterUnsat, 3379 mSDtfsCounter, 9065 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1062 GetRequests, 856 SyntacticMatches, 3 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1275occurred in iteration=20, InterpolantAutomatonStates: 187, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 21 MinimizatonAttempts, 1944 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 18.2s InterpolantComputationTime, 4298 NumberOfCodeBlocks, 4298 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 4265 ConstructedInterpolants, 0 QuantifiedInterpolants, 16936 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1763 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 25 InterpolantComputations, 20 PerfectInterpolantSequences, 20810/21000 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-22 13:04:08,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-14.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 03015dc15296b27011ea4abd50b336e0db146e7d4accd33e7d5903aad3a9693d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 13:04:10,518 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 13:04:10,583 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 13:04:10,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 13:04:10,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 13:04:10,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 13:04:10,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 13:04:10,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 13:04:10,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 13:04:10,616 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 13:04:10,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 13:04:10,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 13:04:10,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 13:04:10,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 13:04:10,617 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 13:04:10,619 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 13:04:10,619 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 13:04:10,620 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 13:04:10,620 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 13:04:10,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 13:04:10,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 13:04:10,621 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 13:04:10,621 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 13:04:10,621 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 13:04:10,621 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 13:04:10,621 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 13:04:10,621 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 13:04:10,622 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 13:04:10,622 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 13:04:10,622 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 13:04:10,622 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 13:04:10,622 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 13:04:10,622 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 13:04:10,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 13:04:10,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:04:10,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 13:04:10,623 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 13:04:10,623 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 13:04:10,623 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 13:04:10,623 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 13:04:10,624 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 13:04:10,624 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 13:04:10,625 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 13:04:10,625 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 13:04:10,625 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 -> 03015dc15296b27011ea4abd50b336e0db146e7d4accd33e7d5903aad3a9693d [2024-11-22 13:04:10,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 13:04:10,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 13:04:10,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 13:04:10,928 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 13:04:10,928 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 13:04:10,929 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-14.i [2024-11-22 13:04:12,249 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 13:04:12,442 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 13:04:12,442 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-14.i [2024-11-22 13:04:12,456 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82241fb8b/8355e840877441d688470ae52841b1c0/FLAGc3b2787c0 [2024-11-22 13:04:12,811 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82241fb8b/8355e840877441d688470ae52841b1c0 [2024-11-22 13:04:12,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 13:04:12,814 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 13:04:12,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 13:04:12,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 13:04:12,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 13:04:12,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:04:12" (1/1) ... [2024-11-22 13:04:12,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c26fb6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:04:12, skipping insertion in model container [2024-11-22 13:04:12,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:04:12" (1/1) ... [2024-11-22 13:04:12,843 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 13:04:12,968 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-14.i[916,929] [2024-11-22 13:04:13,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:04:13,044 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 13:04:13,057 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-14.i[916,929] [2024-11-22 13:04:13,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:04:13,131 INFO L204 MainTranslator]: Completed translation [2024-11-22 13:04:13,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:04:13 WrapperNode [2024-11-22 13:04:13,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 13:04:13,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 13:04:13,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 13:04:13,132 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 13:04:13,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:04:13" (1/1) ... [2024-11-22 13:04:13,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:04:13" (1/1) ... [2024-11-22 13:04:13,203 INFO L138 Inliner]: procedures = 40, calls = 183, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 557 [2024-11-22 13:04:13,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 13:04:13,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 13:04:13,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 13:04:13,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 13:04:13,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:04:13" (1/1) ... [2024-11-22 13:04:13,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:04:13" (1/1) ... [2024-11-22 13:04:13,224 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:04:13" (1/1) ... [2024-11-22 13:04:13,242 INFO L175 MemorySlicer]: Split 151 memory accesses to 2 slices as follows [2, 149]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 37 writes are split as follows [0, 37]. [2024-11-22 13:04:13,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:04:13" (1/1) ... [2024-11-22 13:04:13,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:04:13" (1/1) ... [2024-11-22 13:04:13,261 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:04:13" (1/1) ... [2024-11-22 13:04:13,265 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:04:13" (1/1) ... [2024-11-22 13:04:13,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:04:13" (1/1) ... [2024-11-22 13:04:13,270 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:04:13" (1/1) ... [2024-11-22 13:04:13,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 13:04:13,275 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 13:04:13,275 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 13:04:13,276 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 13:04:13,276 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:04:13" (1/1) ... [2024-11-22 13:04:13,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:04:13,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:04:13,314 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 13:04:13,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 13:04:13,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 13:04:13,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-22 13:04:13,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-22 13:04:13,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-22 13:04:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-22 13:04:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-22 13:04:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-22 13:04:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 13:04:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 13:04:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 13:04:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 13:04:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-22 13:04:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-22 13:04:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 13:04:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 13:04:13,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-22 13:04:13,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-22 13:04:13,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-22 13:04:13,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-22 13:04:13,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-22 13:04:13,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-22 13:04:13,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-22 13:04:13,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-22 13:04:13,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-22 13:04:13,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-22 13:04:13,361 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 13:04:13,362 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 13:04:13,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-22 13:04:13,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-22 13:04:13,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 13:04:13,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 13:04:13,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-22 13:04:13,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-22 13:04:13,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-22 13:04:13,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-22 13:04:13,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 13:04:13,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 13:04:13,475 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 13:04:13,476 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 13:04:17,038 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2024-11-22 13:04:17,038 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 13:04:17,049 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 13:04:17,049 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 13:04:17,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:04:17 BoogieIcfgContainer [2024-11-22 13:04:17,050 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 13:04:17,051 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 13:04:17,051 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 13:04:17,054 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 13:04:17,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:04:12" (1/3) ... [2024-11-22 13:04:17,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35711cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:04:17, skipping insertion in model container [2024-11-22 13:04:17,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:04:13" (2/3) ... [2024-11-22 13:04:17,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35711cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:04:17, skipping insertion in model container [2024-11-22 13:04:17,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:04:17" (3/3) ... [2024-11-22 13:04:17,056 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-14.i [2024-11-22 13:04:17,069 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 13:04:17,069 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 13:04:17,130 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 13:04:17,136 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;@5433ea4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 13:04:17,136 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 13:04:17,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 105 states have internal predecessors, (148), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 13:04:17,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 13:04:17,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:04:17,154 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:04:17,155 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:04:17,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:04:17,159 INFO L85 PathProgramCache]: Analyzing trace with hash -822542588, now seen corresponding path program 1 times [2024-11-22 13:04:17,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:04:17,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323540510] [2024-11-22 13:04:17,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:04:17,171 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-22 13:04:17,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:04:17,174 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-22 13:04:17,175 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-22 13:04:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:04:17,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 13:04:17,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:04:17,565 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2024-11-22 13:04:17,568 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:04:17,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:04:17,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323540510] [2024-11-22 13:04:17,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323540510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:04:17,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:04:17,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 13:04:17,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708983707] [2024-11-22 13:04:17,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:04:17,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 13:04:17,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:04:17,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 13:04:17,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 13:04:17,599 INFO L87 Difference]: Start difference. First operand has 128 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 105 states have internal predecessors, (148), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 13:04:17,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:04:17,627 INFO L93 Difference]: Finished difference Result 249 states and 395 transitions. [2024-11-22 13:04:17,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 13:04:17,629 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-22 13:04:17,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:04:17,638 INFO L225 Difference]: With dead ends: 249 [2024-11-22 13:04:17,638 INFO L226 Difference]: Without dead ends: 124 [2024-11-22 13:04:17,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 13:04:17,643 INFO L432 NwaCegarLoop]: 183 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, 183 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:04:17,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:04:17,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-22 13:04:17,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-22 13:04:17,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 101 states have (on average 1.396039603960396) internal successors, (141), 101 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 13:04:17,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 183 transitions. [2024-11-22 13:04:17,692 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 183 transitions. Word has length 168 [2024-11-22 13:04:17,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:04:17,692 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 183 transitions. [2024-11-22 13:04:17,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 13:04:17,693 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 183 transitions. [2024-11-22 13:04:17,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 13:04:17,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:04:17,696 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:04:17,708 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-22 13:04:17,896 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-22 13:04:17,898 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:04:17,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:04:17,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1885402662, now seen corresponding path program 1 times [2024-11-22 13:04:17,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:04:17,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281580929] [2024-11-22 13:04:17,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:04:17,899 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-22 13:04:17,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:04:17,902 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-22 13:04:17,902 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-22 13:04:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:04:18,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 13:04:18,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:04:18,319 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 13:04:18,320 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:04:18,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:04:18,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281580929] [2024-11-22 13:04:18,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281580929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:04:18,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:04:18,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:04:18,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023975736] [2024-11-22 13:04:18,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:04:18,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:04:18,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:04:18,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:04:18,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:04:18,323 INFO L87 Difference]: Start difference. First operand 124 states and 183 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 13:04:18,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:04:18,372 INFO L93 Difference]: Finished difference Result 248 states and 368 transitions. [2024-11-22 13:04:18,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:04:18,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-22 13:04:18,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:04:18,376 INFO L225 Difference]: With dead ends: 248 [2024-11-22 13:04:18,376 INFO L226 Difference]: Without dead ends: 127 [2024-11-22 13:04:18,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:04:18,378 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 1 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:04:18,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 530 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:04:18,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-22 13:04:18,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-22 13:04:18,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 13:04:18,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 186 transitions. [2024-11-22 13:04:18,397 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 186 transitions. Word has length 168 [2024-11-22 13:04:18,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:04:18,398 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 186 transitions. [2024-11-22 13:04:18,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 13:04:18,398 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 186 transitions. [2024-11-22 13:04:18,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 13:04:18,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:04:18,402 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:04:18,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 13:04:18,603 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-22 13:04:18,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:04:18,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:04:18,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1591916184, now seen corresponding path program 1 times [2024-11-22 13:04:18,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:04:18,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683411238] [2024-11-22 13:04:18,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:04:18,605 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-22 13:04:18,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:04:18,607 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-22 13:04:18,608 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-22 13:04:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:04:18,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 13:04:18,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:04:19,013 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 13:04:19,014 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:04:19,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:04:19,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [683411238] [2024-11-22 13:04:19,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [683411238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:04:19,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:04:19,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:04:19,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343301252] [2024-11-22 13:04:19,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:04:19,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:04:19,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:04:19,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:04:19,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:04:19,016 INFO L87 Difference]: Start difference. First operand 127 states and 186 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 13:04:23,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:04:23,122 INFO L93 Difference]: Finished difference Result 252 states and 371 transitions. [2024-11-22 13:04:23,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:04:23,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-22 13:04:23,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:04:23,126 INFO L225 Difference]: With dead ends: 252 [2024-11-22 13:04:23,126 INFO L226 Difference]: Without dead ends: 128 [2024-11-22 13:04:23,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:04:23,127 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 1 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:04:23,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 454 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-22 13:04:23,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-22 13:04:23,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-22 13:04:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 105 states have (on average 1.380952380952381) internal successors, (145), 105 states have internal predecessors, (145), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 13:04:23,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 187 transitions. [2024-11-22 13:04:23,145 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 187 transitions. Word has length 168 [2024-11-22 13:04:23,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:04:23,146 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 187 transitions. [2024-11-22 13:04:23,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 13:04:23,146 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 187 transitions. [2024-11-22 13:04:23,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 13:04:23,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:04:23,152 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:04:23,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-22 13:04:23,352 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-22 13:04:23,353 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:04:23,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:04:23,354 INFO L85 PathProgramCache]: Analyzing trace with hash -580798934, now seen corresponding path program 1 times [2024-11-22 13:04:23,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:04:23,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442995788] [2024-11-22 13:04:23,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:04:23,355 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-22 13:04:23,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:04:23,359 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-22 13:04:23,362 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-22 13:04:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:04:23,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 13:04:23,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:04:24,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:04:24,203 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 173 treesize of output 65 [2024-11-22 13:04:24,262 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2024-11-22 13:04:24,263 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:04:24,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:04:24,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442995788] [2024-11-22 13:04:24,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442995788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:04:24,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:04:24,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:04:24,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308146646] [2024-11-22 13:04:24,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:04:24,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:04:24,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:04:24,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:04:24,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:04:24,265 INFO L87 Difference]: Start difference. First operand 128 states and 187 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 13:04:29,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:04:29,259 INFO L93 Difference]: Finished difference Result 254 states and 372 transitions. [2024-11-22 13:04:29,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:04:29,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-22 13:04:29,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:04:29,261 INFO L225 Difference]: With dead ends: 254 [2024-11-22 13:04:29,261 INFO L226 Difference]: Without dead ends: 129 [2024-11-22 13:04:29,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 163 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-22 13:04:29,264 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 111 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-22 13:04:29,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 517 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-22 13:04:29,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-22 13:04:29,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2024-11-22 13:04:29,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 105 states have (on average 1.3714285714285714) internal successors, (144), 105 states have internal predecessors, (144), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 13:04:29,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 186 transitions. [2024-11-22 13:04:29,271 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 186 transitions. Word has length 168 [2024-11-22 13:04:29,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:04:29,271 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 186 transitions. [2024-11-22 13:04:29,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 13:04:29,272 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 186 transitions. [2024-11-22 13:04:29,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-22 13:04:29,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:04:29,273 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:04:29,284 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-22 13:04:29,474 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-22 13:04:29,474 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:04:29,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:04:29,475 INFO L85 PathProgramCache]: Analyzing trace with hash -515450012, now seen corresponding path program 1 times [2024-11-22 13:04:29,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:04:29,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744353643] [2024-11-22 13:04:29,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:04:29,476 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-22 13:04:29,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:04:29,479 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-22 13:04:29,479 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-22 13:04:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:04:29,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 13:04:29,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:04:29,941 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 94 treesize of output 93 [2024-11-22 13:04:30,164 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 180 treesize of output 150 [2024-11-22 13:04:30,650 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 13:04:30,650 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:04:30,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:04:30,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744353643] [2024-11-22 13:04:30,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744353643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:04:30,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:04:30,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 13:04:30,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424999867] [2024-11-22 13:04:30,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:04:30,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:04:30,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:04:30,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:04:30,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:04:30,653 INFO L87 Difference]: Start difference. First operand 128 states and 186 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 13:04:35,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 13:04:36,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:04:36,427 INFO L93 Difference]: Finished difference Result 383 states and 556 transitions. [2024-11-22 13:04:36,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:04:36,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 170 [2024-11-22 13:04:36,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:04:36,429 INFO L225 Difference]: With dead ends: 383 [2024-11-22 13:04:36,429 INFO L226 Difference]: Without dead ends: 258 [2024-11-22 13:04:36,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:04:36,431 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 104 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-22 13:04:36,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 443 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-11-22 13:04:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-22 13:04:36,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 230. [2024-11-22 13:04:36,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 184 states have (on average 1.3478260869565217) internal successors, (248), 184 states have internal predecessors, (248), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-22 13:04:36,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 332 transitions. [2024-11-22 13:04:36,448 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 332 transitions. Word has length 170 [2024-11-22 13:04:36,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:04:36,449 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 332 transitions. [2024-11-22 13:04:36,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 13:04:36,449 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 332 transitions. [2024-11-22 13:04:36,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-22 13:04:36,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:04:36,451 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:04:36,465 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-22 13:04:36,651 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-22 13:04:36,652 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:04:36,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:04:36,652 INFO L85 PathProgramCache]: Analyzing trace with hash -649463518, now seen corresponding path program 1 times [2024-11-22 13:04:36,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:04:36,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518975173] [2024-11-22 13:04:36,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:04:36,653 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-22 13:04:36,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:04:36,654 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-22 13:04:36,655 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-22 13:04:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:04:37,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-22 13:04:37,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:04:37,184 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-22 13:04:37,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2024-11-22 13:04:37,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:04:37,839 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 52 treesize of output 33 [2024-11-22 13:04:38,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:04:38,030 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 52 treesize of output 33 [2024-11-22 13:04:38,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:04:38,262 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 52 treesize of output 33 [2024-11-22 13:04:38,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:04:38,409 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 53 treesize of output 53 [2024-11-22 13:04:42,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:04:42,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 69 [2024-11-22 13:04:43,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:04:43,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 98 treesize of output 109 [2024-11-22 13:04:43,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:04:43,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 115 treesize of output 123 [2024-11-22 13:04:44,127 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 169 treesize of output 131 [2024-11-22 13:04:44,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:04:44,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:04:44,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 131 treesize of output 221 [2024-11-22 13:04:44,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:04:44,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 148 treesize of output 64 [2024-11-22 13:04:44,653 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 532 proven. 54 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2024-11-22 13:04:44,654 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:04:45,293 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 60 proven. 54 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2024-11-22 13:04:45,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:04:45,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518975173] [2024-11-22 13:04:45,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518975173] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 13:04:45,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 13:04:45,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9] total 22 [2024-11-22 13:04:45,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539131533] [2024-11-22 13:04:45,293 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 13:04:45,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-22 13:04:45,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:04:45,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-22 13:04:45,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=337, Unknown=1, NotChecked=0, Total=462 [2024-11-22 13:04:45,295 INFO L87 Difference]: Start difference. First operand 230 states and 332 transitions. Second operand has 22 states, 18 states have (on average 6.777777777777778) internal successors, (122), 21 states have internal predecessors, (122), 9 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (32), 6 states have call predecessors, (32), 9 states have call successors, (32) [2024-11-22 13:04:51,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]