./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.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-88.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 4ed30b990283645eacfcf3ec95d058dabc11775aacfdc34a24bd9c1336ca33bd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 13:11:58,519 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 13:11:58,612 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 13:11:58,617 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 13:11:58,618 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 13:11:58,631 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 13:11:58,631 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 13:11:58,632 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 13:11:58,632 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 13:11:58,632 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 13:11:58,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 13:11:58,633 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 13:11:58,633 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 13:11:58,634 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 13:11:58,634 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 13:11:58,634 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 13:11:58,634 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 13:11:58,635 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 13:11:58,635 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 13:11:58,635 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 13:11:58,635 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 13:11:58,636 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 13:11:58,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 13:11:58,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 13:11:58,636 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 13:11:58,637 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 13:11:58,637 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 13:11:58,637 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 13:11:58,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 13:11:58,638 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 13:11:58,638 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 13:11:58,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 13:11:58,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:11:58,639 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 13:11:58,639 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 13:11:58,639 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 13:11:58,639 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 13:11:58,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 13:11:58,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 13:11:58,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 13:11:58,640 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 13:11:58,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 13:11:58,641 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 -> 4ed30b990283645eacfcf3ec95d058dabc11775aacfdc34a24bd9c1336ca33bd [2024-11-22 13:11:58,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 13:11:58,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 13:11:58,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 13:11:58,854 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 13:11:58,854 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 13:11:58,856 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-88.i [2024-11-22 13:12:00,268 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 13:12:00,418 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 13:12:00,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i [2024-11-22 13:12:00,425 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86d36dc76/eb69aef698794f23bfb8d01527b6f588/FLAG2190f5986 [2024-11-22 13:12:00,437 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86d36dc76/eb69aef698794f23bfb8d01527b6f588 [2024-11-22 13:12:00,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 13:12:00,440 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 13:12:00,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 13:12:00,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 13:12:00,448 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 13:12:00,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:12:00" (1/1) ... [2024-11-22 13:12:00,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad5752b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:00, skipping insertion in model container [2024-11-22 13:12:00,449 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:12:00" (1/1) ... [2024-11-22 13:12:00,476 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 13:12:00,596 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-88.i[916,929] [2024-11-22 13:12:00,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:12:00,721 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 13:12:00,732 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-88.i[916,929] [2024-11-22 13:12:00,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:12:00,787 INFO L204 MainTranslator]: Completed translation [2024-11-22 13:12:00,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:00 WrapperNode [2024-11-22 13:12:00,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 13:12:00,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 13:12:00,789 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 13:12:00,790 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 13:12:00,795 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:12:00" (1/1) ... [2024-11-22 13:12:00,806 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:12:00" (1/1) ... [2024-11-22 13:12:00,833 INFO L138 Inliner]: procedures = 30, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 521 [2024-11-22 13:12:00,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 13:12:00,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 13:12:00,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 13:12:00,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 13:12:00,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:00" (1/1) ... [2024-11-22 13:12:00,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:00" (1/1) ... [2024-11-22 13:12:00,847 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:00" (1/1) ... [2024-11-22 13:12:00,853 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-22 13:12:00,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:00" (1/1) ... [2024-11-22 13:12:00,853 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:00" (1/1) ... [2024-11-22 13:12:00,869 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:00" (1/1) ... [2024-11-22 13:12:00,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:00" (1/1) ... [2024-11-22 13:12:00,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:00" (1/1) ... [2024-11-22 13:12:00,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:00" (1/1) ... [2024-11-22 13:12:00,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 13:12:00,895 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 13:12:00,895 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 13:12:00,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 13:12:00,895 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:00" (1/1) ... [2024-11-22 13:12:00,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:12:00,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:12:00,934 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:12:00,942 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:12:00,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 13:12:00,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-22 13:12:00,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-22 13:12:00,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-22 13:12:00,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-22 13:12:00,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-22 13:12:00,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-22 13:12:00,981 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 13:12:00,982 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 13:12:00,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-22 13:12:00,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 13:12:00,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 13:12:01,064 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 13:12:01,066 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 13:12:01,765 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-11-22 13:12:01,766 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 13:12:01,778 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 13:12:01,780 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 13:12:01,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:12:01 BoogieIcfgContainer [2024-11-22 13:12:01,781 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 13:12:01,782 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 13:12:01,784 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 13:12:01,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 13:12:01,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:12:00" (1/3) ... [2024-11-22 13:12:01,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a764b64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:12:01, skipping insertion in model container [2024-11-22 13:12:01,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:00" (2/3) ... [2024-11-22 13:12:01,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a764b64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:12:01, skipping insertion in model container [2024-11-22 13:12:01,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:12:01" (3/3) ... [2024-11-22 13:12:01,789 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-88.i [2024-11-22 13:12:01,802 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 13:12:01,802 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 13:12:01,848 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 13:12:01,854 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;@36535044, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 13:12:01,854 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 13:12:01,858 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 100 states have internal predecessors, (141), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 13:12:01,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-22 13:12:01,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:01,869 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:01,870 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:01,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:01,874 INFO L85 PathProgramCache]: Analyzing trace with hash -100183722, now seen corresponding path program 1 times [2024-11-22 13:12:01,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:01,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356782328] [2024-11-22 13:12:01,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:01,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:02,212 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2024-11-22 13:12:02,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:02,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356782328] [2024-11-22 13:12:02,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356782328] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:12:02,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210343821] [2024-11-22 13:12:02,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:02,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:12:02,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:12:02,216 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:12:02,217 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:12:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:02,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 13:12:02,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:12:02,499 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2024-11-22 13:12:02,500 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:12:02,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210343821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:02,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:12:02,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 13:12:02,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624186205] [2024-11-22 13:12:02,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:02,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 13:12:02,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:02,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 13:12:02,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 13:12:02,532 INFO L87 Difference]: Start difference. First operand has 119 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 100 states have internal predecessors, (141), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 13:12:02,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:02,564 INFO L93 Difference]: Finished difference Result 231 states and 361 transitions. [2024-11-22 13:12:02,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 13:12:02,566 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2024-11-22 13:12:02,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:02,573 INFO L225 Difference]: With dead ends: 231 [2024-11-22 13:12:02,573 INFO L226 Difference]: Without dead ends: 115 [2024-11-22 13:12:02,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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:12:02,580 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:02,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:12:02,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-22 13:12:02,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-22 13:12:02,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 13:12:02,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2024-11-22 13:12:02,620 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 143 [2024-11-22 13:12:02,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:02,621 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2024-11-22 13:12:02,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 13:12:02,621 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2024-11-22 13:12:02,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-22 13:12:02,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:02,627 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:02,635 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:12:02,827 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:12:02,828 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:02,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:02,830 INFO L85 PathProgramCache]: Analyzing trace with hash 753164736, now seen corresponding path program 1 times [2024-11-22 13:12:02,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:02,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094499004] [2024-11-22 13:12:02,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:02,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:03,195 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-22 13:12:03,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:03,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094499004] [2024-11-22 13:12:03,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094499004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:03,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:03,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:12:03,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791501307] [2024-11-22 13:12:03,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:03,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:12:03,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:03,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:12:03,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:12:03,198 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 13:12:03,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:03,241 INFO L93 Difference]: Finished difference Result 229 states and 336 transitions. [2024-11-22 13:12:03,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:12:03,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2024-11-22 13:12:03,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:03,243 INFO L225 Difference]: With dead ends: 229 [2024-11-22 13:12:03,243 INFO L226 Difference]: Without dead ends: 117 [2024-11-22 13:12:03,244 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:12:03,245 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 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:12:03,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:12:03,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-22 13:12:03,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-22 13:12:03,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 13:12:03,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2024-11-22 13:12:03,260 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 143 [2024-11-22 13:12:03,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:03,263 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2024-11-22 13:12:03,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 13:12:03,263 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2024-11-22 13:12:03,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-22 13:12:03,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:03,265 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:03,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 13:12:03,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:03,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:03,266 INFO L85 PathProgramCache]: Analyzing trace with hash -122854270, now seen corresponding path program 1 times [2024-11-22 13:12:03,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:03,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383219312] [2024-11-22 13:12:03,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:03,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:03,421 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-22 13:12:03,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:03,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383219312] [2024-11-22 13:12:03,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383219312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:03,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:03,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:12:03,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224052451] [2024-11-22 13:12:03,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:03,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:12:03,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:03,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:12:03,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:12:03,424 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:03,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:03,455 INFO L93 Difference]: Finished difference Result 234 states and 341 transitions. [2024-11-22 13:12:03,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:12:03,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-11-22 13:12:03,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:03,457 INFO L225 Difference]: With dead ends: 234 [2024-11-22 13:12:03,457 INFO L226 Difference]: Without dead ends: 120 [2024-11-22 13:12:03,458 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:12:03,459 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:03,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 484 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:12:03,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-22 13:12:03,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-11-22 13:12:03,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 13:12:03,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2024-11-22 13:12:03,476 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 143 [2024-11-22 13:12:03,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:03,477 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2024-11-22 13:12:03,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:03,477 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2024-11-22 13:12:03,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-22 13:12:03,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:03,482 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:03,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 13:12:03,483 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:03,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:03,483 INFO L85 PathProgramCache]: Analyzing trace with hash 557204100, now seen corresponding path program 1 times [2024-11-22 13:12:03,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:03,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308149715] [2024-11-22 13:12:03,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:03,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:03,707 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-22 13:12:03,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:03,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308149715] [2024-11-22 13:12:03,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308149715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:03,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:03,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:12:03,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180885341] [2024-11-22 13:12:03,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:03,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:12:03,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:03,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:12:03,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:12:03,713 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:03,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:03,739 INFO L93 Difference]: Finished difference Result 238 states and 345 transitions. [2024-11-22 13:12:03,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:12:03,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-11-22 13:12:03,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:03,743 INFO L225 Difference]: With dead ends: 238 [2024-11-22 13:12:03,743 INFO L226 Difference]: Without dead ends: 122 [2024-11-22 13:12:03,743 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:12:03,745 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:03,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 485 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:12:03,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-22 13:12:03,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2024-11-22 13:12:03,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 102 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 13:12:03,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 174 transitions. [2024-11-22 13:12:03,757 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 174 transitions. Word has length 143 [2024-11-22 13:12:03,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:03,758 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 174 transitions. [2024-11-22 13:12:03,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:03,759 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 174 transitions. [2024-11-22 13:12:03,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-22 13:12:03,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:03,762 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:03,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 13:12:03,763 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:03,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:03,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1962755834, now seen corresponding path program 1 times [2024-11-22 13:12:03,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:03,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793473659] [2024-11-22 13:12:03,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:03,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:03,917 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-22 13:12:03,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:03,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793473659] [2024-11-22 13:12:03,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793473659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:03,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:03,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:12:03,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119686286] [2024-11-22 13:12:03,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:03,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:12:03,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:03,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:12:03,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:12:03,922 INFO L87 Difference]: Start difference. First operand 121 states and 174 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:03,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:03,942 INFO L93 Difference]: Finished difference Result 242 states and 349 transitions. [2024-11-22 13:12:03,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:12:03,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-11-22 13:12:03,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:03,944 INFO L225 Difference]: With dead ends: 242 [2024-11-22 13:12:03,945 INFO L226 Difference]: Without dead ends: 124 [2024-11-22 13:12:03,945 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:12:03,946 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:03,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:12:03,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-22 13:12:03,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2024-11-22 13:12:03,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 104 states have internal predecessors, (142), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 13:12:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 176 transitions. [2024-11-22 13:12:03,959 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 176 transitions. Word has length 143 [2024-11-22 13:12:03,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:03,959 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 176 transitions. [2024-11-22 13:12:03,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:03,960 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 176 transitions. [2024-11-22 13:12:03,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-22 13:12:03,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:03,961 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:03,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 13:12:03,961 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:03,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:03,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1960908792, now seen corresponding path program 1 times [2024-11-22 13:12:03,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:03,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807895829] [2024-11-22 13:12:03,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:03,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:04,715 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-22 13:12:04,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:04,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807895829] [2024-11-22 13:12:04,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807895829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:04,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:04,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:12:04,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495763910] [2024-11-22 13:12:04,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:04,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:12:04,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:04,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:12:04,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:12:04,720 INFO L87 Difference]: Start difference. First operand 123 states and 176 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:05,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:05,018 INFO L93 Difference]: Finished difference Result 259 states and 369 transitions. [2024-11-22 13:12:05,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:12:05,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-11-22 13:12:05,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:05,019 INFO L225 Difference]: With dead ends: 259 [2024-11-22 13:12:05,020 INFO L226 Difference]: Without dead ends: 139 [2024-11-22 13:12:05,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:12:05,021 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 88 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:05,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 440 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 13:12:05,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-22 13:12:05,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2024-11-22 13:12:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 114 states have (on average 1.3333333333333333) internal successors, (152), 115 states have internal predecessors, (152), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 13:12:05,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 194 transitions. [2024-11-22 13:12:05,033 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 194 transitions. Word has length 143 [2024-11-22 13:12:05,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:05,034 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 194 transitions. [2024-11-22 13:12:05,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:05,034 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 194 transitions. [2024-11-22 13:12:05,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-22 13:12:05,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:05,035 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:05,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 13:12:05,036 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:05,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:05,036 INFO L85 PathProgramCache]: Analyzing trace with hash -224934086, now seen corresponding path program 1 times [2024-11-22 13:12:05,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:05,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127390790] [2024-11-22 13:12:05,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:05,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:05,238 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-22 13:12:05,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:05,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127390790] [2024-11-22 13:12:05,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127390790] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:12:05,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18708346] [2024-11-22 13:12:05,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:05,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:12:05,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:12:05,241 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:12:05,243 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:12:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:05,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 13:12:05,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:12:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-22 13:12:05,501 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:12:05,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18708346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:05,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:12:05,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-22 13:12:05,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758582622] [2024-11-22 13:12:05,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:05,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:12:05,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:05,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:12:05,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:12:05,504 INFO L87 Difference]: Start difference. First operand 138 states and 194 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:05,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:05,551 INFO L93 Difference]: Finished difference Result 267 states and 376 transitions. [2024-11-22 13:12:05,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:12:05,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2024-11-22 13:12:05,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:05,554 INFO L225 Difference]: With dead ends: 267 [2024-11-22 13:12:05,558 INFO L226 Difference]: Without dead ends: 141 [2024-11-22 13:12:05,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:12:05,559 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:05,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 643 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:12:05,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-22 13:12:05,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-22 13:12:05,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 117 states have (on average 1.3247863247863247) internal successors, (155), 118 states have internal predecessors, (155), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 13:12:05,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 197 transitions. [2024-11-22 13:12:05,570 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 197 transitions. Word has length 145 [2024-11-22 13:12:05,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:05,570 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 197 transitions. [2024-11-22 13:12:05,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:05,571 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 197 transitions. [2024-11-22 13:12:05,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-22 13:12:05,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:05,572 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:05,588 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:12:05,776 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,SelfDestructingSolverStorable6 [2024-11-22 13:12:05,777 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:05,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:05,777 INFO L85 PathProgramCache]: Analyzing trace with hash 885375514, now seen corresponding path program 1 times [2024-11-22 13:12:05,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:05,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187468660] [2024-11-22 13:12:05,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:05,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:06,438 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-22 13:12:06,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:06,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187468660] [2024-11-22 13:12:06,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187468660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:06,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:06,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:12:06,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712384341] [2024-11-22 13:12:06,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:06,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:12:06,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:06,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:12:06,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:12:06,441 INFO L87 Difference]: Start difference. First operand 141 states and 197 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:06,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:06,705 INFO L93 Difference]: Finished difference Result 271 states and 379 transitions. [2024-11-22 13:12:06,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:12:06,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-11-22 13:12:06,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:06,707 INFO L225 Difference]: With dead ends: 271 [2024-11-22 13:12:06,707 INFO L226 Difference]: Without dead ends: 142 [2024-11-22 13:12:06,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:12:06,708 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 83 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:06,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 563 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 13:12:06,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-22 13:12:06,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2024-11-22 13:12:06,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 115 states have (on average 1.3217391304347825) internal successors, (152), 116 states have internal predecessors, (152), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 13:12:06,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 194 transitions. [2024-11-22 13:12:06,713 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 194 transitions. Word has length 146 [2024-11-22 13:12:06,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:06,713 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 194 transitions. [2024-11-22 13:12:06,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:06,713 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 194 transitions. [2024-11-22 13:12:06,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-22 13:12:06,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:06,714 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:06,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 13:12:06,715 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:06,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:06,715 INFO L85 PathProgramCache]: Analyzing trace with hash 945808159, now seen corresponding path program 1 times [2024-11-22 13:12:06,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:06,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376835387] [2024-11-22 13:12:06,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:06,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:07,322 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-22 13:12:07,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:07,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376835387] [2024-11-22 13:12:07,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376835387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:07,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:07,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:12:07,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640085949] [2024-11-22 13:12:07,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:07,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:12:07,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:07,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:12:07,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:12:07,325 INFO L87 Difference]: Start difference. First operand 139 states and 194 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:07,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:07,611 INFO L93 Difference]: Finished difference Result 381 states and 535 transitions. [2024-11-22 13:12:07,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:12:07,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 147 [2024-11-22 13:12:07,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:07,613 INFO L225 Difference]: With dead ends: 381 [2024-11-22 13:12:07,613 INFO L226 Difference]: Without dead ends: 254 [2024-11-22 13:12:07,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:12:07,614 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 146 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:07,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 364 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 13:12:07,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-22 13:12:07,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 204. [2024-11-22 13:12:07,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 166 states have (on average 1.3132530120481927) internal successors, (218), 166 states have internal predecessors, (218), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-22 13:12:07,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 286 transitions. [2024-11-22 13:12:07,627 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 286 transitions. Word has length 147 [2024-11-22 13:12:07,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:07,627 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 286 transitions. [2024-11-22 13:12:07,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:07,628 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 286 transitions. [2024-11-22 13:12:07,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-22 13:12:07,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:07,629 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:07,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 13:12:07,630 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:07,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:07,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1270086649, now seen corresponding path program 1 times [2024-11-22 13:12:07,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:07,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343435379] [2024-11-22 13:12:07,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:07,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:07,900 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-22 13:12:07,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:07,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343435379] [2024-11-22 13:12:07,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343435379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:07,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:07,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:12:07,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602909277] [2024-11-22 13:12:07,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:07,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:12:07,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:07,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:12:07,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:12:07,902 INFO L87 Difference]: Start difference. First operand 204 states and 286 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:08,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:08,039 INFO L93 Difference]: Finished difference Result 371 states and 516 transitions. [2024-11-22 13:12:08,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:12:08,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-11-22 13:12:08,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:08,043 INFO L225 Difference]: With dead ends: 371 [2024-11-22 13:12:08,043 INFO L226 Difference]: Without dead ends: 244 [2024-11-22 13:12:08,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:12:08,044 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 86 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:08,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 418 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:12:08,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-22 13:12:08,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 208. [2024-11-22 13:12:08,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 170 states have (on average 1.311764705882353) internal successors, (223), 170 states have internal predecessors, (223), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-22 13:12:08,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 291 transitions. [2024-11-22 13:12:08,054 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 291 transitions. Word has length 151 [2024-11-22 13:12:08,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:08,055 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 291 transitions. [2024-11-22 13:12:08,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:08,055 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 291 transitions. [2024-11-22 13:12:08,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-22 13:12:08,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:08,056 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:08,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 13:12:08,056 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:08,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:08,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1488941367, now seen corresponding path program 1 times [2024-11-22 13:12:08,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:08,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810556109] [2024-11-22 13:12:08,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:08,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:08,473 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-22 13:12:08,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:08,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810556109] [2024-11-22 13:12:08,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810556109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:08,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:08,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:12:08,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98875544] [2024-11-22 13:12:08,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:08,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:12:08,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:08,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:12:08,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:12:08,475 INFO L87 Difference]: Start difference. First operand 208 states and 291 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:08,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:08,797 INFO L93 Difference]: Finished difference Result 392 states and 544 transitions. [2024-11-22 13:12:08,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:12:08,798 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-11-22 13:12:08,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:08,799 INFO L225 Difference]: With dead ends: 392 [2024-11-22 13:12:08,799 INFO L226 Difference]: Without dead ends: 261 [2024-11-22 13:12:08,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:12:08,800 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 129 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:08,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 599 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 13:12:08,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-22 13:12:08,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 211. [2024-11-22 13:12:08,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 173 states have (on average 1.30635838150289) internal successors, (226), 173 states have internal predecessors, (226), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-22 13:12:08,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 294 transitions. [2024-11-22 13:12:08,809 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 294 transitions. Word has length 151 [2024-11-22 13:12:08,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:08,810 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 294 transitions. [2024-11-22 13:12:08,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:08,810 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 294 transitions. [2024-11-22 13:12:08,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-22 13:12:08,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:08,811 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:08,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 13:12:08,811 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:08,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:08,812 INFO L85 PathProgramCache]: Analyzing trace with hash 422808358, now seen corresponding path program 1 times [2024-11-22 13:12:08,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:08,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808767345] [2024-11-22 13:12:08,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:08,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:10,464 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-22 13:12:10,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:10,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808767345] [2024-11-22 13:12:10,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808767345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:10,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:10,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:12:10,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650341786] [2024-11-22 13:12:10,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:10,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 13:12:10,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:10,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 13:12:10,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:12:10,466 INFO L87 Difference]: Start difference. First operand 211 states and 294 transitions. Second operand has 8 states, 6 states have (on average 11.666666666666666) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-22 13:12:10,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:10,990 INFO L93 Difference]: Finished difference Result 433 states and 595 transitions. [2024-11-22 13:12:10,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 13:12:10,991 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.666666666666666) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 152 [2024-11-22 13:12:10,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:10,992 INFO L225 Difference]: With dead ends: 433 [2024-11-22 13:12:10,992 INFO L226 Difference]: Without dead ends: 302 [2024-11-22 13:12:10,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-22 13:12:10,993 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 75 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:10,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 876 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 13:12:10,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-22 13:12:11,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 299. [2024-11-22 13:12:11,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 251 states have (on average 1.294820717131474) internal successors, (325), 252 states have internal predecessors, (325), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-22 13:12:11,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 409 transitions. [2024-11-22 13:12:11,017 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 409 transitions. Word has length 152 [2024-11-22 13:12:11,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:11,017 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 409 transitions. [2024-11-22 13:12:11,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.666666666666666) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-22 13:12:11,017 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 409 transitions. [2024-11-22 13:12:11,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-22 13:12:11,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:11,022 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:11,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 13:12:11,022 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:11,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:11,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1686606453, now seen corresponding path program 1 times [2024-11-22 13:12:11,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:11,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079030854] [2024-11-22 13:12:11,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:11,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:11,094 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-22 13:12:11,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:11,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079030854] [2024-11-22 13:12:11,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079030854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:11,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:11,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 13:12:11,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020630234] [2024-11-22 13:12:11,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:11,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 13:12:11,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:11,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 13:12:11,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 13:12:11,096 INFO L87 Difference]: Start difference. First operand 299 states and 409 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:11,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:11,112 INFO L93 Difference]: Finished difference Result 514 states and 705 transitions. [2024-11-22 13:12:11,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 13:12:11,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2024-11-22 13:12:11,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:11,114 INFO L225 Difference]: With dead ends: 514 [2024-11-22 13:12:11,114 INFO L226 Difference]: Without dead ends: 301 [2024-11-22 13:12:11,114 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:12:11,115 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:11,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 324 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:12:11,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-22 13:12:11,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2024-11-22 13:12:11,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 253 states have (on average 1.2924901185770752) internal successors, (327), 254 states have internal predecessors, (327), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-22 13:12:11,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 411 transitions. [2024-11-22 13:12:11,126 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 411 transitions. Word has length 154 [2024-11-22 13:12:11,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:11,127 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 411 transitions. [2024-11-22 13:12:11,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:11,127 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 411 transitions. [2024-11-22 13:12:11,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-22 13:12:11,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:11,128 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:11,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 13:12:11,128 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:11,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:11,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1541026190, now seen corresponding path program 1 times [2024-11-22 13:12:11,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:11,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806470764] [2024-11-22 13:12:11,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:11,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-22 13:12:11,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:11,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806470764] [2024-11-22 13:12:11,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806470764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:11,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:11,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 13:12:11,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353121093] [2024-11-22 13:12:11,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:11,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 13:12:11,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:11,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 13:12:11,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:12:11,942 INFO L87 Difference]: Start difference. First operand 301 states and 411 transitions. Second operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 13:12:12,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:12,361 INFO L93 Difference]: Finished difference Result 313 states and 423 transitions. [2024-11-22 13:12:12,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:12:12,362 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 154 [2024-11-22 13:12:12,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:12,363 INFO L225 Difference]: With dead ends: 313 [2024-11-22 13:12:12,364 INFO L226 Difference]: Without dead ends: 311 [2024-11-22 13:12:12,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-22 13:12:12,364 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 96 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:12,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 810 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 13:12:12,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-22 13:12:12,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2024-11-22 13:12:12,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 262 states have (on average 1.282442748091603) internal successors, (336), 263 states have internal predecessors, (336), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-22 13:12:12,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 420 transitions. [2024-11-22 13:12:12,377 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 420 transitions. Word has length 154 [2024-11-22 13:12:12,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:12,377 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 420 transitions. [2024-11-22 13:12:12,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 13:12:12,378 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 420 transitions. [2024-11-22 13:12:12,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-22 13:12:12,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:12,379 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:12,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 13:12:12,379 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:12,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:12,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1539179148, now seen corresponding path program 1 times [2024-11-22 13:12:12,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:12,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26786311] [2024-11-22 13:12:12,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:12,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:13,737 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-22 13:12:13,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:13,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26786311] [2024-11-22 13:12:13,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26786311] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:12:13,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641299375] [2024-11-22 13:12:13,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:13,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:12:13,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:12:13,739 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:12:13,741 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:12:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:14,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-22 13:12:14,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:12:14,129 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 55 treesize of output 54 [2024-11-22 13:12:14,214 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 82 treesize of output 71 [2024-11-22 13:12:14,343 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 86 treesize of output 73 [2024-11-22 13:12:14,468 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 90 treesize of output 75 [2024-11-22 13:12:14,606 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 94 treesize of output 77 [2024-11-22 13:12:14,750 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 98 treesize of output 79 [2024-11-22 13:12:14,892 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 102 treesize of output 81 [2024-11-22 13:12:15,237 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 115 treesize of output 90 [2024-11-22 13:12:15,468 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 121 treesize of output 94 [2024-11-22 13:12:15,647 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 121 treesize of output 94 [2024-11-22 13:12:15,922 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 125 treesize of output 96 [2024-11-22 13:12:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 3 proven. 504 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-22 13:12:16,139 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:12:16,473 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-22 13:12:16,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641299375] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 13:12:16,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 13:12:16,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 9] total 31 [2024-11-22 13:12:16,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065500794] [2024-11-22 13:12:16,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 13:12:16,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-22 13:12:16,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:16,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-22 13:12:16,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2024-11-22 13:12:16,476 INFO L87 Difference]: Start difference. First operand 311 states and 420 transitions. Second operand has 31 states, 27 states have (on average 6.555555555555555) internal successors, (177), 30 states have internal predecessors, (177), 17 states have call successors, (51), 9 states have call predecessors, (51), 12 states have return successors, (51), 14 states have call predecessors, (51), 17 states have call successors, (51) [2024-11-22 13:12:20,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:20,040 INFO L93 Difference]: Finished difference Result 857 states and 1124 transitions. [2024-11-22 13:12:20,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-11-22 13:12:20,043 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 6.555555555555555) internal successors, (177), 30 states have internal predecessors, (177), 17 states have call successors, (51), 9 states have call predecessors, (51), 12 states have return successors, (51), 14 states have call predecessors, (51), 17 states have call successors, (51) Word has length 154 [2024-11-22 13:12:20,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:20,046 INFO L225 Difference]: With dead ends: 857 [2024-11-22 13:12:20,046 INFO L226 Difference]: Without dead ends: 613 [2024-11-22 13:12:20,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 295 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=963, Invalid=3069, Unknown=0, NotChecked=0, Total=4032 [2024-11-22 13:12:20,052 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 440 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 1617 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:20,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1214 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1617 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-22 13:12:20,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-22 13:12:20,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 587. [2024-11-22 13:12:20,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 500 states have (on average 1.272) internal successors, (636), 502 states have internal predecessors, (636), 67 states have call successors, (67), 19 states have call predecessors, (67), 19 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-22 13:12:20,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 770 transitions. [2024-11-22 13:12:20,077 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 770 transitions. Word has length 154 [2024-11-22 13:12:20,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:20,077 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 770 transitions. [2024-11-22 13:12:20,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 6.555555555555555) internal successors, (177), 30 states have internal predecessors, (177), 17 states have call successors, (51), 9 states have call predecessors, (51), 12 states have return successors, (51), 14 states have call predecessors, (51), 17 states have call successors, (51) [2024-11-22 13:12:20,078 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 770 transitions. [2024-11-22 13:12:20,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-22 13:12:20,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:20,080 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:20,096 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:12:20,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:12:20,281 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:20,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:20,282 INFO L85 PathProgramCache]: Analyzing trace with hash -2018937927, now seen corresponding path program 1 times [2024-11-22 13:12:20,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:20,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355974908] [2024-11-22 13:12:20,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:20,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:21,130 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-22 13:12:21,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:21,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355974908] [2024-11-22 13:12:21,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355974908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:21,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:21,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:12:21,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463949607] [2024-11-22 13:12:21,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:21,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:12:21,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:21,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:12:21,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:12:21,132 INFO L87 Difference]: Start difference. First operand 587 states and 770 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 13:12:21,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:21,388 INFO L93 Difference]: Finished difference Result 1139 states and 1512 transitions. [2024-11-22 13:12:21,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:12:21,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 156 [2024-11-22 13:12:21,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:21,394 INFO L225 Difference]: With dead ends: 1139 [2024-11-22 13:12:21,394 INFO L226 Difference]: Without dead ends: 889 [2024-11-22 13:12:21,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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:12:21,396 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 160 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:21,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 412 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 13:12:21,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2024-11-22 13:12:21,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 596. [2024-11-22 13:12:21,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 509 states have (on average 1.2730844793713163) internal successors, (648), 511 states have internal predecessors, (648), 67 states have call successors, (67), 19 states have call predecessors, (67), 19 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-22 13:12:21,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 782 transitions. [2024-11-22 13:12:21,422 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 782 transitions. Word has length 156 [2024-11-22 13:12:21,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:21,422 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 782 transitions. [2024-11-22 13:12:21,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 13:12:21,423 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 782 transitions. [2024-11-22 13:12:21,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-22 13:12:21,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:21,424 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:21,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 13:12:21,424 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:21,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:21,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1386278343, now seen corresponding path program 1 times [2024-11-22 13:12:21,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:21,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551517124] [2024-11-22 13:12:21,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:21,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:23,068 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-22 13:12:23,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:23,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551517124] [2024-11-22 13:12:23,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551517124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:23,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:23,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 13:12:23,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263770573] [2024-11-22 13:12:23,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:23,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 13:12:23,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:23,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 13:12:23,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:12:23,070 INFO L87 Difference]: Start difference. First operand 596 states and 782 transitions. Second operand has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 13:12:23,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:23,627 INFO L93 Difference]: Finished difference Result 1060 states and 1401 transitions. [2024-11-22 13:12:23,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:12:23,628 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 156 [2024-11-22 13:12:23,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:23,632 INFO L225 Difference]: With dead ends: 1060 [2024-11-22 13:12:23,632 INFO L226 Difference]: Without dead ends: 604 [2024-11-22 13:12:23,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-22 13:12:23,637 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 162 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:23,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 475 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 13:12:23,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-11-22 13:12:23,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 600. [2024-11-22 13:12:23,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 512 states have (on average 1.267578125) internal successors, (649), 514 states have internal predecessors, (649), 67 states have call successors, (67), 20 states have call predecessors, (67), 20 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-22 13:12:23,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 783 transitions. [2024-11-22 13:12:23,658 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 783 transitions. Word has length 156 [2024-11-22 13:12:23,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:23,659 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 783 transitions. [2024-11-22 13:12:23,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 13:12:23,659 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 783 transitions. [2024-11-22 13:12:23,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-22 13:12:23,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:23,660 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:23,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 13:12:23,660 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:23,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:23,661 INFO L85 PathProgramCache]: Analyzing trace with hash -258180644, now seen corresponding path program 1 times [2024-11-22 13:12:23,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:23,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656617904] [2024-11-22 13:12:23,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:23,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:24,648 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-22 13:12:24,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:24,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656617904] [2024-11-22 13:12:24,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656617904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:24,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:24,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:12:24,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198237706] [2024-11-22 13:12:24,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:24,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:12:24,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:24,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:12:24,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:12:24,650 INFO L87 Difference]: Start difference. First operand 600 states and 783 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 13:12:24,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:24,925 INFO L93 Difference]: Finished difference Result 1341 states and 1766 transitions. [2024-11-22 13:12:24,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:12:24,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 156 [2024-11-22 13:12:24,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:24,929 INFO L225 Difference]: With dead ends: 1341 [2024-11-22 13:12:24,929 INFO L226 Difference]: Without dead ends: 881 [2024-11-22 13:12:24,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 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:12:24,930 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 63 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:24,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 533 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 13:12:24,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-11-22 13:12:24,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 673. [2024-11-22 13:12:24,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 585 states have (on average 1.2752136752136751) internal successors, (746), 587 states have internal predecessors, (746), 67 states have call successors, (67), 20 states have call predecessors, (67), 20 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-22 13:12:24,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 880 transitions. [2024-11-22 13:12:24,954 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 880 transitions. Word has length 156 [2024-11-22 13:12:24,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:24,954 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 880 transitions. [2024-11-22 13:12:24,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 13:12:24,955 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 880 transitions. [2024-11-22 13:12:24,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-22 13:12:24,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:24,956 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:24,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 13:12:24,956 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:24,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:24,956 INFO L85 PathProgramCache]: Analyzing trace with hash 189485414, now seen corresponding path program 1 times [2024-11-22 13:12:24,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:24,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651450789] [2024-11-22 13:12:24,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:24,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:25,012 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-22 13:12:25,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:25,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651450789] [2024-11-22 13:12:25,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651450789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:25,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:25,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 13:12:25,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692941504] [2024-11-22 13:12:25,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:25,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 13:12:25,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:25,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 13:12:25,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 13:12:25,015 INFO L87 Difference]: Start difference. First operand 673 states and 880 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:25,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:25,042 INFO L93 Difference]: Finished difference Result 1214 states and 1603 transitions. [2024-11-22 13:12:25,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 13:12:25,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 156 [2024-11-22 13:12:25,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:25,045 INFO L225 Difference]: With dead ends: 1214 [2024-11-22 13:12:25,045 INFO L226 Difference]: Without dead ends: 680 [2024-11-22 13:12:25,046 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:12:25,046 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:25,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 325 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:12:25,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-11-22 13:12:25,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 680. [2024-11-22 13:12:25,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 592 states have (on average 1.2719594594594594) internal successors, (753), 594 states have internal predecessors, (753), 67 states have call successors, (67), 20 states have call predecessors, (67), 20 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-22 13:12:25,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 887 transitions. [2024-11-22 13:12:25,071 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 887 transitions. Word has length 156 [2024-11-22 13:12:25,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:25,071 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 887 transitions. [2024-11-22 13:12:25,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:25,071 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 887 transitions. [2024-11-22 13:12:25,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-22 13:12:25,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:25,074 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:25,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 13:12:25,074 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:25,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:25,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1595291205, now seen corresponding path program 1 times [2024-11-22 13:12:25,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:25,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784621547] [2024-11-22 13:12:25,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:25,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:25,446 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-22 13:12:25,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:25,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784621547] [2024-11-22 13:12:25,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784621547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:25,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:25,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:12:25,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504909555] [2024-11-22 13:12:25,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:25,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:12:25,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:25,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:12:25,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:12:25,448 INFO L87 Difference]: Start difference. First operand 680 states and 887 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:25,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:25,839 INFO L93 Difference]: Finished difference Result 1466 states and 1925 transitions. [2024-11-22 13:12:25,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:12:25,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 156 [2024-11-22 13:12:25,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:25,843 INFO L225 Difference]: With dead ends: 1466 [2024-11-22 13:12:25,845 INFO L226 Difference]: Without dead ends: 897 [2024-11-22 13:12:25,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:12:25,846 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 139 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:25,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 533 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 13:12:25,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2024-11-22 13:12:25,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 679. [2024-11-22 13:12:25,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 591 states have (on average 1.2690355329949239) internal successors, (750), 593 states have internal predecessors, (750), 67 states have call successors, (67), 20 states have call predecessors, (67), 20 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-22 13:12:25,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 884 transitions. [2024-11-22 13:12:25,885 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 884 transitions. Word has length 156 [2024-11-22 13:12:25,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:25,885 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 884 transitions. [2024-11-22 13:12:25,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:25,886 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 884 transitions. [2024-11-22 13:12:25,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-22 13:12:25,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:25,887 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:25,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-22 13:12:25,887 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:25,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:25,887 INFO L85 PathProgramCache]: Analyzing trace with hash -625743125, now seen corresponding path program 1 times [2024-11-22 13:12:25,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:25,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786484886] [2024-11-22 13:12:25,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:25,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:26,760 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-22 13:12:26,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:26,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786484886] [2024-11-22 13:12:26,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786484886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:26,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:26,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:12:26,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601696067] [2024-11-22 13:12:26,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:26,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:12:26,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:26,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:12:26,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:12:26,762 INFO L87 Difference]: Start difference. First operand 679 states and 884 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:27,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:27,195 INFO L93 Difference]: Finished difference Result 1483 states and 1942 transitions. [2024-11-22 13:12:27,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:12:27,196 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 158 [2024-11-22 13:12:27,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:27,200 INFO L225 Difference]: With dead ends: 1483 [2024-11-22 13:12:27,200 INFO L226 Difference]: Without dead ends: 969 [2024-11-22 13:12:27,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:12:27,202 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 185 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:27,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 570 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 13:12:27,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2024-11-22 13:12:27,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 904. [2024-11-22 13:12:27,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 785 states have (on average 1.2535031847133757) internal successors, (984), 789 states have internal predecessors, (984), 92 states have call successors, (92), 26 states have call predecessors, (92), 26 states have return successors, (92), 88 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-22 13:12:27,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1168 transitions. [2024-11-22 13:12:27,239 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1168 transitions. Word has length 158 [2024-11-22 13:12:27,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:27,239 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1168 transitions. [2024-11-22 13:12:27,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:27,240 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1168 transitions. [2024-11-22 13:12:27,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-22 13:12:27,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:27,241 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:27,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-22 13:12:27,241 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:27,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:27,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1578950146, now seen corresponding path program 1 times [2024-11-22 13:12:27,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:27,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937328972] [2024-11-22 13:12:27,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:27,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 13:12:27,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 13:12:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 13:12:27,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 13:12:27,434 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 13:12:27,435 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 13:12:27,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-22 13:12:27,438 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:12:27,501 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 13:12:27,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:12:27 BoogieIcfgContainer [2024-11-22 13:12:27,503 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 13:12:27,504 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 13:12:27,504 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 13:12:27,504 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 13:12:27,504 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:12:01" (3/4) ... [2024-11-22 13:12:27,506 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 13:12:27,507 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 13:12:27,507 INFO L158 Benchmark]: Toolchain (without parser) took 27066.73ms. Allocated memory was 178.3MB in the beginning and 1.0GB in the end (delta: 857.7MB). Free memory was 112.2MB in the beginning and 424.1MB in the end (delta: -311.9MB). Peak memory consumption was 547.3MB. Max. memory is 16.1GB. [2024-11-22 13:12:27,507 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory is still 74.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 13:12:27,507 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.41ms. Allocated memory is still 178.3MB. Free memory was 112.0MB in the beginning and 144.7MB in the end (delta: -32.7MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-11-22 13:12:27,507 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.33ms. Allocated memory is still 178.3MB. Free memory was 144.7MB in the beginning and 141.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 13:12:27,508 INFO L158 Benchmark]: Boogie Preprocessor took 57.35ms. Allocated memory is still 178.3MB. Free memory was 141.2MB in the beginning and 137.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 13:12:27,508 INFO L158 Benchmark]: RCFGBuilder took 886.45ms. Allocated memory is still 178.3MB. Free memory was 137.0MB in the beginning and 101.3MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-22 13:12:27,508 INFO L158 Benchmark]: TraceAbstraction took 25720.74ms. Allocated memory was 178.3MB in the beginning and 1.0GB in the end (delta: 857.7MB). Free memory was 100.0MB in the beginning and 424.1MB in the end (delta: -324.1MB). Peak memory consumption was 534.4MB. Max. memory is 16.1GB. [2024-11-22 13:12:27,508 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 1.0GB. Free memory is still 424.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 13:12:27,509 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 113.2MB. Free memory is still 74.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.41ms. Allocated memory is still 178.3MB. Free memory was 112.0MB in the beginning and 144.7MB in the end (delta: -32.7MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.33ms. Allocated memory is still 178.3MB. Free memory was 144.7MB in the beginning and 141.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.35ms. Allocated memory is still 178.3MB. Free memory was 141.2MB in the beginning and 137.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 886.45ms. Allocated memory is still 178.3MB. Free memory was 137.0MB in the beginning and 101.3MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 25720.74ms. Allocated memory was 178.3MB in the beginning and 1.0GB in the end (delta: 857.7MB). Free memory was 100.0MB in the beginning and 424.1MB in the end (delta: -324.1MB). Peak memory consumption was 534.4MB. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 1.0GB. Free memory is still 424.1MB. 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 124, overapproximation of bitwiseOr at line 124. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { -8, 0, 1, -1, -50, 100, 25, 2568920345, 1191097264, 1801344522, 64, -16, 1000000.5, 4.5, 0, 128 }; [L59] unsigned long int last_1_WrapperStruct00_var_1_10 = 25; [L60] signed short int last_1_WrapperStruct00_var_1_15 = -16; [L61] unsigned char last_1_WrapperStruct00_var_1_18 = 0; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L128] isInitial = 1 [L129] FCALL initially() [L130] COND TRUE 1 [L131] CALL updateLastVariables() [L119] EXPR WrapperStruct00.var_1_10 [L119] last_1_WrapperStruct00_var_1_10 = WrapperStruct00.var_1_10 [L120] EXPR WrapperStruct00.var_1_15 [L120] last_1_WrapperStruct00_var_1_15 = WrapperStruct00.var_1_15 [L121] EXPR WrapperStruct00.var_1_18 [L121] last_1_WrapperStruct00_var_1_18 = WrapperStruct00.var_1_18 [L131] RET updateLastVariables() [L132] CALL updateVariables() [L91] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L93] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L94] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L95] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L96] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L97] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L98] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L99] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L100] WrapperStruct00.var_1_9 = __VERIFIER_nondet_char() [L101] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L102] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L103] WrapperStruct00.var_1_11 = __VERIFIER_nondet_ulong() [L104] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L105] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L106] WrapperStruct00.var_1_12 = __VERIFIER_nondet_ulong() [L107] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L108] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L109] WrapperStruct00.var_1_13 = __VERIFIER_nondet_ulong() [L110] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L111] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L112] WrapperStruct00.var_1_17 = __VERIFIER_nondet_float() [L113] EXPR WrapperStruct00.var_1_17 [L113] EXPR WrapperStruct00.var_1_17 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_17 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_17 [L113] EXPR WrapperStruct00.var_1_17 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_17 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L113] EXPR (WrapperStruct00.var_1_17 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_17 <= -1.0e-20F) || (WrapperStruct00.var_1_17 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_17 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_17 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_17 <= -1.0e-20F) || (WrapperStruct00.var_1_17 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_17 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_17 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_17 <= -1.0e-20F) || (WrapperStruct00.var_1_17 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_17 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L114] WrapperStruct00.var_1_19 = __VERIFIER_nondet_uchar() [L115] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L116] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L132] RET updateVariables() [L133] CALL step() [L65] EXPR last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L65] ((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5 [L65] EXPR WrapperStruct00.var_1_5 [L65] ((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L65] COND FALSE !(((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) [L72] EXPR WrapperStruct00.var_1_7 [L72] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_7 [L74] WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L74] COND FALSE !(WrapperStruct00.var_1_5) [L77] EXPR WrapperStruct00.var_1_12 [L77] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L77] COND TRUE WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8 [L78] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L78] EXPR ((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8) [L78] EXPR WrapperStruct00.var_1_8 [L78] EXPR ((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L78] WrapperStruct00.var_1_14 = ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) [L80] WrapperStruct00.var_1_15 = 2 [L81] EXPR WrapperStruct00.var_1_17 [L81] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_17 [L82] EXPR WrapperStruct00.var_1_19 [L82] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_19 [L83] EXPR WrapperStruct00.var_1_8 [L83] EXPR WrapperStruct00.var_1_1 [L83] unsigned char stepLocal_0 = WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1; [L84] stepLocal_0 && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L84] COND FALSE !(stepLocal_0 && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) [L87] EXPR WrapperStruct00.var_1_11 [L87] EXPR WrapperStruct00.var_1_13 [L87] WrapperStruct00.var_1_10 = (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13) [L133] RET step() [L134] CALL, EXPR property() [L124] EXPR last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5 [L124] EXPR WrapperStruct00.var_1_5 [L124] EXPR ((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) [L124] EXPR WrapperStruct00.var_1_1 [L124] EXPR WrapperStruct00.var_1_7 [L124] EXPR (((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1) [L124] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13)))) [L124] EXPR WrapperStruct00.var_1_8 [L124] EXPR WrapperStruct00.var_1_1 [L124] EXPR (WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))) [L124] EXPR WrapperStruct00.var_1_10 [L124] EXPR WrapperStruct00.var_1_11 [L124] EXPR WrapperStruct00.var_1_13 [L124] EXPR ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1) [L124] EXPR WrapperStruct00.var_1_12 [L124] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1 [L124] EXPR WrapperStruct00.var_1_14 [L124] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8) [L124] EXPR WrapperStruct00.var_1_8 [L124] EXPR ((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1)) && (WrapperStruct00.var_1_15 == ((signed short int) 2)) [L124] EXPR WrapperStruct00.var_1_15 [L124] EXPR (((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1)) && (WrapperStruct00.var_1_15 == ((signed short int) 2)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1)) && (WrapperStruct00.var_1_15 == ((signed short int) 2))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_17)) [L124] EXPR WrapperStruct00.var_1_16 [L124] EXPR WrapperStruct00.var_1_17 [L124] EXPR ((((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1)) && (WrapperStruct00.var_1_15 == ((signed short int) 2))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_17)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (((((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1)) && (WrapperStruct00.var_1_15 == ((signed short int) 2))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_17))) && (WrapperStruct00.var_1_18 == ((unsigned char) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124-L125] return (((((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1)) && (WrapperStruct00.var_1_15 == ((signed short int) 2))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_17))) && (WrapperStruct00.var_1_18 == ((unsigned char) WrapperStruct00.var_1_19)) ; [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.6s, OverallIterations: 22, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1863 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1855 mSDsluCounter, 11210 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8068 mSDsCounter, 494 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5271 IncrementalHoareTripleChecker+Invalid, 5765 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 494 mSolverCounterUnsat, 3142 mSDtfsCounter, 5271 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 854 GetRequests, 701 SyntacticMatches, 2 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=21, InterpolantAutomatonStates: 156, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 960 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 3750 NumberOfCodeBlocks, 3750 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3721 ConstructedInterpolants, 0 QuantifiedInterpolants, 20471 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1603 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 25 InterpolantComputations, 20 PerfectInterpolantSequences, 12986/13600 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:12:27,531 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-88.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 4ed30b990283645eacfcf3ec95d058dabc11775aacfdc34a24bd9c1336ca33bd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 13:12:29,478 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 13:12:29,549 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 13:12:29,553 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 13:12:29,554 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 13:12:29,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 13:12:29,582 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 13:12:29,583 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 13:12:29,583 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 13:12:29,583 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 13:12:29,584 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 13:12:29,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 13:12:29,585 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 13:12:29,588 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 13:12:29,588 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 13:12:29,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 13:12:29,588 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 13:12:29,589 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 13:12:29,589 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 13:12:29,589 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 13:12:29,589 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 13:12:29,590 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 13:12:29,591 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 13:12:29,591 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 13:12:29,591 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 13:12:29,591 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 13:12:29,592 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 13:12:29,592 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 13:12:29,592 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 13:12:29,592 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 13:12:29,592 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 13:12:29,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 13:12:29,593 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 13:12:29,593 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 13:12:29,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:12:29,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 13:12:29,594 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 13:12:29,595 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 13:12:29,595 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 13:12:29,595 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 13:12:29,595 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 13:12:29,595 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 13:12:29,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 13:12:29,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 13:12:29,596 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 -> 4ed30b990283645eacfcf3ec95d058dabc11775aacfdc34a24bd9c1336ca33bd [2024-11-22 13:12:29,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 13:12:29,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 13:12:29,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 13:12:29,879 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 13:12:29,879 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 13:12:29,881 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-88.i [2024-11-22 13:12:31,221 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 13:12:31,459 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 13:12:31,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i [2024-11-22 13:12:31,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f4ef67b5/9b588f06c15f4c138fa5ee213e363d8b/FLAG8882a8449 [2024-11-22 13:12:31,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f4ef67b5/9b588f06c15f4c138fa5ee213e363d8b [2024-11-22 13:12:31,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 13:12:31,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 13:12:31,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 13:12:31,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 13:12:31,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 13:12:31,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:12:31" (1/1) ... [2024-11-22 13:12:31,491 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d1ec7fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:31, skipping insertion in model container [2024-11-22 13:12:31,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:12:31" (1/1) ... [2024-11-22 13:12:31,515 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 13:12:31,658 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-88.i[916,929] [2024-11-22 13:12:31,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:12:31,730 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 13:12:31,740 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-88.i[916,929] [2024-11-22 13:12:31,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:12:31,805 INFO L204 MainTranslator]: Completed translation [2024-11-22 13:12:31,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:31 WrapperNode [2024-11-22 13:12:31,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 13:12:31,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 13:12:31,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 13:12:31,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 13:12:31,824 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:12:31" (1/1) ... [2024-11-22 13:12:31,845 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:12:31" (1/1) ... [2024-11-22 13:12:31,890 INFO L138 Inliner]: procedures = 37, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 500 [2024-11-22 13:12:31,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 13:12:31,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 13:12:31,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 13:12:31,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 13:12:31,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:31" (1/1) ... [2024-11-22 13:12:31,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:31" (1/1) ... [2024-11-22 13:12:31,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:31" (1/1) ... [2024-11-22 13:12:31,955 INFO L175 MemorySlicer]: Split 135 memory accesses to 2 slices as follows [2, 133]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 36 writes are split as follows [0, 36]. [2024-11-22 13:12:31,958 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:31" (1/1) ... [2024-11-22 13:12:31,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:31" (1/1) ... [2024-11-22 13:12:31,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:12:31" (1/1) ... [2024-11-22 13:12:31,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:31" (1/1) ... [2024-11-22 13:12:31,994 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:31" (1/1) ... [2024-11-22 13:12:31,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:12:31" (1/1) ... [2024-11-22 13:12:32,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 13:12:32,008 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 13:12:32,008 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 13:12:32,010 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 13:12:32,011 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:31" (1/1) ... [2024-11-22 13:12:32,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:12:32,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:12:32,042 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:12:32,047 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:12:32,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 13:12:32,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 13:12:32,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 13:12:32,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 13:12:32,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 13:12:32,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-22 13:12:32,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-22 13:12:32,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 13:12:32,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 13:12:32,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-22 13:12:32,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-22 13:12:32,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-22 13:12:32,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-22 13:12:32,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-22 13:12:32,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-22 13:12:32,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-22 13:12:32,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-22 13:12:32,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-22 13:12:32,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-22 13:12:32,083 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 13:12:32,083 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 13:12:32,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-22 13:12:32,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-22 13:12:32,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 13:12:32,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 13:12:32,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-22 13:12:32,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-22 13:12:32,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-22 13:12:32,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-22 13:12:32,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 13:12:32,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 13:12:32,180 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 13:12:32,182 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 13:12:32,722 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-22 13:12:32,722 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 13:12:32,737 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 13:12:32,738 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 13:12:32,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:12:32 BoogieIcfgContainer [2024-11-22 13:12:32,739 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 13:12:32,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 13:12:32,741 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 13:12:32,744 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 13:12:32,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:12:31" (1/3) ... [2024-11-22 13:12:32,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d2f3093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:12:32, skipping insertion in model container [2024-11-22 13:12:32,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:31" (2/3) ... [2024-11-22 13:12:32,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d2f3093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:12:32, skipping insertion in model container [2024-11-22 13:12:32,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:12:32" (3/3) ... [2024-11-22 13:12:32,746 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-88.i [2024-11-22 13:12:32,758 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 13:12:32,758 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 13:12:32,800 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 13:12:32,805 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;@57f404ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 13:12:32,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 13:12:32,808 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 13:12:32,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-22 13:12:32,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:32,818 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:32,818 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:32,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:32,823 INFO L85 PathProgramCache]: Analyzing trace with hash -700881897, now seen corresponding path program 1 times [2024-11-22 13:12:32,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:12:32,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605573712] [2024-11-22 13:12:32,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:32,833 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:12:32,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:12:32,836 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:12:32,837 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:12:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:33,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 13:12:33,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:12:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-22 13:12:33,053 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:12:33,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:12:33,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605573712] [2024-11-22 13:12:33,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1605573712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:33,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:33,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 13:12:33,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589511096] [2024-11-22 13:12:33,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:33,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 13:12:33,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:12:33,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 13:12:33,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 13:12:33,077 INFO L87 Difference]: Start difference. First operand has 111 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 13:12:33,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:33,099 INFO L93 Difference]: Finished difference Result 215 states and 337 transitions. [2024-11-22 13:12:33,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 13:12:33,120 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2024-11-22 13:12:33,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:33,126 INFO L225 Difference]: With dead ends: 215 [2024-11-22 13:12:33,126 INFO L226 Difference]: Without dead ends: 107 [2024-11-22 13:12:33,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 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:12:33,131 INFO L432 NwaCegarLoop]: 156 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, 156 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:12:33,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:12:33,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-22 13:12:33,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-22 13:12:33,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 13:12:33,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2024-11-22 13:12:33,162 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 139 [2024-11-22 13:12:33,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:33,163 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2024-11-22 13:12:33,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 13:12:33,163 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2024-11-22 13:12:33,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-22 13:12:33,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:33,166 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:33,172 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:12:33,366 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:12:33,367 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:33,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:33,369 INFO L85 PathProgramCache]: Analyzing trace with hash -298632831, now seen corresponding path program 1 times [2024-11-22 13:12:33,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:12:33,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577581168] [2024-11-22 13:12:33,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:33,371 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:12:33,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:12:33,376 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:12:33,378 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:12:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:33,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 13:12:33,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:12:33,589 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-22 13:12:33,590 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:12:33,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:12:33,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577581168] [2024-11-22 13:12:33,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577581168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:33,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:33,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:12:33,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416268607] [2024-11-22 13:12:33,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:33,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:12:33,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:12:33,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:12:33,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:12:33,593 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:33,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:33,670 INFO L93 Difference]: Finished difference Result 218 states and 319 transitions. [2024-11-22 13:12:33,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:12:33,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2024-11-22 13:12:33,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:33,673 INFO L225 Difference]: With dead ends: 218 [2024-11-22 13:12:33,674 INFO L226 Difference]: Without dead ends: 114 [2024-11-22 13:12:33,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:12:33,675 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:33,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 724 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:12:33,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-22 13:12:33,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-22 13:12:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 13:12:33,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 162 transitions. [2024-11-22 13:12:33,692 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 162 transitions. Word has length 139 [2024-11-22 13:12:33,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:33,696 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 162 transitions. [2024-11-22 13:12:33,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:33,696 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 162 transitions. [2024-11-22 13:12:33,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-22 13:12:33,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:33,698 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:33,711 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:12:33,898 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:12:33,900 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:33,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:33,901 INFO L85 PathProgramCache]: Analyzing trace with hash 381425539, now seen corresponding path program 1 times [2024-11-22 13:12:33,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:12:33,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684374213] [2024-11-22 13:12:33,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:33,902 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:12:33,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:12:33,904 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:12:33,931 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:12:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:34,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 13:12:34,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:12:34,138 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-22 13:12:34,138 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:12:34,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:12:34,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684374213] [2024-11-22 13:12:34,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1684374213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:34,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:34,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:12:34,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343149107] [2024-11-22 13:12:34,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:34,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 13:12:34,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:12:34,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 13:12:34,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:12:34,140 INFO L87 Difference]: Start difference. First operand 113 states and 162 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:34,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:34,225 INFO L93 Difference]: Finished difference Result 228 states and 328 transitions. [2024-11-22 13:12:34,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 13:12:34,226 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2024-11-22 13:12:34,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:34,227 INFO L225 Difference]: With dead ends: 228 [2024-11-22 13:12:34,227 INFO L226 Difference]: Without dead ends: 118 [2024-11-22 13:12:34,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:12:34,229 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:34,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 992 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:12:34,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-22 13:12:34,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-11-22 13:12:34,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.346938775510204) internal successors, (132), 98 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 13:12:34,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2024-11-22 13:12:34,236 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 139 [2024-11-22 13:12:34,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:34,237 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2024-11-22 13:12:34,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 13:12:34,237 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2024-11-22 13:12:34,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-22 13:12:34,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:34,239 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:34,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-22 13:12:34,443 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:12:34,444 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:34,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:34,445 INFO L85 PathProgramCache]: Analyzing trace with hash 383272581, now seen corresponding path program 1 times [2024-11-22 13:12:34,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:12:34,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1254658021] [2024-11-22 13:12:34,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:34,446 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:12:34,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:12:34,448 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:12:34,449 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:12:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:34,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-22 13:12:34,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:12:34,968 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 87 treesize of output 86 [2024-11-22 13:12:35,337 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 165 treesize of output 138 [2024-11-22 13:12:35,891 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 170 treesize of output 143 [2024-11-22 13:12:36,351 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 165 treesize of output 138 [2024-11-22 13:12:36,878 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 160 treesize of output 135 [2024-11-22 13:12:38,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 137 [2024-11-22 13:12:44,458 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 160 treesize of output 137 [2024-11-22 13:12:56,014 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 175 treesize of output 148 [2024-11-22 13:13:05,767 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 181 treesize of output 152 [2024-11-22 13:13:24,716 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 181 treesize of output 152