./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-2.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 899138639ae829427fdc22a56c52d3f08a657fba3fbc5df29e57dfd933e1433e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:04:31,078 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:04:31,135 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:04:31,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:04:31,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:04:31,163 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:04:31,164 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:04:31,164 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:04:31,164 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:04:31,165 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:04:31,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:04:31,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:04:31,169 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:04:31,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:04:31,170 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:04:31,170 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:04:31,170 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:04:31,171 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:04:31,171 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:04:31,171 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:04:31,171 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:04:31,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:04:31,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:04:31,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:04:31,177 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:04:31,177 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:04:31,177 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:04:31,177 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:04:31,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:04:31,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:04:31,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:04:31,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:04:31,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:04:31,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:04:31,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:04:31,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:04:31,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:04:31,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:04:31,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:04:31,184 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:04:31,184 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:04:31,185 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:04:31,185 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 -> 899138639ae829427fdc22a56c52d3f08a657fba3fbc5df29e57dfd933e1433e [2024-11-19 01:04:31,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:04:31,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:04:31,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:04:31,422 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:04:31,422 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:04:31,423 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-2.i [2024-11-19 01:04:32,754 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:04:32,927 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:04:32,927 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-2.i [2024-11-19 01:04:32,935 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dccce5e6/d45b89dbb8294d1683c77fa4c1135d2d/FLAG57cd2ccd1 [2024-11-19 01:04:33,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dccce5e6/d45b89dbb8294d1683c77fa4c1135d2d [2024-11-19 01:04:33,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:04:33,352 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:04:33,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:04:33,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:04:33,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:04:33,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:04:33" (1/1) ... [2024-11-19 01:04:33,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@219d211a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:04:33, skipping insertion in model container [2024-11-19 01:04:33,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:04:33" (1/1) ... [2024-11-19 01:04:33,390 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:04:33,514 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-2.i[915,928] [2024-11-19 01:04:33,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:04:33,579 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:04:33,590 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-2.i[915,928] [2024-11-19 01:04:33,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:04:33,727 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:04:33,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:04:33 WrapperNode [2024-11-19 01:04:33,728 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:04:33,729 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:04:33,729 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:04:33,729 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:04:33,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:04:33" (1/1) ... [2024-11-19 01:04:33,748 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:04:33" (1/1) ... [2024-11-19 01:04:33,784 INFO L138 Inliner]: procedures = 30, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 512 [2024-11-19 01:04:33,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:04:33,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:04:33,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:04:33,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:04:33,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:04:33" (1/1) ... [2024-11-19 01:04:33,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:04:33" (1/1) ... [2024-11-19 01:04:33,798 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:04:33" (1/1) ... [2024-11-19 01:04:33,804 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-19 01:04:33,804 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:04:33" (1/1) ... [2024-11-19 01:04:33,804 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:04:33" (1/1) ... [2024-11-19 01:04:33,817 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:04:33" (1/1) ... [2024-11-19 01:04:33,821 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:04:33" (1/1) ... [2024-11-19 01:04:33,823 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:04:33" (1/1) ... [2024-11-19 01:04:33,825 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:04:33" (1/1) ... [2024-11-19 01:04:33,829 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:04:33,830 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:04:33,830 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:04:33,830 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:04:33,831 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:04:33" (1/1) ... [2024-11-19 01:04:33,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:04:33,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:04:33,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 01:04:33,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 01:04:33,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:04:33,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-19 01:04:33,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-19 01:04:33,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-19 01:04:33,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 01:04:33,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-19 01:04:33,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 01:04:33,914 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:04:33,914 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:04:33,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 01:04:33,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:04:33,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:04:34,007 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:04:34,009 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:04:34,447 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-19 01:04:34,448 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:04:34,460 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:04:34,460 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:04:34,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:04:34 BoogieIcfgContainer [2024-11-19 01:04:34,460 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:04:34,462 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:04:34,462 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:04:34,465 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:04:34,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:04:33" (1/3) ... [2024-11-19 01:04:34,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d7ed3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:04:34, skipping insertion in model container [2024-11-19 01:04:34,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:04:33" (2/3) ... [2024-11-19 01:04:34,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d7ed3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:04:34, skipping insertion in model container [2024-11-19 01:04:34,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:04:34" (3/3) ... [2024-11-19 01:04:34,467 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-2.i [2024-11-19 01:04:34,482 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:04:34,482 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:04:34,532 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:04:34,538 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;@4a53b46e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:04:34,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:04:34,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 90 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:04:34,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 01:04:34,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:04:34,553 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:04:34,553 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:04:34,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:04:34,558 INFO L85 PathProgramCache]: Analyzing trace with hash 430417907, now seen corresponding path program 1 times [2024-11-19 01:04:34,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:04:34,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026862052] [2024-11-19 01:04:34,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:04:34,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:04:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:04:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-19 01:04:34,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:04:34,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026862052] [2024-11-19 01:04:34,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026862052] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:04:34,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200703334] [2024-11-19 01:04:34,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:04:34,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:04:34,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:04:34,862 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:04:34,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 01:04:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:04:35,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:04:35,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:04:35,101 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-19 01:04:35,101 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:04:35,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200703334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:04:35,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:04:35,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 01:04:35,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097965901] [2024-11-19 01:04:35,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:04:35,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:04:35,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:04:35,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:04:35,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:04:35,132 INFO L87 Difference]: Start difference. First operand has 104 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 90 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:04:35,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:04:35,160 INFO L93 Difference]: Finished difference Result 201 states and 314 transitions. [2024-11-19 01:04:35,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:04:35,164 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-11-19 01:04:35,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:04:35,174 INFO L225 Difference]: With dead ends: 201 [2024-11-19 01:04:35,174 INFO L226 Difference]: Without dead ends: 100 [2024-11-19 01:04:35,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:04:35,182 INFO L432 NwaCegarLoop]: 147 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, 147 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:04:35,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:04:35,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-19 01:04:35,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-19 01:04:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.430232558139535) internal successors, (123), 86 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:04:35,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 147 transitions. [2024-11-19 01:04:35,222 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 147 transitions. Word has length 100 [2024-11-19 01:04:35,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:04:35,222 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 147 transitions. [2024-11-19 01:04:35,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:04:35,223 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 147 transitions. [2024-11-19 01:04:35,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 01:04:35,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:04:35,226 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:04:35,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 01:04:35,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 01:04:35,427 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:04:35,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:04:35,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1747627975, now seen corresponding path program 1 times [2024-11-19 01:04:35,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:04:35,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861490644] [2024-11-19 01:04:35,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:04:35,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:04:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:04:35,731 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-19 01:04:35,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:04:35,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861490644] [2024-11-19 01:04:35,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861490644] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:04:35,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986073603] [2024-11-19 01:04:35,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:04:35,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:04:35,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:04:35,739 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:04:35,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 01:04:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:04:36,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:04:36,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:04:36,174 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:04:36,175 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:04:36,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986073603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:04:36,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:04:36,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-19 01:04:36,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23528255] [2024-11-19 01:04:36,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:04:36,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:04:36,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:04:36,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:04:36,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:04:36,182 INFO L87 Difference]: Start difference. First operand 100 states and 147 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:04:36,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:04:36,266 INFO L93 Difference]: Finished difference Result 199 states and 294 transitions. [2024-11-19 01:04:36,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:04:36,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2024-11-19 01:04:36,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:04:36,268 INFO L225 Difference]: With dead ends: 199 [2024-11-19 01:04:36,268 INFO L226 Difference]: Without dead ends: 102 [2024-11-19 01:04:36,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:04:36,272 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 424 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:04:36,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 424 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:04:36,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-19 01:04:36,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-19 01:04:36,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 88 states have internal predecessors, (125), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:04:36,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 149 transitions. [2024-11-19 01:04:36,285 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 149 transitions. Word has length 100 [2024-11-19 01:04:36,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:04:36,287 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 149 transitions. [2024-11-19 01:04:36,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:04:36,287 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 149 transitions. [2024-11-19 01:04:36,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 01:04:36,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:04:36,289 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:04:36,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 01:04:36,493 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,SelfDestructingSolverStorable1 [2024-11-19 01:04:36,494 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:04:36,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:04:36,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1143937423, now seen corresponding path program 1 times [2024-11-19 01:04:36,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:04:36,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860112478] [2024-11-19 01:04:36,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:04:36,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:04:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:04:36,773 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:04:36,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:04:36,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860112478] [2024-11-19 01:04:36,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860112478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:04:36,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:04:36,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:04:36,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008942761] [2024-11-19 01:04:36,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:04:36,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:04:36,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:04:36,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:04:36,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:04:36,777 INFO L87 Difference]: Start difference. First operand 102 states and 149 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:04:36,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:04:36,822 INFO L93 Difference]: Finished difference Result 245 states and 361 transitions. [2024-11-19 01:04:36,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:04:36,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-19 01:04:36,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:04:36,826 INFO L225 Difference]: With dead ends: 245 [2024-11-19 01:04:36,827 INFO L226 Difference]: Without dead ends: 146 [2024-11-19 01:04:36,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:04:36,828 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 60 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:04:36,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 288 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:04:36,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-19 01:04:36,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 119. [2024-11-19 01:04:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 105 states have internal predecessors, (152), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:04:36,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 176 transitions. [2024-11-19 01:04:36,843 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 176 transitions. Word has length 103 [2024-11-19 01:04:36,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:04:36,844 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 176 transitions. [2024-11-19 01:04:36,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:04:36,844 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 176 transitions. [2024-11-19 01:04:36,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 01:04:36,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:04:36,845 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:04:36,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:04:36,846 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:04:36,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:04:36,846 INFO L85 PathProgramCache]: Analyzing trace with hash -861740552, now seen corresponding path program 1 times [2024-11-19 01:04:36,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:04:36,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430613225] [2024-11-19 01:04:36,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:04:36,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:04:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:04:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:04:38,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:04:38,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430613225] [2024-11-19 01:04:38,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430613225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:04:38,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:04:38,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 01:04:38,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510491301] [2024-11-19 01:04:38,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:04:38,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 01:04:38,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:04:38,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 01:04:38,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:04:38,782 INFO L87 Difference]: Start difference. First operand 119 states and 176 transitions. Second operand has 12 states, 10 states have (on average 4.6) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:04:39,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:04:39,937 INFO L93 Difference]: Finished difference Result 297 states and 435 transitions. [2024-11-19 01:04:39,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:04:39,938 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.6) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2024-11-19 01:04:39,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:04:39,939 INFO L225 Difference]: With dead ends: 297 [2024-11-19 01:04:39,939 INFO L226 Difference]: Without dead ends: 181 [2024-11-19 01:04:39,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-19 01:04:39,941 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 180 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:04:39,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 963 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 01:04:39,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-19 01:04:39,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2024-11-19 01:04:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 161 states have (on average 1.434782608695652) internal successors, (231), 162 states have internal predecessors, (231), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 01:04:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 259 transitions. [2024-11-19 01:04:39,950 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 259 transitions. Word has length 103 [2024-11-19 01:04:39,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:04:39,951 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 259 transitions. [2024-11-19 01:04:39,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.6) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:04:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 259 transitions. [2024-11-19 01:04:39,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 01:04:39,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:04:39,952 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:04:39,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:04:39,953 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:04:39,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:04:39,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1680808867, now seen corresponding path program 1 times [2024-11-19 01:04:39,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:04:39,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108919180] [2024-11-19 01:04:39,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:04:39,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:04:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 01:04:40,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [792191769] [2024-11-19 01:04:40,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:04:40,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:04:40,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:04:40,041 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:04:40,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 01:04:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:04:40,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 01:04:40,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:04:40,389 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 61 treesize of output 60 [2024-11-19 01:04:40,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 77 [2024-11-19 01:04:40,775 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:04:40,775 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:04:40,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:04:40,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108919180] [2024-11-19 01:04:40,776 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 01:04:40,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792191769] [2024-11-19 01:04:40,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792191769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:04:40,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:04:40,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:04:40,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213075603] [2024-11-19 01:04:40,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:04:40,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:04:40,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:04:40,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:04:40,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:04:40,779 INFO L87 Difference]: Start difference. First operand 178 states and 259 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:04:41,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:04:41,729 INFO L93 Difference]: Finished difference Result 493 states and 722 transitions. [2024-11-19 01:04:41,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:04:41,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-11-19 01:04:41,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:04:41,732 INFO L225 Difference]: With dead ends: 493 [2024-11-19 01:04:41,733 INFO L226 Difference]: Without dead ends: 318 [2024-11-19 01:04:41,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:04:41,737 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 97 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 01:04:41,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 355 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 01:04:41,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-19 01:04:41,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 249. [2024-11-19 01:04:41,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 219 states have (on average 1.4200913242009132) internal successors, (311), 220 states have internal predecessors, (311), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 01:04:41,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 363 transitions. [2024-11-19 01:04:41,778 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 363 transitions. Word has length 105 [2024-11-19 01:04:41,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:04:41,780 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 363 transitions. [2024-11-19 01:04:41,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:04:41,781 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 363 transitions. [2024-11-19 01:04:41,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-19 01:04:41,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:04:41,782 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:04:41,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 01:04:41,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:04:41,984 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:04:41,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:04:41,985 INFO L85 PathProgramCache]: Analyzing trace with hash 758996857, now seen corresponding path program 1 times [2024-11-19 01:04:41,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:04:41,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335285805] [2024-11-19 01:04:41,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:04:41,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:04:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:04:43,220 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:04:43,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:04:43,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335285805] [2024-11-19 01:04:43,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335285805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:04:43,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:04:43,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 01:04:43,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619161650] [2024-11-19 01:04:43,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:04:43,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 01:04:43,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:04:43,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 01:04:43,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:04:43,223 INFO L87 Difference]: Start difference. First operand 249 states and 363 transitions. Second operand has 9 states, 5 states have (on average 9.8) internal successors, (49), 9 states have internal predecessors, (49), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-19 01:04:43,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:04:43,813 INFO L93 Difference]: Finished difference Result 578 states and 837 transitions. [2024-11-19 01:04:43,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 01:04:43,814 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 5 states have (on average 9.8) internal successors, (49), 9 states have internal predecessors, (49), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) Word has length 106 [2024-11-19 01:04:43,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:04:43,815 INFO L225 Difference]: With dead ends: 578 [2024-11-19 01:04:43,815 INFO L226 Difference]: Without dead ends: 399 [2024-11-19 01:04:43,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:04:43,816 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 82 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:04:43,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 779 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 01:04:43,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-19 01:04:43,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 310. [2024-11-19 01:04:43,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 279 states have (on average 1.4336917562724014) internal successors, (400), 280 states have internal predecessors, (400), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 01:04:43,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 452 transitions. [2024-11-19 01:04:43,831 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 452 transitions. Word has length 106 [2024-11-19 01:04:43,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:04:43,831 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 452 transitions. [2024-11-19 01:04:43,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 5 states have (on average 9.8) internal successors, (49), 9 states have internal predecessors, (49), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-19 01:04:43,832 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 452 transitions. [2024-11-19 01:04:43,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-19 01:04:43,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:04:43,833 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:04:43,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:04:43,833 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:04:43,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:04:43,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1181698683, now seen corresponding path program 1 times [2024-11-19 01:04:43,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:04:43,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409488193] [2024-11-19 01:04:43,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:04:43,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:04:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:04:45,029 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:04:45,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:04:45,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409488193] [2024-11-19 01:04:45,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409488193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:04:45,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:04:45,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 01:04:45,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750910607] [2024-11-19 01:04:45,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:04:45,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:04:45,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:04:45,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:04:45,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:04:45,031 INFO L87 Difference]: Start difference. First operand 310 states and 452 transitions. Second operand has 8 states, 5 states have (on average 9.8) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-19 01:04:45,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:04:45,699 INFO L93 Difference]: Finished difference Result 612 states and 887 transitions. [2024-11-19 01:04:45,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:04:45,700 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 9.8) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) Word has length 106 [2024-11-19 01:04:45,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:04:45,702 INFO L225 Difference]: With dead ends: 612 [2024-11-19 01:04:45,702 INFO L226 Difference]: Without dead ends: 403 [2024-11-19 01:04:45,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:04:45,703 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 77 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:04:45,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 593 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 01:04:45,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-19 01:04:45,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 315. [2024-11-19 01:04:45,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 284 states have (on average 1.4295774647887325) internal successors, (406), 285 states have internal predecessors, (406), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 01:04:45,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 458 transitions. [2024-11-19 01:04:45,716 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 458 transitions. Word has length 106 [2024-11-19 01:04:45,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:04:45,716 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 458 transitions. [2024-11-19 01:04:45,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 9.8) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-19 01:04:45,717 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 458 transitions. [2024-11-19 01:04:45,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-19 01:04:45,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:04:45,718 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:04:45,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:04:45,718 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:04:45,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:04:45,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1882763261, now seen corresponding path program 1 times [2024-11-19 01:04:45,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:04:45,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429397711] [2024-11-19 01:04:45,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:04:45,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:04:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:04:46,898 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:04:46,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:04:46,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429397711] [2024-11-19 01:04:46,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429397711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:04:46,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:04:46,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 01:04:46,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016931444] [2024-11-19 01:04:46,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:04:46,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 01:04:46,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:04:46,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 01:04:46,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:04:46,900 INFO L87 Difference]: Start difference. First operand 315 states and 458 transitions. Second operand has 12 states, 10 states have (on average 4.9) internal successors, (49), 12 states have internal predecessors, (49), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:04:47,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:04:47,770 INFO L93 Difference]: Finished difference Result 683 states and 999 transitions. [2024-11-19 01:04:47,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 01:04:47,773 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.9) internal successors, (49), 12 states have internal predecessors, (49), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 106 [2024-11-19 01:04:47,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:04:47,775 INFO L225 Difference]: With dead ends: 683 [2024-11-19 01:04:47,775 INFO L226 Difference]: Without dead ends: 474 [2024-11-19 01:04:47,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-19 01:04:47,776 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 71 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:04:47,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 844 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 01:04:47,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-11-19 01:04:47,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 423. [2024-11-19 01:04:47,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 392 states have (on average 1.4540816326530612) internal successors, (570), 393 states have internal predecessors, (570), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 01:04:47,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 622 transitions. [2024-11-19 01:04:47,804 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 622 transitions. Word has length 106 [2024-11-19 01:04:47,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:04:47,804 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 622 transitions. [2024-11-19 01:04:47,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.9) internal successors, (49), 12 states have internal predecessors, (49), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:04:47,804 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 622 transitions. [2024-11-19 01:04:47,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 01:04:47,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:04:47,805 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:04:47,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 01:04:47,805 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:04:47,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:04:47,806 INFO L85 PathProgramCache]: Analyzing trace with hash -180617415, now seen corresponding path program 1 times [2024-11-19 01:04:47,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:04:47,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811399386] [2024-11-19 01:04:47,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:04:47,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:04:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:04:49,279 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:04:49,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:04:49,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811399386] [2024-11-19 01:04:49,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811399386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:04:49,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:04:49,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 01:04:49,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383047955] [2024-11-19 01:04:49,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:04:49,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 01:04:49,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:04:49,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 01:04:49,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:04:49,283 INFO L87 Difference]: Start difference. First operand 423 states and 622 transitions. Second operand has 9 states, 7 states have (on average 7.285714285714286) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:04:49,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:04:49,970 INFO L93 Difference]: Finished difference Result 731 states and 1075 transitions. [2024-11-19 01:04:49,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 01:04:49,970 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.285714285714286) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2024-11-19 01:04:49,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:04:49,972 INFO L225 Difference]: With dead ends: 731 [2024-11-19 01:04:49,972 INFO L226 Difference]: Without dead ends: 464 [2024-11-19 01:04:49,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:04:49,973 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 62 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:04:49,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 731 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 01:04:49,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-19 01:04:49,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 425. [2024-11-19 01:04:49,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 394 states have (on average 1.4517766497461928) internal successors, (572), 395 states have internal predecessors, (572), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 01:04:49,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 624 transitions. [2024-11-19 01:04:49,986 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 624 transitions. Word has length 108 [2024-11-19 01:04:49,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:04:49,987 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 624 transitions. [2024-11-19 01:04:49,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.285714285714286) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:04:49,987 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 624 transitions. [2024-11-19 01:04:49,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 01:04:49,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:04:49,988 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:04:49,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 01:04:49,988 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:04:49,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:04:49,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1680078857, now seen corresponding path program 1 times [2024-11-19 01:04:49,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:04:49,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769931353] [2024-11-19 01:04:49,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:04:49,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:04:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:04:50,478 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:04:50,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:04:50,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769931353] [2024-11-19 01:04:50,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769931353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:04:50,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:04:50,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:04:50,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453564054] [2024-11-19 01:04:50,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:04:50,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:04:50,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:04:50,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:04:50,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:04:50,480 INFO L87 Difference]: Start difference. First operand 425 states and 624 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:04:50,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:04:50,878 INFO L93 Difference]: Finished difference Result 779 states and 1141 transitions. [2024-11-19 01:04:50,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:04:50,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2024-11-19 01:04:50,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:04:50,881 INFO L225 Difference]: With dead ends: 779 [2024-11-19 01:04:50,881 INFO L226 Difference]: Without dead ends: 484 [2024-11-19 01:04:50,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:04:50,882 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 81 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:04:50,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 510 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:04:50,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-11-19 01:04:50,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 425. [2024-11-19 01:04:50,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 394 states have (on average 1.4467005076142132) internal successors, (570), 395 states have internal predecessors, (570), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 01:04:50,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 622 transitions. [2024-11-19 01:04:50,912 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 622 transitions. Word has length 108 [2024-11-19 01:04:50,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:04:50,912 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 622 transitions. [2024-11-19 01:04:50,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:04:50,912 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 622 transitions. [2024-11-19 01:04:50,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 01:04:50,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:04:50,917 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:04:50,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 01:04:50,917 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:04:50,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:04:50,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1257377031, now seen corresponding path program 1 times [2024-11-19 01:04:50,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:04:50,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758714720] [2024-11-19 01:04:50,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:04:50,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:04:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:04:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:04:52,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:04:52,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758714720] [2024-11-19 01:04:52,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758714720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:04:52,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:04:52,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 01:04:52,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135655409] [2024-11-19 01:04:52,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:04:52,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 01:04:52,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:04:52,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 01:04:52,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:04:52,563 INFO L87 Difference]: Start difference. First operand 425 states and 622 transitions. Second operand has 9 states, 7 states have (on average 7.285714285714286) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:04:53,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:04:53,262 INFO L93 Difference]: Finished difference Result 743 states and 1088 transitions. [2024-11-19 01:04:53,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 01:04:53,264 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.285714285714286) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2024-11-19 01:04:53,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:04:53,265 INFO L225 Difference]: With dead ends: 743 [2024-11-19 01:04:53,265 INFO L226 Difference]: Without dead ends: 474 [2024-11-19 01:04:53,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:04:53,266 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 64 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:04:53,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 918 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 01:04:53,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-11-19 01:04:53,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 427. [2024-11-19 01:04:53,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 396 states have (on average 1.4444444444444444) internal successors, (572), 397 states have internal predecessors, (572), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 01:04:53,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 624 transitions. [2024-11-19 01:04:53,285 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 624 transitions. Word has length 108 [2024-11-19 01:04:53,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:04:53,286 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 624 transitions. [2024-11-19 01:04:53,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.285714285714286) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:04:53,286 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 624 transitions. [2024-11-19 01:04:53,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 01:04:53,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:04:53,288 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:04:53,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 01:04:53,288 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:04:53,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:04:53,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1938365222, now seen corresponding path program 1 times [2024-11-19 01:04:53,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:04:53,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424234907] [2024-11-19 01:04:53,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:04:53,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:04:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:04:54,292 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:04:54,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:04:54,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424234907] [2024-11-19 01:04:54,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424234907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:04:54,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:04:54,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 01:04:54,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761322964] [2024-11-19 01:04:54,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:04:54,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 01:04:54,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:04:54,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 01:04:54,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:04:54,295 INFO L87 Difference]: Start difference. First operand 427 states and 624 transitions. Second operand has 9 states, 7 states have (on average 7.428571428571429) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:04:55,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:04:55,316 INFO L93 Difference]: Finished difference Result 801 states and 1156 transitions. [2024-11-19 01:04:55,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 01:04:55,317 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.428571428571429) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2024-11-19 01:04:55,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:04:55,319 INFO L225 Difference]: With dead ends: 801 [2024-11-19 01:04:55,319 INFO L226 Difference]: Without dead ends: 526 [2024-11-19 01:04:55,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:04:55,320 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 205 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 01:04:55,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 776 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 01:04:55,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-19 01:04:55,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 479. [2024-11-19 01:04:55,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 442 states have (on average 1.420814479638009) internal successors, (628), 444 states have internal predecessors, (628), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 01:04:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 688 transitions. [2024-11-19 01:04:55,344 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 688 transitions. Word has length 109 [2024-11-19 01:04:55,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:04:55,344 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 688 transitions. [2024-11-19 01:04:55,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.428571428571429) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:04:55,344 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 688 transitions. [2024-11-19 01:04:55,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 01:04:55,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:04:55,345 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:04:55,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 01:04:55,346 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:04:55,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:04:55,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1506571061, now seen corresponding path program 1 times [2024-11-19 01:04:55,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:04:55,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303505921] [2024-11-19 01:04:55,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:04:55,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:04:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:04:56,152 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:04:56,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:04:56,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303505921] [2024-11-19 01:04:56,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303505921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:04:56,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:04:56,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-19 01:04:56,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970797733] [2024-11-19 01:04:56,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:04:56,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 01:04:56,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:04:56,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 01:04:56,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2024-11-19 01:04:56,154 INFO L87 Difference]: Start difference. First operand 479 states and 688 transitions. Second operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:04:57,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:04:57,170 INFO L93 Difference]: Finished difference Result 989 states and 1405 transitions. [2024-11-19 01:04:57,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 01:04:57,170 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2024-11-19 01:04:57,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:04:57,172 INFO L225 Difference]: With dead ends: 989 [2024-11-19 01:04:57,172 INFO L226 Difference]: Without dead ends: 666 [2024-11-19 01:04:57,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-11-19 01:04:57,175 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 94 mSDsluCounter, 1810 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1986 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 01:04:57,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1986 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1457 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 01:04:57,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-11-19 01:04:57,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 651. [2024-11-19 01:04:57,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 600 states have (on average 1.4033333333333333) internal successors, (842), 604 states have internal predecessors, (842), 40 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:04:57,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 922 transitions. [2024-11-19 01:04:57,199 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 922 transitions. Word has length 110 [2024-11-19 01:04:57,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:04:57,200 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 922 transitions. [2024-11-19 01:04:57,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:04:57,200 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 922 transitions. [2024-11-19 01:04:57,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 01:04:57,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:04:57,201 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:04:57,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 01:04:57,202 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:04:57,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:04:57,202 INFO L85 PathProgramCache]: Analyzing trace with hash 805506483, now seen corresponding path program 1 times [2024-11-19 01:04:57,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:04:57,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029711779] [2024-11-19 01:04:57,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:04:57,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:04:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:04:57,971 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:04:57,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:04:57,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029711779] [2024-11-19 01:04:57,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029711779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:04:57,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:04:57,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:04:57,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941012713] [2024-11-19 01:04:57,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:04:57,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:04:57,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:04:57,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:04:57,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:04:57,974 INFO L87 Difference]: Start difference. First operand 651 states and 922 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:04:58,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:04:58,215 INFO L93 Difference]: Finished difference Result 1126 states and 1601 transitions. [2024-11-19 01:04:58,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:04:58,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2024-11-19 01:04:58,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:04:58,218 INFO L225 Difference]: With dead ends: 1126 [2024-11-19 01:04:58,218 INFO L226 Difference]: Without dead ends: 657 [2024-11-19 01:04:58,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:04:58,222 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:04:58,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 490 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:04:58,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-11-19 01:04:58,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2024-11-19 01:04:58,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 606 states have (on average 1.4059405940594059) internal successors, (852), 610 states have internal predecessors, (852), 40 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:04:58,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 932 transitions. [2024-11-19 01:04:58,248 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 932 transitions. Word has length 110 [2024-11-19 01:04:58,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:04:58,248 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 932 transitions. [2024-11-19 01:04:58,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:04:58,249 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 932 transitions. [2024-11-19 01:04:58,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 01:04:58,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:04:58,250 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:04:58,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 01:04:58,250 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:04:58,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:04:58,251 INFO L85 PathProgramCache]: Analyzing trace with hash 74174475, now seen corresponding path program 1 times [2024-11-19 01:04:58,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:04:58,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321007458] [2024-11-19 01:04:58,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:04:58,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:04:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:04:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:04:59,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:04:59,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321007458] [2024-11-19 01:04:59,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321007458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:04:59,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:04:59,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 01:04:59,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099700175] [2024-11-19 01:04:59,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:04:59,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 01:04:59,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:04:59,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 01:04:59,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:04:59,134 INFO L87 Difference]: Start difference. First operand 657 states and 932 transitions. Second operand has 9 states, 7 states have (on average 7.714285714285714) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:04:59,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:04:59,911 INFO L93 Difference]: Finished difference Result 1394 states and 1949 transitions. [2024-11-19 01:04:59,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 01:04:59,912 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.714285714285714) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 111 [2024-11-19 01:04:59,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:04:59,915 INFO L225 Difference]: With dead ends: 1394 [2024-11-19 01:04:59,915 INFO L226 Difference]: Without dead ends: 919 [2024-11-19 01:04:59,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:04:59,917 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 134 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 01:04:59,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 716 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 01:04:59,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2024-11-19 01:04:59,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 673. [2024-11-19 01:04:59,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 621 states have (on average 1.396135265700483) internal successors, (867), 625 states have internal predecessors, (867), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:04:59,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 947 transitions. [2024-11-19 01:04:59,946 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 947 transitions. Word has length 111 [2024-11-19 01:04:59,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:04:59,946 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 947 transitions. [2024-11-19 01:04:59,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.714285714285714) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:04:59,946 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 947 transitions. [2024-11-19 01:04:59,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 01:04:59,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:04:59,948 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:04:59,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 01:04:59,948 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:04:59,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:04:59,949 INFO L85 PathProgramCache]: Analyzing trace with hash -626890103, now seen corresponding path program 1 times [2024-11-19 01:04:59,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:04:59,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596497529] [2024-11-19 01:04:59,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:04:59,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:05:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:01,536 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:05:01,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:05:01,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596497529] [2024-11-19 01:05:01,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596497529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:01,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:01,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 01:05:01,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48545949] [2024-11-19 01:05:01,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:01,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 01:05:01,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:05:01,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 01:05:01,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:05:01,539 INFO L87 Difference]: Start difference. First operand 673 states and 947 transitions. Second operand has 12 states, 7 states have (on average 7.714285714285714) internal successors, (54), 12 states have internal predecessors, (54), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-19 01:05:02,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:02,544 INFO L93 Difference]: Finished difference Result 1207 states and 1695 transitions. [2024-11-19 01:05:02,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 01:05:02,545 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 7 states have (on average 7.714285714285714) internal successors, (54), 12 states have internal predecessors, (54), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 6 states have call successors, (12) Word has length 111 [2024-11-19 01:05:02,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:02,548 INFO L225 Difference]: With dead ends: 1207 [2024-11-19 01:05:02,548 INFO L226 Difference]: Without dead ends: 720 [2024-11-19 01:05:02,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:05:02,550 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 63 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:02,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 980 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 01:05:02,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2024-11-19 01:05:02,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 673. [2024-11-19 01:05:02,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 621 states have (on average 1.392914653784219) internal successors, (865), 625 states have internal predecessors, (865), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:05:02,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 945 transitions. [2024-11-19 01:05:02,584 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 945 transitions. Word has length 111 [2024-11-19 01:05:02,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:02,584 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 945 transitions. [2024-11-19 01:05:02,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 7 states have (on average 7.714285714285714) internal successors, (54), 12 states have internal predecessors, (54), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-19 01:05:02,584 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 945 transitions. [2024-11-19 01:05:02,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 01:05:02,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:02,586 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:02,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 01:05:02,587 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:02,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:02,587 INFO L85 PathProgramCache]: Analyzing trace with hash -512631539, now seen corresponding path program 1 times [2024-11-19 01:05:02,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:05:02,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448530839] [2024-11-19 01:05:02,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:02,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:05:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:03,824 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:05:03,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:05:03,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448530839] [2024-11-19 01:05:03,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448530839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:03,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:03,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 01:05:03,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86465824] [2024-11-19 01:05:03,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:03,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 01:05:03,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:05:03,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 01:05:03,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:05:03,826 INFO L87 Difference]: Start difference. First operand 673 states and 945 transitions. Second operand has 10 states, 7 states have (on average 7.714285714285714) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-19 01:05:04,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:04,575 INFO L93 Difference]: Finished difference Result 1197 states and 1679 transitions. [2024-11-19 01:05:04,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 01:05:04,576 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 7.714285714285714) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) Word has length 111 [2024-11-19 01:05:04,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:04,578 INFO L225 Difference]: With dead ends: 1197 [2024-11-19 01:05:04,579 INFO L226 Difference]: Without dead ends: 710 [2024-11-19 01:05:04,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:05:04,580 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 60 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:04,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 840 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 01:05:04,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-19 01:05:04,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 671. [2024-11-19 01:05:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 619 states have (on average 1.3909531502423262) internal successors, (861), 623 states have internal predecessors, (861), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:05:04,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 941 transitions. [2024-11-19 01:05:04,603 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 941 transitions. Word has length 111 [2024-11-19 01:05:04,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:04,604 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 941 transitions. [2024-11-19 01:05:04,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 7.714285714285714) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-19 01:05:04,604 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 941 transitions. [2024-11-19 01:05:04,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 01:05:04,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:04,605 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:04,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 01:05:04,605 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:04,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:04,606 INFO L85 PathProgramCache]: Analyzing trace with hash -298454379, now seen corresponding path program 1 times [2024-11-19 01:05:04,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:05:04,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20439600] [2024-11-19 01:05:04,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:04,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:05:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:05:06,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:05:06,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20439600] [2024-11-19 01:05:06,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20439600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:06,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:06,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 01:05:06,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332482977] [2024-11-19 01:05:06,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:06,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 01:05:06,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:05:06,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 01:05:06,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:05:06,253 INFO L87 Difference]: Start difference. First operand 671 states and 941 transitions. Second operand has 11 states, 7 states have (on average 7.714285714285714) internal successors, (54), 11 states have internal predecessors, (54), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-19 01:05:07,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:07,121 INFO L93 Difference]: Finished difference Result 1193 states and 1671 transitions. [2024-11-19 01:05:07,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 01:05:07,122 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 7 states have (on average 7.714285714285714) internal successors, (54), 11 states have internal predecessors, (54), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) Word has length 111 [2024-11-19 01:05:07,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:07,124 INFO L225 Difference]: With dead ends: 1193 [2024-11-19 01:05:07,124 INFO L226 Difference]: Without dead ends: 708 [2024-11-19 01:05:07,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:05:07,125 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 67 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:07,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 994 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 01:05:07,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2024-11-19 01:05:07,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 671. [2024-11-19 01:05:07,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 619 states have (on average 1.384491114701131) internal successors, (857), 623 states have internal predecessors, (857), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:05:07,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 937 transitions. [2024-11-19 01:05:07,157 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 937 transitions. Word has length 111 [2024-11-19 01:05:07,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:07,158 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 937 transitions. [2024-11-19 01:05:07,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 7 states have (on average 7.714285714285714) internal successors, (54), 11 states have internal predecessors, (54), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-19 01:05:07,158 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 937 transitions. [2024-11-19 01:05:07,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 01:05:07,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:07,159 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:07,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 01:05:07,159 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:07,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:07,160 INFO L85 PathProgramCache]: Analyzing trace with hash 402610199, now seen corresponding path program 1 times [2024-11-19 01:05:07,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:05:07,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204282910] [2024-11-19 01:05:07,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:07,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:05:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:08,091 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:05:08,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:05:08,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204282910] [2024-11-19 01:05:08,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204282910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:08,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:08,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 01:05:08,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551891603] [2024-11-19 01:05:08,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:08,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 01:05:08,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:05:08,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 01:05:08,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:05:08,095 INFO L87 Difference]: Start difference. First operand 671 states and 937 transitions. Second operand has 9 states, 6 states have (on average 9.0) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-19 01:05:08,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:08,742 INFO L93 Difference]: Finished difference Result 1146 states and 1598 transitions. [2024-11-19 01:05:08,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:05:08,743 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 9.0) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) Word has length 111 [2024-11-19 01:05:08,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:08,745 INFO L225 Difference]: With dead ends: 1146 [2024-11-19 01:05:08,745 INFO L226 Difference]: Without dead ends: 661 [2024-11-19 01:05:08,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:05:08,747 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 73 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:08,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 766 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 01:05:08,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-11-19 01:05:08,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 659. [2024-11-19 01:05:08,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 607 states have (on average 1.3756177924217463) internal successors, (835), 611 states have internal predecessors, (835), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:05:08,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 915 transitions. [2024-11-19 01:05:08,771 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 915 transitions. Word has length 111 [2024-11-19 01:05:08,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:08,772 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 915 transitions. [2024-11-19 01:05:08,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 9.0) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-19 01:05:08,772 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 915 transitions. [2024-11-19 01:05:08,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 01:05:08,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:08,773 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:08,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 01:05:08,773 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:08,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:08,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1861825235, now seen corresponding path program 1 times [2024-11-19 01:05:08,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:05:08,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483387183] [2024-11-19 01:05:08,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:08,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:05:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 01:05:08,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2108540717] [2024-11-19 01:05:08,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:08,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:05:08,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:05:08,833 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:05:08,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 01:05:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:05:09,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:05:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:05:09,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:05:09,339 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:05:09,341 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 01:05:09,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 01:05:09,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:05:09,550 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] [2024-11-19 01:05:09,594 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:05:09,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:05:09 BoogieIcfgContainer [2024-11-19 01:05:09,596 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:05:09,597 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:05:09,597 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:05:09,597 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:05:09,598 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:04:34" (3/4) ... [2024-11-19 01:05:09,599 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 01:05:09,603 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:05:09,604 INFO L158 Benchmark]: Toolchain (without parser) took 36252.11ms. Allocated memory was 178.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 108.3MB in the beginning and 748.0MB in the end (delta: -639.7MB). Peak memory consumption was 465.3MB. Max. memory is 16.1GB. [2024-11-19 01:05:09,604 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 178.3MB. Free memory is still 135.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:05:09,604 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.78ms. Allocated memory is still 178.3MB. Free memory was 108.1MB in the beginning and 145.2MB in the end (delta: -37.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-19 01:05:09,604 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.56ms. Allocated memory is still 178.3MB. Free memory was 145.2MB in the beginning and 141.0MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:05:09,604 INFO L158 Benchmark]: Boogie Preprocessor took 44.84ms. Allocated memory is still 178.3MB. Free memory was 141.0MB in the beginning and 136.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:05:09,604 INFO L158 Benchmark]: RCFGBuilder took 630.33ms. Allocated memory is still 178.3MB. Free memory was 136.8MB in the beginning and 99.4MB in the end (delta: 37.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-19 01:05:09,604 INFO L158 Benchmark]: TraceAbstraction took 35134.55ms. Allocated memory was 178.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 98.2MB in the beginning and 748.0MB in the end (delta: -649.8MB). Peak memory consumption was 452.1MB. Max. memory is 16.1GB. [2024-11-19 01:05:09,605 INFO L158 Benchmark]: Witness Printer took 6.43ms. Allocated memory is still 1.3GB. Free memory was 748.0MB in the beginning and 748.0MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:05:09,605 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.11ms. Allocated memory is still 178.3MB. Free memory is still 135.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.78ms. Allocated memory is still 178.3MB. Free memory was 108.1MB in the beginning and 145.2MB in the end (delta: -37.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.56ms. Allocated memory is still 178.3MB. Free memory was 145.2MB in the beginning and 141.0MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.84ms. Allocated memory is still 178.3MB. Free memory was 141.0MB in the beginning and 136.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 630.33ms. Allocated memory is still 178.3MB. Free memory was 136.8MB in the beginning and 99.4MB in the end (delta: 37.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 35134.55ms. Allocated memory was 178.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 98.2MB in the beginning and 748.0MB in the end (delta: -649.8MB). Peak memory consumption was 452.1MB. Max. memory is 16.1GB. * Witness Printer took 6.43ms. Allocated memory is still 1.3GB. Free memory was 748.0MB in the beginning and 748.0MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. 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 104, overapproximation of someUnaryDOUBLEoperation at line 43. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 10, 200, 56955, 32, 1, 8, 1, -0.6, 9.125, 50.5 }; [L47] unsigned short int last_1_WrapperStruct00_var_1_1 = 10; [L48] unsigned short int last_1_WrapperStruct00_var_1_9 = 8; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L100] EXPR WrapperStruct00.var_1_1 [L100] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L101] EXPR WrapperStruct00.var_1_9 [L101] last_1_WrapperStruct00_var_1_9 = WrapperStruct00.var_1_9 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L79] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ushort() [L80] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L80] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L80] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L81] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L81] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L81] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L82] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ushort() [L83] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L84] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L84] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L84] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L85] WrapperStruct00.var_1_7 = __VERIFIER_nondet_ushort() [L86] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L87] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L88] WrapperStruct00.var_1_8 = __VERIFIER_nondet_ushort() [L89] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L90] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L91] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L93] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L94] WrapperStruct00.var_1_12 = __VERIFIER_nondet_float() [L95] EXPR WrapperStruct00.var_1_12 [L95] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_12 [L95] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L95] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L96] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L97] EXPR WrapperStruct00.var_1_13 [L97] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L97] EXPR WrapperStruct00.var_1_13 [L97] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L97] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L97] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L97] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L112] RET updateVariables() [L113] CALL step() [L52] COND TRUE last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1) [L53] EXPR WrapperStruct00.var_1_5 [L53] EXPR WrapperStruct00.var_1_6 [L53] EXPR WrapperStruct00.var_1_7 [L53] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L53] EXPR (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8) [L53] EXPR WrapperStruct00.var_1_8 [L53] EXPR (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L53] EXPR ((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))) [L53] EXPR WrapperStruct00.var_1_5 [L53] EXPR ((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L53] WrapperStruct00.var_1_1 = ((((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))))) [L55] EXPR WrapperStruct00.var_1_10 [L55] WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8) [L55] EXPR WrapperStruct00.var_1_6 [L55] EXPR WrapperStruct00.var_1_8 [L55] WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L55] COND FALSE !(WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8)) [L66] EXPR WrapperStruct00.var_1_6 [L66] WrapperStruct00.var_1_9 = WrapperStruct00.var_1_6 [L68] EXPR WrapperStruct00.var_1_7 [L68] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L68] COND FALSE !(WrapperStruct00.var_1_7 != WrapperStruct00.var_1_6) [L75] EXPR WrapperStruct00.var_1_12 [L75] WrapperStruct00.var_1_11 = WrapperStruct00.var_1_12 [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR (last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))))))) : 1 [L104] EXPR WrapperStruct00.var_1_1 [L104] EXPR WrapperStruct00.var_1_5 [L104] EXPR WrapperStruct00.var_1_6 [L104] EXPR WrapperStruct00.var_1_7 [L104] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8) [L104] EXPR WrapperStruct00.var_1_8 [L104] EXPR (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR ((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))) [L104] EXPR WrapperStruct00.var_1_5 [L104] EXPR ((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR (last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR ((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))))))) : 1) && ((WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 <= (((((0) < (WrapperStruct00.var_1_1)) ? (0) : (WrapperStruct00.var_1_1))) << WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_10 && (WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_6 * WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_9 == ((unsigned short int) 2))) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_6))) [L104] EXPR WrapperStruct00.var_1_10 [L104] EXPR WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8) [L104] EXPR WrapperStruct00.var_1_6 [L104] EXPR WrapperStruct00.var_1_8 [L104] EXPR WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR (WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 <= (((((0) < (WrapperStruct00.var_1_1)) ? (0) : (WrapperStruct00.var_1_1))) << WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_10 && (WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_6 * WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_9 == ((unsigned short int) 2))) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_6)) [L104] EXPR WrapperStruct00.var_1_9 [L104] EXPR WrapperStruct00.var_1_6 [L104] EXPR (WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 <= (((((0) < (WrapperStruct00.var_1_1)) ? (0) : (WrapperStruct00.var_1_1))) << WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_10 && (WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_6 * WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_9 == ((unsigned short int) 2))) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR ((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))))))) : 1) && ((WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 <= (((((0) < (WrapperStruct00.var_1_1)) ? (0) : (WrapperStruct00.var_1_1))) << WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_10 && (WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_6 * WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_9 == ((unsigned short int) 2))) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_6))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR (((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))))))) : 1) && ((WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 <= (((((0) < (WrapperStruct00.var_1_1)) ? (0) : (WrapperStruct00.var_1_1))) << WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_10 && (WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_6 * WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_9 == ((unsigned short int) 2))) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_7 != WrapperStruct00.var_1_6) ? ((WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((float) ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) [L104] EXPR WrapperStruct00.var_1_7 [L104] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR (WrapperStruct00.var_1_7 != WrapperStruct00.var_1_6) ? ((WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((float) ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12)) [L104] EXPR WrapperStruct00.var_1_11 [L104] EXPR WrapperStruct00.var_1_12 [L104] EXPR (WrapperStruct00.var_1_7 != WrapperStruct00.var_1_6) ? ((WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((float) ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR (((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))))))) : 1) && ((WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 <= (((((0) < (WrapperStruct00.var_1_1)) ? (0) : (WrapperStruct00.var_1_1))) << WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_10 && (WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_6 * WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_9 == ((unsigned short int) 2))) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_7 != WrapperStruct00.var_1_6) ? ((WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((float) ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104-L105] return (((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))))))) : 1) && ((WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 <= (((((0) < (WrapperStruct00.var_1_1)) ? (0) : (WrapperStruct00.var_1_1))) << WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_10 && (WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_6 * WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_9 == ((unsigned short int) 2))) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_7 != WrapperStruct00.var_1_6) ? ((WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((float) ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.0s, OverallIterations: 20, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1507 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1470 mSDsluCounter, 14100 SdHoareTripleChecker+Invalid, 9.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11401 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11729 IncrementalHoareTripleChecker+Invalid, 11847 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 2699 mSDtfsCounter, 11729 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 676 GetRequests, 516 SyntacticMatches, 1 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=673occurred in iteration=15, InterpolantAutomatonStates: 159, 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, 19 MinimizatonAttempts, 905 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 2564 NumberOfCodeBlocks, 2564 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2216 ConstructedInterpolants, 0 QuantifiedInterpolants, 9811 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1104 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 21 InterpolantComputations, 19 PerfectInterpolantSequences, 5489/5544 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 01:05:09,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-2.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 899138639ae829427fdc22a56c52d3f08a657fba3fbc5df29e57dfd933e1433e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:05:11,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:05:11,803 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 01:05:11,807 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:05:11,807 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:05:11,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:05:11,838 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:05:11,838 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:05:11,841 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:05:11,842 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:05:11,842 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:05:11,842 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:05:11,843 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:05:11,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:05:11,843 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:05:11,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:05:11,844 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:05:11,844 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:05:11,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:05:11,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:05:11,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:05:11,850 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:05:11,850 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:05:11,850 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 01:05:11,851 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 01:05:11,851 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:05:11,851 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 01:05:11,852 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:05:11,855 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:05:11,855 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:05:11,856 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:05:11,856 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:05:11,856 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:05:11,856 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:05:11,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:05:11,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:05:11,857 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:05:11,857 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:05:11,858 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 01:05:11,858 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 01:05:11,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:05:11,859 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:05:11,859 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:05:11,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:05:11,859 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 -> 899138639ae829427fdc22a56c52d3f08a657fba3fbc5df29e57dfd933e1433e [2024-11-19 01:05:12,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:05:12,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:05:12,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:05:12,145 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:05:12,146 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:05:12,147 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-2.i [2024-11-19 01:05:13,757 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:05:13,914 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:05:13,915 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-2.i [2024-11-19 01:05:13,924 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b39055022/4485bd0b43804b01889be03205e77bc7/FLAGa4e340020 [2024-11-19 01:05:13,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b39055022/4485bd0b43804b01889be03205e77bc7 [2024-11-19 01:05:13,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:05:13,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:05:13,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:05:13,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:05:13,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:05:13,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:05:13" (1/1) ... [2024-11-19 01:05:13,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a080bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:13, skipping insertion in model container [2024-11-19 01:05:13,951 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:05:13" (1/1) ... [2024-11-19 01:05:13,972 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:05:14,124 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-2.i[915,928] [2024-11-19 01:05:14,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:05:14,185 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:05:14,199 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-2.i[915,928] [2024-11-19 01:05:14,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:05:14,246 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:05:14,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:14 WrapperNode [2024-11-19 01:05:14,246 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:05:14,247 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:05:14,247 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:05:14,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:05:14,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:14" (1/1) ... [2024-11-19 01:05:14,272 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:14" (1/1) ... [2024-11-19 01:05:14,323 INFO L138 Inliner]: procedures = 34, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 497 [2024-11-19 01:05:14,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:05:14,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:05:14,325 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:05:14,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:05:14,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:14" (1/1) ... [2024-11-19 01:05:14,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:14" (1/1) ... [2024-11-19 01:05:14,341 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:14" (1/1) ... [2024-11-19 01:05:14,368 INFO L175 MemorySlicer]: Split 132 memory accesses to 2 slices as follows [2, 130]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 26 writes are split as follows [0, 26]. [2024-11-19 01:05:14,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:14" (1/1) ... [2024-11-19 01:05:14,369 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:14" (1/1) ... [2024-11-19 01:05:14,392 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:14" (1/1) ... [2024-11-19 01:05:14,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:14" (1/1) ... [2024-11-19 01:05:14,398 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:14" (1/1) ... [2024-11-19 01:05:14,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:14" (1/1) ... [2024-11-19 01:05:14,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:05:14,404 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:05:14,404 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:05:14,404 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:05:14,405 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:14" (1/1) ... [2024-11-19 01:05:14,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:05:14,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:05:14,437 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 01:05:14,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 01:05:14,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:05:14,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 01:05:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 01:05:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 01:05:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 01:05:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 01:05:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 01:05:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 01:05:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 01:05:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 01:05:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 01:05:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-19 01:05:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-19 01:05:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-19 01:05:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-19 01:05:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:05:14,480 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:05:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-19 01:05:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-19 01:05:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:05:14,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:05:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 01:05:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 01:05:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 01:05:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 01:05:14,651 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:05:14,653 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:05:15,203 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2024-11-19 01:05:15,204 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:05:15,213 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:05:15,213 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:05:15,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:05:15 BoogieIcfgContainer [2024-11-19 01:05:15,213 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:05:15,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:05:15,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:05:15,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:05:15,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:05:13" (1/3) ... [2024-11-19 01:05:15,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114151a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:05:15, skipping insertion in model container [2024-11-19 01:05:15,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:05:14" (2/3) ... [2024-11-19 01:05:15,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114151a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:05:15, skipping insertion in model container [2024-11-19 01:05:15,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:05:15" (3/3) ... [2024-11-19 01:05:15,218 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-2.i [2024-11-19 01:05:15,229 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:05:15,229 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:05:15,266 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:05:15,271 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;@135efcdb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:05:15,271 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:05:15,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:05:15,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 01:05:15,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:15,282 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:15,282 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:15,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:15,286 INFO L85 PathProgramCache]: Analyzing trace with hash 630230807, now seen corresponding path program 1 times [2024-11-19 01:05:15,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:05:15,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1267728114] [2024-11-19 01:05:15,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:15,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:15,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:05:15,300 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:05:15,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 01:05:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:15,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:05:15,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:05:15,556 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-19 01:05:15,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:05:15,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:05:15,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1267728114] [2024-11-19 01:05:15,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1267728114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:15,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:15,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:05:15,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778640107] [2024-11-19 01:05:15,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:15,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:05:15,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:05:15,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:05:15,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:05:15,595 INFO L87 Difference]: Start difference. First operand has 100 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:05:15,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:15,618 INFO L93 Difference]: Finished difference Result 193 states and 302 transitions. [2024-11-19 01:05:15,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:05:15,622 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-11-19 01:05:15,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:15,627 INFO L225 Difference]: With dead ends: 193 [2024-11-19 01:05:15,627 INFO L226 Difference]: Without dead ends: 96 [2024-11-19 01:05:15,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:05:15,632 INFO L432 NwaCegarLoop]: 141 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, 141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:15,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:05:15,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-19 01:05:15,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-19 01:05:15,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:05:15,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 141 transitions. [2024-11-19 01:05:15,671 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 141 transitions. Word has length 100 [2024-11-19 01:05:15,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:15,671 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 141 transitions. [2024-11-19 01:05:15,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:05:15,672 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 141 transitions. [2024-11-19 01:05:15,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 01:05:15,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:15,674 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:15,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 01:05:15,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:15,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:15,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:15,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1947440875, now seen corresponding path program 1 times [2024-11-19 01:05:15,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:05:15,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280479671] [2024-11-19 01:05:15,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:15,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:15,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:05:15,881 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:05:15,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 01:05:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:16,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:05:16,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:05:16,074 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-19 01:05:16,075 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:05:16,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:05:16,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1280479671] [2024-11-19 01:05:16,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1280479671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:16,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:16,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:05:16,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979532225] [2024-11-19 01:05:16,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:16,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:05:16,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:05:16,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:05:16,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:05:16,078 INFO L87 Difference]: Start difference. First operand 96 states and 141 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:05:16,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:16,111 INFO L93 Difference]: Finished difference Result 191 states and 282 transitions. [2024-11-19 01:05:16,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:05:16,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-11-19 01:05:16,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:16,112 INFO L225 Difference]: With dead ends: 191 [2024-11-19 01:05:16,113 INFO L226 Difference]: Without dead ends: 98 [2024-11-19 01:05:16,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:05:16,114 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 406 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-19 01:05:16,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:05:16,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-19 01:05:16,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-19 01:05:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 84 states have internal predecessors, (119), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:05:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2024-11-19 01:05:16,122 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 100 [2024-11-19 01:05:16,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:16,123 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2024-11-19 01:05:16,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:05:16,124 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2024-11-19 01:05:16,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 01:05:16,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:16,129 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:16,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 01:05:16,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:16,331 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:16,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:16,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1503520919, now seen corresponding path program 1 times [2024-11-19 01:05:16,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:05:16,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284228774] [2024-11-19 01:05:16,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:16,333 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:16,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:05:16,337 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:05:16,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 01:05:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:16,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 01:05:16,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:05:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:05:16,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:05:16,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:05:16,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284228774] [2024-11-19 01:05:16,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284228774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:16,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:16,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:05:16,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854617217] [2024-11-19 01:05:16,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:16,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:05:16,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:05:16,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:05:16,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:05:16,511 INFO L87 Difference]: Start difference. First operand 98 states and 143 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:05:16,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:16,527 INFO L93 Difference]: Finished difference Result 194 states and 285 transitions. [2024-11-19 01:05:16,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:05:16,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2024-11-19 01:05:16,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:16,529 INFO L225 Difference]: With dead ends: 194 [2024-11-19 01:05:16,529 INFO L226 Difference]: Without dead ends: 99 [2024-11-19 01:05:16,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:05:16,531 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:16,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:05:16,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-19 01:05:16,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-19 01:05:16,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.411764705882353) internal successors, (120), 85 states have internal predecessors, (120), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:05:16,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 144 transitions. [2024-11-19 01:05:16,538 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 144 transitions. Word has length 100 [2024-11-19 01:05:16,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:16,538 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 144 transitions. [2024-11-19 01:05:16,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:05:16,538 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 144 transitions. [2024-11-19 01:05:16,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 01:05:16,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:16,540 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:16,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 01:05:16,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:16,740 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:16,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:16,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1780329127, now seen corresponding path program 1 times [2024-11-19 01:05:16,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:05:16,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1580601277] [2024-11-19 01:05:16,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:16,743 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:16,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:05:16,744 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:05:16,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 01:05:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:16,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:05:16,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:05:16,951 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:05:16,951 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:05:16,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:05:16,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1580601277] [2024-11-19 01:05:16,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1580601277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:16,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:16,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:05:16,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788762578] [2024-11-19 01:05:16,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:16,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:05:16,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:05:16,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:05:16,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:05:16,955 INFO L87 Difference]: Start difference. First operand 99 states and 144 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:05:16,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:16,976 INFO L93 Difference]: Finished difference Result 197 states and 288 transitions. [2024-11-19 01:05:16,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:05:16,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2024-11-19 01:05:16,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:16,978 INFO L225 Difference]: With dead ends: 197 [2024-11-19 01:05:16,978 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 01:05:16,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:05:16,979 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 406 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-19 01:05:16,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:05:16,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 01:05:16,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-19 01:05:16,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 87 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:05:16,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 146 transitions. [2024-11-19 01:05:16,985 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 146 transitions. Word has length 100 [2024-11-19 01:05:16,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:16,985 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 146 transitions. [2024-11-19 01:05:16,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:05:16,985 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 146 transitions. [2024-11-19 01:05:16,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 01:05:16,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:16,986 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:16,992 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 (5)] Ended with exit code 0 [2024-11-19 01:05:17,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:17,187 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:17,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:17,188 INFO L85 PathProgramCache]: Analyzing trace with hash 565363524, now seen corresponding path program 1 times [2024-11-19 01:05:17,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:05:17,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507079558] [2024-11-19 01:05:17,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:17,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:17,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:05:17,191 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:05:17,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 01:05:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:17,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 01:05:17,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:05:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:05:17,489 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:05:17,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:05:17,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507079558] [2024-11-19 01:05:17,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507079558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:17,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:17,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:05:17,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419372805] [2024-11-19 01:05:17,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:17,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:05:17,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:05:17,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:05:17,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:05:17,491 INFO L87 Difference]: Start difference. First operand 101 states and 146 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:05:17,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:17,559 INFO L93 Difference]: Finished difference Result 240 states and 350 transitions. [2024-11-19 01:05:17,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:05:17,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-19 01:05:17,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:17,562 INFO L225 Difference]: With dead ends: 240 [2024-11-19 01:05:17,562 INFO L226 Difference]: Without dead ends: 142 [2024-11-19 01:05:17,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:05:17,564 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 54 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:17,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 276 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:05:17,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-19 01:05:17,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 117. [2024-11-19 01:05:17,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 103 states have internal predecessors, (147), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:05:17,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions. [2024-11-19 01:05:17,570 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 103 [2024-11-19 01:05:17,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:17,571 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 171 transitions. [2024-11-19 01:05:17,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:05:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions. [2024-11-19 01:05:17,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 01:05:17,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:17,572 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:17,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 01:05:17,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:17,777 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:17,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:17,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1532789938, now seen corresponding path program 1 times [2024-11-19 01:05:17,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:05:17,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817954527] [2024-11-19 01:05:17,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:17,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:17,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:05:17,779 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:05:17,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 01:05:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:18,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 01:05:18,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:05:18,040 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 61 treesize of output 60 [2024-11-19 01:05:18,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 89 [2024-11-19 01:05:18,488 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:05:18,488 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:05:18,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:05:18,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817954527] [2024-11-19 01:05:18,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817954527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:18,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:18,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:05:18,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382427988] [2024-11-19 01:05:18,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:18,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:05:18,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:05:18,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:05:18,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:05:18,491 INFO L87 Difference]: Start difference. First operand 117 states and 171 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:05:19,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:19,386 INFO L93 Difference]: Finished difference Result 328 states and 481 transitions. [2024-11-19 01:05:19,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:05:19,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-19 01:05:19,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:19,391 INFO L225 Difference]: With dead ends: 328 [2024-11-19 01:05:19,391 INFO L226 Difference]: Without dead ends: 214 [2024-11-19 01:05:19,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:05:19,392 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 91 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:19,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 337 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 01:05:19,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-19 01:05:19,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 182. [2024-11-19 01:05:19,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 155 states have (on average 1.4) internal successors, (217), 155 states have internal predecessors, (217), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 01:05:19,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 265 transitions. [2024-11-19 01:05:19,419 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 265 transitions. Word has length 103 [2024-11-19 01:05:19,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:19,420 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 265 transitions. [2024-11-19 01:05:19,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:05:19,420 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 265 transitions. [2024-11-19 01:05:19,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-19 01:05:19,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:19,421 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:19,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-19 01:05:19,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:19,622 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:19,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:19,623 INFO L85 PathProgramCache]: Analyzing trace with hash 883165602, now seen corresponding path program 1 times [2024-11-19 01:05:19,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:05:19,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682736938] [2024-11-19 01:05:19,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:19,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:19,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:05:19,628 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:05:19,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 01:05:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:19,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 01:05:19,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:05:19,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 01:05:19,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-19 01:05:19,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:19,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2024-11-19 01:05:20,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:20,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 42 [2024-11-19 01:05:20,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:20,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 42 [2024-11-19 01:05:20,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:20,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 42 [2024-11-19 01:05:20,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:20,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 42 [2024-11-19 01:05:20,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:20,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 53 [2024-11-19 01:05:20,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:20,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 63 [2024-11-19 01:05:20,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:20,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 35 [2024-11-19 01:05:20,896 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 150 proven. 42 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-19 01:05:20,897 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:05:21,082 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:05:21,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:05:21,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682736938] [2024-11-19 01:05:21,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [682736938] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:05:21,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:05:21,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2024-11-19 01:05:21,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541025016] [2024-11-19 01:05:21,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:21,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:05:21,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:05:21,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:05:21,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2024-11-19 01:05:21,086 INFO L87 Difference]: Start difference. First operand 182 states and 265 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:05:21,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:21,614 INFO L93 Difference]: Finished difference Result 345 states and 498 transitions. [2024-11-19 01:05:21,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:05:21,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2024-11-19 01:05:21,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:21,619 INFO L225 Difference]: With dead ends: 345 [2024-11-19 01:05:21,620 INFO L226 Difference]: Without dead ends: 231 [2024-11-19 01:05:21,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2024-11-19 01:05:21,621 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 106 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:21,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 307 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 01:05:21,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-19 01:05:21,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2024-11-19 01:05:21,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 198 states have (on average 1.3888888888888888) internal successors, (275), 199 states have internal predecessors, (275), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 01:05:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 327 transitions. [2024-11-19 01:05:21,632 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 327 transitions. Word has length 106 [2024-11-19 01:05:21,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:21,632 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 327 transitions. [2024-11-19 01:05:21,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:05:21,632 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 327 transitions. [2024-11-19 01:05:21,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-19 01:05:21,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:21,633 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:21,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 01:05:21,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:21,838 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:21,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:21,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1584230180, now seen corresponding path program 1 times [2024-11-19 01:05:21,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:05:21,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377769367] [2024-11-19 01:05:21,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:21,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:21,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:05:21,840 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:05:21,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 01:05:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:22,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-19 01:05:22,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:05:22,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 01:05:22,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-19 01:05:22,227 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 30 treesize of output 14 [2024-11-19 01:05:22,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-19 01:05:22,312 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 25 treesize of output 24 [2024-11-19 01:05:22,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:22,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-11-19 01:05:22,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:22,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-11-19 01:05:22,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:22,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 47 [2024-11-19 01:05:22,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:22,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 61 [2024-11-19 01:05:22,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:22,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 65 [2024-11-19 01:05:22,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:22,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 31 [2024-11-19 01:05:22,854 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-19 01:05:22,854 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:05:22,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:05:22,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377769367] [2024-11-19 01:05:22,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377769367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:22,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:22,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 01:05:22,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781128832] [2024-11-19 01:05:22,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:22,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 01:05:22,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:05:22,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 01:05:22,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:05:22,856 INFO L87 Difference]: Start difference. First operand 228 states and 327 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:05:24,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:24,577 INFO L93 Difference]: Finished difference Result 584 states and 839 transitions. [2024-11-19 01:05:24,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 01:05:24,578 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 106 [2024-11-19 01:05:24,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:24,581 INFO L225 Difference]: With dead ends: 584 [2024-11-19 01:05:24,581 INFO L226 Difference]: Without dead ends: 426 [2024-11-19 01:05:24,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2024-11-19 01:05:24,583 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 359 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:24,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 390 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 01:05:24,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-19 01:05:24,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 260. [2024-11-19 01:05:24,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 230 states have (on average 1.4) internal successors, (322), 231 states have internal predecessors, (322), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 01:05:24,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 374 transitions. [2024-11-19 01:05:24,610 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 374 transitions. Word has length 106 [2024-11-19 01:05:24,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:24,610 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 374 transitions. [2024-11-19 01:05:24,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:05:24,610 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 374 transitions. [2024-11-19 01:05:24,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 01:05:24,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:24,611 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:24,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-19 01:05:24,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:24,816 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:24,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:24,816 INFO L85 PathProgramCache]: Analyzing trace with hash 239391488, now seen corresponding path program 1 times [2024-11-19 01:05:24,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:05:24,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376805607] [2024-11-19 01:05:24,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:24,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:24,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:05:24,818 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:05:24,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 01:05:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:25,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-19 01:05:25,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:05:25,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-19 01:05:25,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2024-11-19 01:05:25,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:25,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-11-19 01:05:25,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:25,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-11-19 01:05:25,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:25,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2024-11-19 01:05:25,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:25,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2024-11-19 01:05:25,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:25,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2024-11-19 01:05:26,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:26,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 56 [2024-11-19 01:05:26,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:26,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 67 [2024-11-19 01:05:26,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:26,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 81 treesize of output 71 [2024-11-19 01:05:26,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:26,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 83 treesize of output 35 [2024-11-19 01:05:26,604 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 30 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-19 01:05:26,604 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:05:26,787 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:05:26,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:05:26,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1376805607] [2024-11-19 01:05:26,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1376805607] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:05:26,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:05:26,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2024-11-19 01:05:26,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460109593] [2024-11-19 01:05:26,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:26,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:05:26,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:05:26,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:05:26,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2024-11-19 01:05:26,790 INFO L87 Difference]: Start difference. First operand 260 states and 374 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:05:27,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:27,364 INFO L93 Difference]: Finished difference Result 569 states and 825 transitions. [2024-11-19 01:05:27,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:05:27,365 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-19 01:05:27,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:27,370 INFO L225 Difference]: With dead ends: 569 [2024-11-19 01:05:27,370 INFO L226 Difference]: Without dead ends: 392 [2024-11-19 01:05:27,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 194 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2024-11-19 01:05:27,374 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 193 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:27,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 430 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 01:05:27,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-19 01:05:27,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 326. [2024-11-19 01:05:27,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 296 states have (on average 1.4189189189189189) internal successors, (420), 297 states have internal predecessors, (420), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 01:05:27,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 472 transitions. [2024-11-19 01:05:27,409 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 472 transitions. Word has length 108 [2024-11-19 01:05:27,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:27,409 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 472 transitions. [2024-11-19 01:05:27,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:05:27,410 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 472 transitions. [2024-11-19 01:05:27,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 01:05:27,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:27,411 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:27,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-19 01:05:27,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:27,615 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:27,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:27,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1233591454, now seen corresponding path program 1 times [2024-11-19 01:05:27,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:05:27,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796072353] [2024-11-19 01:05:27,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:27,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:27,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:05:27,618 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:05:27,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 01:05:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:27,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 01:05:27,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:05:27,954 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:05:27,954 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:05:27,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:05:27,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796072353] [2024-11-19 01:05:27,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1796072353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:27,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:27,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:05:27,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848013914] [2024-11-19 01:05:27,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:27,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:05:27,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:05:27,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:05:27,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:05:27,956 INFO L87 Difference]: Start difference. First operand 326 states and 472 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:05:28,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:28,985 INFO L93 Difference]: Finished difference Result 688 states and 995 transitions. [2024-11-19 01:05:28,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:05:28,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-19 01:05:28,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:28,989 INFO L225 Difference]: With dead ends: 688 [2024-11-19 01:05:28,989 INFO L226 Difference]: Without dead ends: 454 [2024-11-19 01:05:28,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:05:28,991 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 75 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:28,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 316 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 01:05:28,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-11-19 01:05:29,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 363. [2024-11-19 01:05:29,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 333 states have (on average 1.4324324324324325) internal successors, (477), 334 states have internal predecessors, (477), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 01:05:29,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 529 transitions. [2024-11-19 01:05:29,009 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 529 transitions. Word has length 108 [2024-11-19 01:05:29,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:29,010 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 529 transitions. [2024-11-19 01:05:29,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:05:29,010 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 529 transitions. [2024-11-19 01:05:29,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 01:05:29,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:29,011 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:29,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-19 01:05:29,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:29,213 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:29,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:29,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1656293280, now seen corresponding path program 1 times [2024-11-19 01:05:29,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:05:29,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765723336] [2024-11-19 01:05:29,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:29,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:29,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:05:29,218 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:05:29,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 01:05:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:29,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-19 01:05:29,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:05:29,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-19 01:05:29,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2024-11-19 01:05:29,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:29,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2024-11-19 01:05:30,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:30,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2024-11-19 01:05:30,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:30,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 63 [2024-11-19 01:05:30,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:30,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 66 [2024-11-19 01:05:30,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:30,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 66 [2024-11-19 01:05:30,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:30,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 74 [2024-11-19 01:05:31,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:31,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 92 treesize of output 85 [2024-11-19 01:05:31,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:31,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 107 treesize of output 88 [2024-11-19 01:05:31,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:31,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 109 treesize of output 43 [2024-11-19 01:05:31,561 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 197 proven. 30 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-19 01:05:31,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:05:31,769 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:05:31,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:05:31,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765723336] [2024-11-19 01:05:31,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765723336] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:05:31,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:05:31,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 22 [2024-11-19 01:05:31,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675501758] [2024-11-19 01:05:31,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:31,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:05:31,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:05:31,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:05:31,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2024-11-19 01:05:31,771 INFO L87 Difference]: Start difference. First operand 363 states and 529 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:05:32,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:32,454 INFO L93 Difference]: Finished difference Result 635 states and 926 transitions. [2024-11-19 01:05:32,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:05:32,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-19 01:05:32,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:32,461 INFO L225 Difference]: With dead ends: 635 [2024-11-19 01:05:32,461 INFO L226 Difference]: Without dead ends: 403 [2024-11-19 01:05:32,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2024-11-19 01:05:32,462 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 126 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:32,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 536 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 01:05:32,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-19 01:05:32,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 369. [2024-11-19 01:05:32,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 339 states have (on average 1.4277286135693215) internal successors, (484), 340 states have internal predecessors, (484), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 01:05:32,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 536 transitions. [2024-11-19 01:05:32,487 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 536 transitions. Word has length 108 [2024-11-19 01:05:32,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:32,488 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 536 transitions. [2024-11-19 01:05:32,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:05:32,489 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 536 transitions. [2024-11-19 01:05:32,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 01:05:32,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:32,489 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:32,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-19 01:05:32,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:32,690 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:32,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:32,691 INFO L85 PathProgramCache]: Analyzing trace with hash 2044829822, now seen corresponding path program 1 times [2024-11-19 01:05:32,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:05:32,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137645568] [2024-11-19 01:05:32,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:32,691 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:32,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:05:32,694 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:05:32,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 01:05:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:32,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 01:05:32,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:05:32,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 01:05:33,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-19 01:05:33,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:33,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 29 [2024-11-19 01:05:33,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:33,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 29 [2024-11-19 01:05:33,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:33,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 29 [2024-11-19 01:05:33,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:33,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 29 [2024-11-19 01:05:33,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:33,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 40 [2024-11-19 01:05:33,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:33,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 51 [2024-11-19 01:05:33,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:33,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 35 [2024-11-19 01:05:33,607 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 150 proven. 42 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-19 01:05:33,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:05:33,776 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:05:33,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:05:33,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137645568] [2024-11-19 01:05:33,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2137645568] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:05:33,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:05:33,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2024-11-19 01:05:33,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246906116] [2024-11-19 01:05:33,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:33,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:05:33,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:05:33,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:05:33,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-19 01:05:33,781 INFO L87 Difference]: Start difference. First operand 369 states and 536 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:05:34,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:34,265 INFO L93 Difference]: Finished difference Result 639 states and 925 transitions. [2024-11-19 01:05:34,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:05:34,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-19 01:05:34,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:34,271 INFO L225 Difference]: With dead ends: 639 [2024-11-19 01:05:34,271 INFO L226 Difference]: Without dead ends: 399 [2024-11-19 01:05:34,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-11-19 01:05:34,272 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 148 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:34,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 381 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:05:34,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-19 01:05:34,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 355. [2024-11-19 01:05:34,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 324 states have (on average 1.4166666666666667) internal successors, (459), 325 states have internal predecessors, (459), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 01:05:34,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 511 transitions. [2024-11-19 01:05:34,299 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 511 transitions. Word has length 108 [2024-11-19 01:05:34,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:34,300 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 511 transitions. [2024-11-19 01:05:34,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:05:34,300 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 511 transitions. [2024-11-19 01:05:34,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 01:05:34,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:34,300 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:34,319 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 (13)] Ended with exit code 0 [2024-11-19 01:05:34,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:34,503 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:34,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:34,503 INFO L85 PathProgramCache]: Analyzing trace with hash -47777376, now seen corresponding path program 1 times [2024-11-19 01:05:34,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:05:34,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225966838] [2024-11-19 01:05:34,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:34,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:34,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:05:34,510 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:05:34,511 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 (14)] Waiting until timeout for monitored process [2024-11-19 01:05:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:34,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 01:05:34,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:05:34,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 01:05:34,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 01:05:34,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-19 01:05:34,915 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 30 treesize of output 14 [2024-11-19 01:05:34,959 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 25 treesize of output 24 [2024-11-19 01:05:35,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:35,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-11-19 01:05:35,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:35,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-11-19 01:05:35,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:35,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 47 [2024-11-19 01:05:35,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:35,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 60 [2024-11-19 01:05:35,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:35,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 63 [2024-11-19 01:05:35,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:35,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 29 [2024-11-19 01:05:35,383 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-19 01:05:35,383 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:05:35,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:05:35,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225966838] [2024-11-19 01:05:35,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225966838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:35,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:35,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 01:05:35,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624335432] [2024-11-19 01:05:35,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:35,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 01:05:35,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:05:35,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 01:05:35,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:05:35,384 INFO L87 Difference]: Start difference. First operand 355 states and 511 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:05:37,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:37,380 INFO L93 Difference]: Finished difference Result 713 states and 1028 transitions. [2024-11-19 01:05:37,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 01:05:37,381 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2024-11-19 01:05:37,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:37,384 INFO L225 Difference]: With dead ends: 713 [2024-11-19 01:05:37,385 INFO L226 Difference]: Without dead ends: 491 [2024-11-19 01:05:37,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2024-11-19 01:05:37,385 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 271 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:37,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 528 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 01:05:37,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-19 01:05:37,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 363. [2024-11-19 01:05:37,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 332 states have (on average 1.4186746987951808) internal successors, (471), 333 states have internal predecessors, (471), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 01:05:37,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 523 transitions. [2024-11-19 01:05:37,402 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 523 transitions. Word has length 109 [2024-11-19 01:05:37,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:37,402 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 523 transitions. [2024-11-19 01:05:37,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:05:37,403 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 523 transitions. [2024-11-19 01:05:37,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 01:05:37,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:37,403 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:37,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-19 01:05:37,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:37,604 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:37,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:37,605 INFO L85 PathProgramCache]: Analyzing trace with hash 704582421, now seen corresponding path program 1 times [2024-11-19 01:05:37,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:05:37,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306997588] [2024-11-19 01:05:37,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:37,606 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:37,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:05:37,608 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:05:37,610 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 (15)] Waiting until timeout for monitored process [2024-11-19 01:05:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:37,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-19 01:05:37,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:05:37,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 01:05:37,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-19 01:05:38,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:38,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2024-11-19 01:05:38,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:38,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-11-19 01:05:38,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:38,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-11-19 01:05:38,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:38,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-11-19 01:05:38,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:38,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 41 [2024-11-19 01:05:38,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:38,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 52 [2024-11-19 01:05:38,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:38,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 62 [2024-11-19 01:05:38,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:38,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 50 [2024-11-19 01:05:39,049 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 155 proven. 42 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-19 01:05:39,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:05:39,222 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:05:39,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:05:39,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306997588] [2024-11-19 01:05:39,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [306997588] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:05:39,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:05:39,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 22 [2024-11-19 01:05:39,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348139030] [2024-11-19 01:05:39,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:39,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:05:39,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:05:39,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:05:39,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2024-11-19 01:05:39,223 INFO L87 Difference]: Start difference. First operand 363 states and 523 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:05:39,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:39,875 INFO L93 Difference]: Finished difference Result 753 states and 1080 transitions. [2024-11-19 01:05:39,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:05:39,875 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-19 01:05:39,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:39,877 INFO L225 Difference]: With dead ends: 753 [2024-11-19 01:05:39,877 INFO L226 Difference]: Without dead ends: 527 [2024-11-19 01:05:39,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2024-11-19 01:05:39,879 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 68 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:39,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 617 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 01:05:39,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-11-19 01:05:39,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 457. [2024-11-19 01:05:39,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 426 states have (on average 1.4178403755868545) internal successors, (604), 427 states have internal predecessors, (604), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 01:05:39,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 656 transitions. [2024-11-19 01:05:39,915 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 656 transitions. Word has length 109 [2024-11-19 01:05:39,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:39,916 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 656 transitions. [2024-11-19 01:05:39,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:05:39,916 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 656 transitions. [2024-11-19 01:05:39,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 01:05:39,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:39,917 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:39,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-19 01:05:40,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:40,118 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:40,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:40,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1254496272, now seen corresponding path program 1 times [2024-11-19 01:05:40,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:05:40,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895615815] [2024-11-19 01:05:40,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:40,119 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:40,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:05:40,122 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:05:40,123 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 (16)] Waiting until timeout for monitored process [2024-11-19 01:05:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:40,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 01:05:40,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:05:40,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:40,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 37 [2024-11-19 01:05:40,394 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:05:40,395 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:05:40,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:05:40,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895615815] [2024-11-19 01:05:40,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895615815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:40,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:40,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:05:40,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600830283] [2024-11-19 01:05:40,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:40,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:05:40,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:05:40,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:05:40,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:05:40,397 INFO L87 Difference]: Start difference. First operand 457 states and 656 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:05:40,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:40,769 INFO L93 Difference]: Finished difference Result 751 states and 1090 transitions. [2024-11-19 01:05:40,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:05:40,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-19 01:05:40,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:40,771 INFO L225 Difference]: With dead ends: 751 [2024-11-19 01:05:40,771 INFO L226 Difference]: Without dead ends: 463 [2024-11-19 01:05:40,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:05:40,772 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:40,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 402 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:05:40,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-19 01:05:40,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2024-11-19 01:05:40,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 432 states have (on average 1.4212962962962963) internal successors, (614), 433 states have internal predecessors, (614), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 01:05:40,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 666 transitions. [2024-11-19 01:05:40,785 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 666 transitions. Word has length 109 [2024-11-19 01:05:40,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:40,786 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 666 transitions. [2024-11-19 01:05:40,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:05:40,786 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 666 transitions. [2024-11-19 01:05:40,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 01:05:40,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:40,787 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:40,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-19 01:05:40,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:40,991 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:40,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:40,991 INFO L85 PathProgramCache]: Analyzing trace with hash 553431694, now seen corresponding path program 1 times [2024-11-19 01:05:40,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:05:40,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939011854] [2024-11-19 01:05:40,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:40,991 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:40,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:05:40,995 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:05:41,008 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 (17)] Waiting until timeout for monitored process [2024-11-19 01:05:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:41,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 01:05:41,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:05:41,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 01:05:41,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-19 01:05:41,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:41,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2024-11-19 01:05:41,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:41,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2024-11-19 01:05:41,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:41,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-11-19 01:05:41,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:41,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-11-19 01:05:42,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:42,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 41 [2024-11-19 01:05:42,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:42,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 52 [2024-11-19 01:05:42,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:42,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 27 [2024-11-19 01:05:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 187 proven. 42 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-19 01:05:42,142 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:05:42,565 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2024-11-19 01:05:42,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:05:42,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939011854] [2024-11-19 01:05:42,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939011854] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:05:42,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:05:42,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2024-11-19 01:05:42,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390938395] [2024-11-19 01:05:42,566 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:05:42,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 01:05:42,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:05:42,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 01:05:42,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2024-11-19 01:05:42,568 INFO L87 Difference]: Start difference. First operand 463 states and 666 transitions. Second operand has 24 states, 20 states have (on average 5.15) internal successors, (103), 24 states have internal predecessors, (103), 11 states have call successors, (22), 5 states have call predecessors, (22), 9 states have return successors, (22), 7 states have call predecessors, (22), 11 states have call successors, (22) [2024-11-19 01:05:45,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:45,007 INFO L93 Difference]: Finished difference Result 859 states and 1201 transitions. [2024-11-19 01:05:45,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-19 01:05:45,007 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 5.15) internal successors, (103), 24 states have internal predecessors, (103), 11 states have call successors, (22), 5 states have call predecessors, (22), 9 states have return successors, (22), 7 states have call predecessors, (22), 11 states have call successors, (22) Word has length 109 [2024-11-19 01:05:45,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:45,010 INFO L225 Difference]: With dead ends: 859 [2024-11-19 01:05:45,010 INFO L226 Difference]: Without dead ends: 557 [2024-11-19 01:05:45,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=471, Invalid=1599, Unknown=0, NotChecked=0, Total=2070 [2024-11-19 01:05:45,011 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 364 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:45,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 458 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 01:05:45,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-19 01:05:45,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 495. [2024-11-19 01:05:45,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 456 states have (on average 1.3793859649122806) internal successors, (629), 457 states have internal predecessors, (629), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 01:05:45,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 681 transitions. [2024-11-19 01:05:45,068 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 681 transitions. Word has length 109 [2024-11-19 01:05:45,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:45,068 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 681 transitions. [2024-11-19 01:05:45,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 5.15) internal successors, (103), 24 states have internal predecessors, (103), 11 states have call successors, (22), 5 states have call predecessors, (22), 9 states have return successors, (22), 7 states have call predecessors, (22), 11 states have call successors, (22) [2024-11-19 01:05:45,068 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 681 transitions. [2024-11-19 01:05:45,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 01:05:45,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:45,069 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:45,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-19 01:05:45,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:45,274 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:45,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:45,275 INFO L85 PathProgramCache]: Analyzing trace with hash 772553852, now seen corresponding path program 1 times [2024-11-19 01:05:45,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:05:45,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540012059] [2024-11-19 01:05:45,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:45,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:45,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:05:45,278 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:05:45,279 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 (18)] Waiting until timeout for monitored process [2024-11-19 01:05:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:45,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 01:05:45,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:05:45,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 01:05:45,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-19 01:05:45,595 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 30 treesize of output 14 [2024-11-19 01:05:45,614 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 30 treesize of output 14 [2024-11-19 01:05:45,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:45,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-11-19 01:05:45,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:45,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 57 [2024-11-19 01:05:45,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:45,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 60 [2024-11-19 01:05:45,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:45,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 26 [2024-11-19 01:05:45,899 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-19 01:05:45,900 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:05:45,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:05:45,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540012059] [2024-11-19 01:05:45,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540012059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:45,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:45,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 01:05:45,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893767811] [2024-11-19 01:05:45,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:45,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 01:05:45,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:05:45,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 01:05:45,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:05:45,902 INFO L87 Difference]: Start difference. First operand 495 states and 681 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:05:48,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:05:48,560 INFO L93 Difference]: Finished difference Result 976 states and 1345 transitions. [2024-11-19 01:05:48,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 01:05:48,561 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2024-11-19 01:05:48,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:05:48,564 INFO L225 Difference]: With dead ends: 976 [2024-11-19 01:05:48,566 INFO L226 Difference]: Without dead ends: 666 [2024-11-19 01:05:48,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-11-19 01:05:48,567 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 305 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:05:48,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 709 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1315 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-19 01:05:48,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-11-19 01:05:48,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 523. [2024-11-19 01:05:48,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 484 states have (on average 1.378099173553719) internal successors, (667), 485 states have internal predecessors, (667), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 01:05:48,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 719 transitions. [2024-11-19 01:05:48,595 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 719 transitions. Word has length 110 [2024-11-19 01:05:48,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:05:48,596 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 719 transitions. [2024-11-19 01:05:48,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:05:48,596 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 719 transitions. [2024-11-19 01:05:48,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 01:05:48,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:05:48,598 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:05:48,610 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 (18)] Ended with exit code 0 [2024-11-19 01:05:48,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:48,803 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:05:48,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:05:48,804 INFO L85 PathProgramCache]: Analyzing trace with hash 71489274, now seen corresponding path program 1 times [2024-11-19 01:05:48,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:05:48,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1653469120] [2024-11-19 01:05:48,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:05:48,804 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:05:48,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:05:48,806 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:05:48,808 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 (19)] Waiting until timeout for monitored process [2024-11-19 01:05:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:05:49,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:05:49,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:05:49,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:05:49,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 26 [2024-11-19 01:05:49,177 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:05:49,178 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:05:49,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:05:49,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1653469120] [2024-11-19 01:05:49,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1653469120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:05:49,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:05:49,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:05:49,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986127626] [2024-11-19 01:05:49,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:05:49,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:05:49,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:05:49,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:05:49,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:05:49,179 INFO L87 Difference]: Start difference. First operand 523 states and 719 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)