./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.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-84.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 4fa328083b1d4aa3a21868494aa94d1f433f55ced0b8b3227cc831ea530b809d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:11:43,094 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:11:43,162 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:11:43,169 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:11:43,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:11:43,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:11:43,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:11:43,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:11:43,200 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:11:43,201 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:11:43,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:11:43,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:11:43,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:11:43,203 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:11:43,203 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:11:43,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:11:43,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:11:43,206 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:11:43,206 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:11:43,206 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:11:43,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:11:43,206 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:11:43,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:11:43,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:11:43,207 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:11:43,207 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:11:43,207 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:11:43,208 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:11:43,208 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:11:43,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:11:43,212 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:11:43,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:11:43,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:11:43,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:11:43,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:11:43,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:11:43,213 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:11:43,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:11:43,213 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:11:43,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:11:43,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:11:43,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:11:43,215 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 -> 4fa328083b1d4aa3a21868494aa94d1f433f55ced0b8b3227cc831ea530b809d [2024-11-19 01:11:43,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:11:43,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:11:43,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:11:43,433 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:11:43,434 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:11:43,435 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-84.i [2024-11-19 01:11:44,802 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:11:44,957 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:11:44,958 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i [2024-11-19 01:11:44,965 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27c333e3e/4144ee10e11b4a0296239f45dbe50f98/FLAG005ea0e8a [2024-11-19 01:11:44,975 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27c333e3e/4144ee10e11b4a0296239f45dbe50f98 [2024-11-19 01:11:44,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:11:44,978 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:11:44,978 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:11:44,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:11:44,982 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:11:44,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:11:44" (1/1) ... [2024-11-19 01:11:44,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4045986c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:11:44, skipping insertion in model container [2024-11-19 01:11:44,984 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:11:44" (1/1) ... [2024-11-19 01:11:45,002 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:11:45,117 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-84.i[916,929] [2024-11-19 01:11:45,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:11:45,190 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:11:45,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-84.i[916,929] [2024-11-19 01:11:45,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:11:45,248 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:11:45,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:11:45 WrapperNode [2024-11-19 01:11:45,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:11:45,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:11:45,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:11:45,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:11:45,255 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:11:45" (1/1) ... [2024-11-19 01:11:45,275 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:11:45" (1/1) ... [2024-11-19 01:11:45,319 INFO L138 Inliner]: procedures = 30, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 424 [2024-11-19 01:11:45,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:11:45,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:11:45,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:11:45,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:11:45,328 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:11:45" (1/1) ... [2024-11-19 01:11:45,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:11:45" (1/1) ... [2024-11-19 01:11:45,332 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:11:45" (1/1) ... [2024-11-19 01:11:45,339 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-19 01:11:45,339 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:11:45" (1/1) ... [2024-11-19 01:11:45,339 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:11:45" (1/1) ... [2024-11-19 01:11:45,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:11:45" (1/1) ... [2024-11-19 01:11:45,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:11:45" (1/1) ... [2024-11-19 01:11:45,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:11:45" (1/1) ... [2024-11-19 01:11:45,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:11:45" (1/1) ... [2024-11-19 01:11:45,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:11:45,424 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:11:45,424 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:11:45,425 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:11:45,425 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:11:45" (1/1) ... [2024-11-19 01:11:45,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:11:45,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:11:45,465 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:11:45,468 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:11:45,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:11:45,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-19 01:11:45,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-19 01:11:45,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-19 01:11:45,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 01:11:45,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-19 01:11:45,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 01:11:45,503 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:11:45,503 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:11:45,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 01:11:45,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:11:45,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:11:45,606 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:11:45,608 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:11:46,063 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-11-19 01:11:46,064 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:11:46,079 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:11:46,079 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:11:46,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:11:46 BoogieIcfgContainer [2024-11-19 01:11:46,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:11:46,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:11:46,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:11:46,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:11:46,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:11:44" (1/3) ... [2024-11-19 01:11:46,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32bdd3c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:11:46, skipping insertion in model container [2024-11-19 01:11:46,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:11:45" (2/3) ... [2024-11-19 01:11:46,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32bdd3c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:11:46, skipping insertion in model container [2024-11-19 01:11:46,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:11:46" (3/3) ... [2024-11-19 01:11:46,093 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-84.i [2024-11-19 01:11:46,109 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:11:46,109 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:11:46,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:11:46,176 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;@2b0e6c8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:11:46,176 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:11:46,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 01:11:46,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 01:11:46,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:11:46,191 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:11:46,192 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:11:46,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:11:46,197 INFO L85 PathProgramCache]: Analyzing trace with hash 924800917, now seen corresponding path program 1 times [2024-11-19 01:11:46,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:11:46,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034965420] [2024-11-19 01:11:46,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:11:46,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:11:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:11:46,563 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-19 01:11:46,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:11:46,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034965420] [2024-11-19 01:11:46,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034965420] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:11:46,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067798816] [2024-11-19 01:11:46,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:11:46,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:11:46,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:11:46,572 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:11:46,575 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:11:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:11:46,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:11:46,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:11:46,975 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-19 01:11:46,975 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:11:46,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067798816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:11:46,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:11:46,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 01:11:46,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054372720] [2024-11-19 01:11:46,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:11:46,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:11:46,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:11:47,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:11:47,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:11:47,013 INFO L87 Difference]: Start difference. First operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 01:11:47,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:11:47,039 INFO L93 Difference]: Finished difference Result 199 states and 310 transitions. [2024-11-19 01:11:47,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:11:47,041 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 150 [2024-11-19 01:11:47,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:11:47,047 INFO L225 Difference]: With dead ends: 199 [2024-11-19 01:11:47,047 INFO L226 Difference]: Without dead ends: 99 [2024-11-19 01:11:47,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 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:11:47,053 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:11:47,055 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:11:47,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-19 01:11:47,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-19 01:11:47,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 01:11:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-19 01:11:47,110 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 150 [2024-11-19 01:11:47,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:11:47,111 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-19 01:11:47,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 01:11:47,111 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-19 01:11:47,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 01:11:47,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:11:47,115 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:11:47,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 01:11:47,316 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:11:47,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:11:47,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:11:47,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1032707065, now seen corresponding path program 1 times [2024-11-19 01:11:47,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:11:47,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38594959] [2024-11-19 01:11:47,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:11:47,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:11:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:11:47,811 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 01:11:47,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:11:47,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38594959] [2024-11-19 01:11:47,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38594959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:11:47,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:11:47,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:11:47,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415624288] [2024-11-19 01:11:47,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:11:47,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:11:47,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:11:47,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:11:47,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:11:47,816 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-19 01:11:47,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:11:47,860 INFO L93 Difference]: Finished difference Result 198 states and 283 transitions. [2024-11-19 01:11:47,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:11:47,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-19 01:11:47,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:11:47,863 INFO L225 Difference]: With dead ends: 198 [2024-11-19 01:11:47,863 INFO L226 Difference]: Without dead ends: 102 [2024-11-19 01:11:47,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:11:47,866 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:11:47,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 405 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:11:47,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-19 01:11:47,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2024-11-19 01:11:47,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 01:11:47,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2024-11-19 01:11:47,878 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 150 [2024-11-19 01:11:47,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:11:47,880 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2024-11-19 01:11:47,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-19 01:11:47,881 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2024-11-19 01:11:47,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 01:11:47,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:11:47,883 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:11:47,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:11:47,883 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:11:47,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:11:47,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1034554107, now seen corresponding path program 1 times [2024-11-19 01:11:47,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:11:47,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5529964] [2024-11-19 01:11:47,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:11:47,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:11:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:11:48,504 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 01:11:48,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:11:48,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5529964] [2024-11-19 01:11:48,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5529964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:11:48,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:11:48,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:11:48,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793586040] [2024-11-19 01:11:48,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:11:48,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:11:48,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:11:48,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:11:48,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:11:48,507 INFO L87 Difference]: Start difference. First operand 101 states and 143 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-19 01:11:48,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:11:48,912 INFO L93 Difference]: Finished difference Result 324 states and 459 transitions. [2024-11-19 01:11:48,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:11:48,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-19 01:11:48,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:11:48,932 INFO L225 Difference]: With dead ends: 324 [2024-11-19 01:11:48,933 INFO L226 Difference]: Without dead ends: 226 [2024-11-19 01:11:48,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:11:48,938 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 194 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:11:48,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 321 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 01:11:48,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-19 01:11:48,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 199. [2024-11-19 01:11:48,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 156 states have (on average 1.294871794871795) internal successors, (202), 156 states have internal predecessors, (202), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:11:48,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 282 transitions. [2024-11-19 01:11:48,963 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 282 transitions. Word has length 150 [2024-11-19 01:11:48,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:11:48,964 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 282 transitions. [2024-11-19 01:11:48,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-19 01:11:48,964 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 282 transitions. [2024-11-19 01:11:48,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-19 01:11:48,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:11:48,966 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:11:48,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:11:48,967 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:11:48,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:11:48,967 INFO L85 PathProgramCache]: Analyzing trace with hash 2120166937, now seen corresponding path program 1 times [2024-11-19 01:11:48,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:11:48,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858252813] [2024-11-19 01:11:48,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:11:48,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:11:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:11:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 01:11:52,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:11:52,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858252813] [2024-11-19 01:11:52,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858252813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:11:52,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:11:52,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-19 01:11:52,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724013232] [2024-11-19 01:11:52,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:11:52,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 01:11:52,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:11:52,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 01:11:52,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-19 01:11:52,022 INFO L87 Difference]: Start difference. First operand 199 states and 282 transitions. Second operand has 16 states, 14 states have (on average 4.357142857142857) internal successors, (61), 16 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 01:11:53,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:11:53,786 INFO L93 Difference]: Finished difference Result 625 states and 877 transitions. [2024-11-19 01:11:53,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 01:11:53,787 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.357142857142857) internal successors, (61), 16 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 158 [2024-11-19 01:11:53,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:11:53,790 INFO L225 Difference]: With dead ends: 625 [2024-11-19 01:11:53,790 INFO L226 Difference]: Without dead ends: 429 [2024-11-19 01:11:53,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2024-11-19 01:11:53,792 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 167 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:11:53,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1577 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 01:11:53,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-11-19 01:11:53,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 229. [2024-11-19 01:11:53,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 186 states have (on average 1.3064516129032258) internal successors, (243), 186 states have internal predecessors, (243), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:11:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 323 transitions. [2024-11-19 01:11:53,808 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 323 transitions. Word has length 158 [2024-11-19 01:11:53,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:11:53,809 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 323 transitions. [2024-11-19 01:11:53,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.357142857142857) internal successors, (61), 16 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 01:11:53,809 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 323 transitions. [2024-11-19 01:11:53,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-19 01:11:53,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:11:53,811 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:11:53,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:11:53,811 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:11:53,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:11:53,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1752098533, now seen corresponding path program 1 times [2024-11-19 01:11:53,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:11:53,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822233957] [2024-11-19 01:11:53,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:11:53,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:11:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:11:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 01:11:55,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:11:55,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822233957] [2024-11-19 01:11:55,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822233957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:11:55,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:11:55,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 01:11:55,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854797180] [2024-11-19 01:11:55,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:11:55,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 01:11:55,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:11:55,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 01:11:55,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:11:55,550 INFO L87 Difference]: Start difference. First operand 229 states and 323 transitions. Second operand has 14 states, 12 states have (on average 5.083333333333333) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 01:11:56,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:11:56,428 INFO L93 Difference]: Finished difference Result 535 states and 753 transitions. [2024-11-19 01:11:56,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 01:11:56,429 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.083333333333333) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 158 [2024-11-19 01:11:56,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:11:56,432 INFO L225 Difference]: With dead ends: 535 [2024-11-19 01:11:56,433 INFO L226 Difference]: Without dead ends: 309 [2024-11-19 01:11:56,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-11-19 01:11:56,435 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 60 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:11:56,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 853 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 01:11:56,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-19 01:11:56,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 233. [2024-11-19 01:11:56,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 190 states have (on average 1.3105263157894738) internal successors, (249), 190 states have internal predecessors, (249), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:11:56,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 329 transitions. [2024-11-19 01:11:56,471 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 329 transitions. Word has length 158 [2024-11-19 01:11:56,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:11:56,471 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 329 transitions. [2024-11-19 01:11:56,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.083333333333333) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 01:11:56,472 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 329 transitions. [2024-11-19 01:11:56,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-19 01:11:56,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:11:56,473 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:11:56,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 01:11:56,473 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:11:56,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:11:56,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1171616002, now seen corresponding path program 1 times [2024-11-19 01:11:56,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:11:56,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913079792] [2024-11-19 01:11:56,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:11:56,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:11:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:11:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 01:11:58,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:11:58,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913079792] [2024-11-19 01:11:58,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913079792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:11:58,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:11:58,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 01:11:58,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636280142] [2024-11-19 01:11:58,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:11:58,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 01:11:58,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:11:58,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 01:11:58,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:11:58,236 INFO L87 Difference]: Start difference. First operand 233 states and 329 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 01:11:59,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:11:59,081 INFO L93 Difference]: Finished difference Result 577 states and 807 transitions. [2024-11-19 01:11:59,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 01:11:59,081 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2024-11-19 01:11:59,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:11:59,083 INFO L225 Difference]: With dead ends: 577 [2024-11-19 01:11:59,083 INFO L226 Difference]: Without dead ends: 347 [2024-11-19 01:11:59,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:11:59,085 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 55 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:11:59,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 793 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 01:11:59,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-19 01:11:59,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 343. [2024-11-19 01:11:59,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 294 states have (on average 1.3197278911564625) internal successors, (388), 296 states have internal predecessors, (388), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-19 01:11:59,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 476 transitions. [2024-11-19 01:11:59,117 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 476 transitions. Word has length 160 [2024-11-19 01:11:59,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:11:59,117 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 476 transitions. [2024-11-19 01:11:59,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 01:11:59,117 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 476 transitions. [2024-11-19 01:11:59,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-19 01:11:59,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:11:59,120 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:11:59,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:11:59,120 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:11:59,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:11:59,121 INFO L85 PathProgramCache]: Analyzing trace with hash 269132564, now seen corresponding path program 1 times [2024-11-19 01:11:59,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:11:59,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445044093] [2024-11-19 01:11:59,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:11:59,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:11:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:12:00,796 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 01:12:00,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:12:00,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445044093] [2024-11-19 01:12:00,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445044093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:12:00,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:12:00,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 01:12:00,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422050151] [2024-11-19 01:12:00,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:12:00,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 01:12:00,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:12:00,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 01:12:00,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:12:00,798 INFO L87 Difference]: Start difference. First operand 343 states and 476 transitions. Second operand has 10 states, 8 states have (on average 7.875) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 01:12:01,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:12:01,653 INFO L93 Difference]: Finished difference Result 1095 states and 1498 transitions. [2024-11-19 01:12:01,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 01:12:01,654 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.875) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2024-11-19 01:12:01,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:12:01,658 INFO L225 Difference]: With dead ends: 1095 [2024-11-19 01:12:01,658 INFO L226 Difference]: Without dead ends: 755 [2024-11-19 01:12:01,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-19 01:12:01,660 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 114 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 01:12:01,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 901 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 01:12:01,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2024-11-19 01:12:01,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 589. [2024-11-19 01:12:01,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 524 states have (on average 1.3187022900763359) internal successors, (691), 530 states have internal predecessors, (691), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 50 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-19 01:12:01,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 803 transitions. [2024-11-19 01:12:01,697 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 803 transitions. Word has length 160 [2024-11-19 01:12:01,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:12:01,698 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 803 transitions. [2024-11-19 01:12:01,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.875) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 01:12:01,698 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 803 transitions. [2024-11-19 01:12:01,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-19 01:12:01,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:12:01,700 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:12:01,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:12:01,700 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:12:01,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:12:01,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1129206588, now seen corresponding path program 1 times [2024-11-19 01:12:01,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:12:01,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362127410] [2024-11-19 01:12:01,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:12:01,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:12:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:12:01,936 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 01:12:01,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:12:01,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362127410] [2024-11-19 01:12:01,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362127410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:12:01,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:12:01,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:12:01,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689584000] [2024-11-19 01:12:01,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:12:01,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:12:01,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:12:01,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:12:01,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:12:01,940 INFO L87 Difference]: Start difference. First operand 589 states and 803 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-19 01:12:02,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:12:02,199 INFO L93 Difference]: Finished difference Result 1495 states and 2011 transitions. [2024-11-19 01:12:02,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:12:02,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2024-11-19 01:12:02,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:12:02,205 INFO L225 Difference]: With dead ends: 1495 [2024-11-19 01:12:02,205 INFO L226 Difference]: Without dead ends: 909 [2024-11-19 01:12:02,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:12:02,207 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 46 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:12:02,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 432 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:12:02,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2024-11-19 01:12:02,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 597. [2024-11-19 01:12:02,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 532 states have (on average 1.3139097744360901) internal successors, (699), 538 states have internal predecessors, (699), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 50 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-19 01:12:02,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 811 transitions. [2024-11-19 01:12:02,247 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 811 transitions. Word has length 160 [2024-11-19 01:12:02,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:12:02,250 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 811 transitions. [2024-11-19 01:12:02,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-19 01:12:02,250 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 811 transitions. [2024-11-19 01:12:02,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-19 01:12:02,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:12:02,252 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:12:02,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 01:12:02,252 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:12:02,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:12:02,253 INFO L85 PathProgramCache]: Analyzing trace with hash -150657090, now seen corresponding path program 1 times [2024-11-19 01:12:02,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:12:02,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041134816] [2024-11-19 01:12:02,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:12:02,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:12:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:12:03,379 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 01:12:03,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:12:03,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041134816] [2024-11-19 01:12:03,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041134816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:12:03,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:12:03,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 01:12:03,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968973025] [2024-11-19 01:12:03,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:12:03,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:12:03,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:12:03,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:12:03,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:12:03,381 INFO L87 Difference]: Start difference. First operand 597 states and 811 transitions. Second operand has 8 states, 6 states have (on average 10.5) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 01:12:04,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:12:04,123 INFO L93 Difference]: Finished difference Result 1537 states and 2071 transitions. [2024-11-19 01:12:04,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:12:04,124 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.5) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2024-11-19 01:12:04,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:12:04,128 INFO L225 Difference]: With dead ends: 1537 [2024-11-19 01:12:04,128 INFO L226 Difference]: Without dead ends: 943 [2024-11-19 01:12:04,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:12:04,130 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 53 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 01:12:04,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 570 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 01:12:04,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2024-11-19 01:12:04,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 655. [2024-11-19 01:12:04,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 590 states have (on average 1.3135593220338984) internal successors, (775), 596 states have internal predecessors, (775), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 50 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-19 01:12:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 887 transitions. [2024-11-19 01:12:04,172 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 887 transitions. Word has length 160 [2024-11-19 01:12:04,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:12:04,173 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 887 transitions. [2024-11-19 01:12:04,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.5) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 01:12:04,173 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 887 transitions. [2024-11-19 01:12:04,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-19 01:12:04,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:12:04,175 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:12:04,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 01:12:04,175 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:12:04,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:12:04,176 INFO L85 PathProgramCache]: Analyzing trace with hash 409681174, now seen corresponding path program 1 times [2024-11-19 01:12:04,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:12:04,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034293232] [2024-11-19 01:12:04,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:12:04,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:12:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:12:05,026 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 01:12:05,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:12:05,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034293232] [2024-11-19 01:12:05,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034293232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:12:05,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:12:05,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:12:05,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772366821] [2024-11-19 01:12:05,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:12:05,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:12:05,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:12:05,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:12:05,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:12:05,029 INFO L87 Difference]: Start difference. First operand 655 states and 887 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 01:12:05,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:12:05,446 INFO L93 Difference]: Finished difference Result 1344 states and 1816 transitions. [2024-11-19 01:12:05,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:12:05,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2024-11-19 01:12:05,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:12:05,449 INFO L225 Difference]: With dead ends: 1344 [2024-11-19 01:12:05,449 INFO L226 Difference]: Without dead ends: 692 [2024-11-19 01:12:05,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:12:05,451 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 104 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:12:05,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 534 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:12:05,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2024-11-19 01:12:05,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 688. [2024-11-19 01:12:05,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 608 states have (on average 1.2976973684210527) internal successors, (789), 615 states have internal predecessors, (789), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-19 01:12:05,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 925 transitions. [2024-11-19 01:12:05,479 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 925 transitions. Word has length 160 [2024-11-19 01:12:05,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:12:05,480 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 925 transitions. [2024-11-19 01:12:05,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 01:12:05,480 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 925 transitions. [2024-11-19 01:12:05,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-19 01:12:05,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:12:05,482 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:12:05,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 01:12:05,482 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:12:05,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:12:05,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1545951006, now seen corresponding path program 1 times [2024-11-19 01:12:05,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:12:05,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463354744] [2024-11-19 01:12:05,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:12:05,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:12:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:12:06,715 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 01:12:06,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:12:06,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463354744] [2024-11-19 01:12:06,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463354744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:12:06,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:12:06,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 01:12:06,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275710481] [2024-11-19 01:12:06,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:12:06,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 01:12:06,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:12:06,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 01:12:06,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:12:06,718 INFO L87 Difference]: Start difference. First operand 688 states and 925 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 01:12:07,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:12:07,671 INFO L93 Difference]: Finished difference Result 1506 states and 2014 transitions. [2024-11-19 01:12:07,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 01:12:07,672 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2024-11-19 01:12:07,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:12:07,675 INFO L225 Difference]: With dead ends: 1506 [2024-11-19 01:12:07,675 INFO L226 Difference]: Without dead ends: 834 [2024-11-19 01:12:07,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:12:07,679 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 53 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 01:12:07,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 947 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 01:12:07,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2024-11-19 01:12:07,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 688. [2024-11-19 01:12:07,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 608 states have (on average 1.2911184210526316) internal successors, (785), 615 states have internal predecessors, (785), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-19 01:12:07,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 921 transitions. [2024-11-19 01:12:07,712 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 921 transitions. Word has length 160 [2024-11-19 01:12:07,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:12:07,712 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 921 transitions. [2024-11-19 01:12:07,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 01:12:07,712 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 921 transitions. [2024-11-19 01:12:07,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-19 01:12:07,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:12:07,715 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:12:07,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 01:12:07,716 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:12:07,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:12:07,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1148983748, now seen corresponding path program 1 times [2024-11-19 01:12:07,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:12:07,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968693068] [2024-11-19 01:12:07,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:12:07,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:12:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:12:09,014 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 01:12:09,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:12:09,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968693068] [2024-11-19 01:12:09,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968693068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:12:09,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:12:09,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 01:12:09,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001077878] [2024-11-19 01:12:09,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:12:09,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 01:12:09,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:12:09,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 01:12:09,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:12:09,017 INFO L87 Difference]: Start difference. First operand 688 states and 921 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 01:12:10,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:12:10,207 INFO L93 Difference]: Finished difference Result 1662 states and 2204 transitions. [2024-11-19 01:12:10,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 01:12:10,207 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2024-11-19 01:12:10,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:12:10,211 INFO L225 Difference]: With dead ends: 1662 [2024-11-19 01:12:10,211 INFO L226 Difference]: Without dead ends: 990 [2024-11-19 01:12:10,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-19 01:12:10,213 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 61 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:12:10,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1002 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 01:12:10,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-11-19 01:12:10,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 836. [2024-11-19 01:12:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 740 states have (on average 1.2743243243243243) internal successors, (943), 751 states have internal predecessors, (943), 80 states have call successors, (80), 15 states have call predecessors, (80), 15 states have return successors, (80), 69 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-19 01:12:10,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1103 transitions. [2024-11-19 01:12:10,249 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1103 transitions. Word has length 160 [2024-11-19 01:12:10,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:12:10,249 INFO L471 AbstractCegarLoop]: Abstraction has 836 states and 1103 transitions. [2024-11-19 01:12:10,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 01:12:10,250 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1103 transitions. [2024-11-19 01:12:10,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-19 01:12:10,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:12:10,251 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:12:10,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 01:12:10,251 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:12:10,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:12:10,252 INFO L85 PathProgramCache]: Analyzing trace with hash -128024836, now seen corresponding path program 1 times [2024-11-19 01:12:10,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:12:10,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424681580] [2024-11-19 01:12:10,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:12:10,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:12:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:12:11,419 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 01:12:11,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:12:11,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424681580] [2024-11-19 01:12:11,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424681580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:12:11,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:12:11,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 01:12:11,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705787817] [2024-11-19 01:12:11,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:12:11,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 01:12:11,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:12:11,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 01:12:11,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:12:11,424 INFO L87 Difference]: Start difference. First operand 836 states and 1103 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 01:12:12,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:12:12,664 INFO L93 Difference]: Finished difference Result 1782 states and 2346 transitions. [2024-11-19 01:12:12,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 01:12:12,665 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2024-11-19 01:12:12,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:12:12,668 INFO L225 Difference]: With dead ends: 1782 [2024-11-19 01:12:12,668 INFO L226 Difference]: Without dead ends: 962 [2024-11-19 01:12:12,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:12:12,670 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 55 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:12:12,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1124 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 01:12:12,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-11-19 01:12:12,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 818. [2024-11-19 01:12:12,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 722 states have (on average 1.2700831024930748) internal successors, (917), 733 states have internal predecessors, (917), 80 states have call successors, (80), 15 states have call predecessors, (80), 15 states have return successors, (80), 69 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-19 01:12:12,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1077 transitions. [2024-11-19 01:12:12,705 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1077 transitions. Word has length 160 [2024-11-19 01:12:12,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:12:12,706 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1077 transitions. [2024-11-19 01:12:12,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 01:12:12,706 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1077 transitions. [2024-11-19 01:12:12,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-19 01:12:12,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:12:12,707 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:12:12,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 01:12:12,708 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:12:12,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:12:12,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1568583260, now seen corresponding path program 1 times [2024-11-19 01:12:12,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:12:12,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320992371] [2024-11-19 01:12:12,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:12:12,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:12:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:12:12,970 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 01:12:12,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:12:12,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320992371] [2024-11-19 01:12:12,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320992371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:12:12,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:12:12,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:12:12,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089855572] [2024-11-19 01:12:12,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:12:12,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:12:12,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:12:12,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:12:12,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:12:12,972 INFO L87 Difference]: Start difference. First operand 818 states and 1077 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-19 01:12:13,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:12:13,243 INFO L93 Difference]: Finished difference Result 1620 states and 2135 transitions. [2024-11-19 01:12:13,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:12:13,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2024-11-19 01:12:13,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:12:13,247 INFO L225 Difference]: With dead ends: 1620 [2024-11-19 01:12:13,247 INFO L226 Difference]: Without dead ends: 818 [2024-11-19 01:12:13,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:12:13,249 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:12:13,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 428 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:12:13,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2024-11-19 01:12:13,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2024-11-19 01:12:13,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 722 states have (on average 1.2673130193905817) internal successors, (915), 733 states have internal predecessors, (915), 80 states have call successors, (80), 15 states have call predecessors, (80), 15 states have return successors, (80), 69 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-19 01:12:13,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1075 transitions. [2024-11-19 01:12:13,305 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1075 transitions. Word has length 160 [2024-11-19 01:12:13,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:12:13,306 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1075 transitions. [2024-11-19 01:12:13,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-19 01:12:13,306 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1075 transitions. [2024-11-19 01:12:13,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-19 01:12:13,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:12:13,308 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:12:13,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 01:12:13,308 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:12:13,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:12:13,309 INFO L85 PathProgramCache]: Analyzing trace with hash -803156002, now seen corresponding path program 1 times [2024-11-19 01:12:13,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:12:13,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560456883] [2024-11-19 01:12:13,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:12:13,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:12:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:12:14,461 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 01:12:14,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:12:14,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560456883] [2024-11-19 01:12:14,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560456883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:12:14,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:12:14,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 01:12:14,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941151466] [2024-11-19 01:12:14,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:12:14,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:12:14,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:12:14,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:12:14,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:12:14,463 INFO L87 Difference]: Start difference. First operand 818 states and 1075 transitions. Second operand has 8 states, 6 states have (on average 10.5) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 01:12:15,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:12:15,209 INFO L93 Difference]: Finished difference Result 1813 states and 2377 transitions. [2024-11-19 01:12:15,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:12:15,210 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.5) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2024-11-19 01:12:15,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:12:15,214 INFO L225 Difference]: With dead ends: 1813 [2024-11-19 01:12:15,214 INFO L226 Difference]: Without dead ends: 1011 [2024-11-19 01:12:15,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 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:12:15,216 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 53 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 01:12:15,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 693 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 01:12:15,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2024-11-19 01:12:15,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 793. [2024-11-19 01:12:15,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 699 states have (on average 1.2660944206008584) internal successors, (885), 709 states have internal predecessors, (885), 78 states have call successors, (78), 15 states have call predecessors, (78), 15 states have return successors, (78), 68 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-19 01:12:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1041 transitions. [2024-11-19 01:12:15,252 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1041 transitions. Word has length 160 [2024-11-19 01:12:15,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:12:15,253 INFO L471 AbstractCegarLoop]: Abstraction has 793 states and 1041 transitions. [2024-11-19 01:12:15,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.5) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 01:12:15,253 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1041 transitions. [2024-11-19 01:12:15,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-19 01:12:15,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:12:15,255 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:12:15,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 01:12:15,255 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:12:15,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:12:15,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1824224356, now seen corresponding path program 1 times [2024-11-19 01:12:15,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:12:15,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508427275] [2024-11-19 01:12:15,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:12:15,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:12:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:12:16,693 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 01:12:16,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:12:16,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508427275] [2024-11-19 01:12:16,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508427275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:12:16,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:12:16,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 01:12:16,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955722611] [2024-11-19 01:12:16,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:12:16,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 01:12:16,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:12:16,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 01:12:16,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:12:16,699 INFO L87 Difference]: Start difference. First operand 793 states and 1041 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 01:12:17,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:12:17,808 INFO L93 Difference]: Finished difference Result 1758 states and 2293 transitions. [2024-11-19 01:12:17,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 01:12:17,808 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2024-11-19 01:12:17,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:12:17,812 INFO L225 Difference]: With dead ends: 1758 [2024-11-19 01:12:17,812 INFO L226 Difference]: Without dead ends: 981 [2024-11-19 01:12:17,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:12:17,814 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 57 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:12:17,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 881 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 01:12:17,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2024-11-19 01:12:17,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 958. [2024-11-19 01:12:17,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 845 states have (on average 1.2579881656804734) internal successors, (1063), 858 states have internal predecessors, (1063), 90 states have call successors, (90), 22 states have call predecessors, (90), 22 states have return successors, (90), 77 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-19 01:12:17,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1243 transitions. [2024-11-19 01:12:17,865 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1243 transitions. Word has length 160 [2024-11-19 01:12:17,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:12:17,865 INFO L471 AbstractCegarLoop]: Abstraction has 958 states and 1243 transitions. [2024-11-19 01:12:17,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 01:12:17,865 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1243 transitions. [2024-11-19 01:12:17,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-19 01:12:17,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:12:17,868 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:12:17,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 01:12:17,868 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:12:17,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:12:17,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1092955930, now seen corresponding path program 1 times [2024-11-19 01:12:17,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:12:17,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684271408] [2024-11-19 01:12:17,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:12:17,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:12:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:12:18,003 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-19 01:12:18,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:12:18,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684271408] [2024-11-19 01:12:18,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684271408] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:12:18,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806684975] [2024-11-19 01:12:18,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:12:18,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:12:18,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:12:18,005 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:12:18,012 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:12:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:12:18,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:12:18,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:12:18,285 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 01:12:18,285 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:12:18,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806684975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:12:18,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:12:18,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-19 01:12:18,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979124769] [2024-11-19 01:12:18,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:12:18,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:12:18,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:12:18,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:12:18,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:12:18,287 INFO L87 Difference]: Start difference. First operand 958 states and 1243 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-19 01:12:18,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:12:18,375 INFO L93 Difference]: Finished difference Result 1958 states and 2543 transitions. [2024-11-19 01:12:18,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:12:18,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2024-11-19 01:12:18,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:12:18,379 INFO L225 Difference]: With dead ends: 1958 [2024-11-19 01:12:18,379 INFO L226 Difference]: Without dead ends: 1003 [2024-11-19 01:12:18,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:12:18,381 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:12:18,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 535 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:12:18,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2024-11-19 01:12:18,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1003. [2024-11-19 01:12:18,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 890 states have (on average 1.2449438202247192) internal successors, (1108), 903 states have internal predecessors, (1108), 90 states have call successors, (90), 22 states have call predecessors, (90), 22 states have return successors, (90), 77 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-19 01:12:18,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1288 transitions. [2024-11-19 01:12:18,439 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1288 transitions. Word has length 162 [2024-11-19 01:12:18,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:12:18,439 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1288 transitions. [2024-11-19 01:12:18,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-19 01:12:18,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1288 transitions. [2024-11-19 01:12:18,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-19 01:12:18,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:12:18,441 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:12:18,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 01:12:18,642 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,SelfDestructingSolverStorable16 [2024-11-19 01:12:18,642 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:12:18,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:12:18,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1057655491, now seen corresponding path program 1 times [2024-11-19 01:12:18,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:12:18,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299222782] [2024-11-19 01:12:18,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:12:18,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:12:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:12:21,146 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 01:12:21,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:12:21,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299222782] [2024-11-19 01:12:21,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299222782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:12:21,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:12:21,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-19 01:12:21,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625811745] [2024-11-19 01:12:21,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:12:21,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 01:12:21,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:12:21,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 01:12:21,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2024-11-19 01:12:21,147 INFO L87 Difference]: Start difference. First operand 1003 states and 1288 transitions. Second operand has 16 states, 14 states have (on average 4.642857142857143) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 01:12:22,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:12:22,924 INFO L93 Difference]: Finished difference Result 2185 states and 2804 transitions. [2024-11-19 01:12:22,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 01:12:22,925 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.642857142857143) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 162 [2024-11-19 01:12:22,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:12:22,929 INFO L225 Difference]: With dead ends: 2185 [2024-11-19 01:12:22,929 INFO L226 Difference]: Without dead ends: 1185 [2024-11-19 01:12:22,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2024-11-19 01:12:22,931 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 52 mSDsluCounter, 1476 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 01:12:22,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1626 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 01:12:22,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2024-11-19 01:12:22,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1063. [2024-11-19 01:12:22,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 950 states have (on average 1.2463157894736843) internal successors, (1184), 963 states have internal predecessors, (1184), 90 states have call successors, (90), 22 states have call predecessors, (90), 22 states have return successors, (90), 77 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-19 01:12:22,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1364 transitions. [2024-11-19 01:12:22,984 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1364 transitions. Word has length 162 [2024-11-19 01:12:22,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:12:22,985 INFO L471 AbstractCegarLoop]: Abstraction has 1063 states and 1364 transitions. [2024-11-19 01:12:22,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.642857142857143) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 01:12:22,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1364 transitions. [2024-11-19 01:12:22,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-19 01:12:22,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:12:22,987 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:12:22,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 01:12:22,987 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:12:22,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:12:22,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1851108411, now seen corresponding path program 1 times [2024-11-19 01:12:22,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:12:22,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454132216] [2024-11-19 01:12:22,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:12:22,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:12:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:12:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 01:12:23,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:12:23,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454132216] [2024-11-19 01:12:23,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454132216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:12:23,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:12:23,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:12:23,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252859810] [2024-11-19 01:12:23,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:12:23,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:12:23,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:12:23,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:12:23,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:12:23,618 INFO L87 Difference]: Start difference. First operand 1063 states and 1364 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 01:12:24,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:12:24,188 INFO L93 Difference]: Finished difference Result 2055 states and 2637 transitions. [2024-11-19 01:12:24,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:12:24,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 162 [2024-11-19 01:12:24,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:12:24,192 INFO L225 Difference]: With dead ends: 2055 [2024-11-19 01:12:24,192 INFO L226 Difference]: Without dead ends: 995 [2024-11-19 01:12:24,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 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:12:24,194 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 01:12:24,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 493 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 01:12:24,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2024-11-19 01:12:24,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 995. [2024-11-19 01:12:24,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 882 states have (on average 1.2403628117913832) internal successors, (1094), 895 states have internal predecessors, (1094), 90 states have call successors, (90), 22 states have call predecessors, (90), 22 states have return successors, (90), 77 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-19 01:12:24,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1274 transitions. [2024-11-19 01:12:24,251 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1274 transitions. Word has length 162 [2024-11-19 01:12:24,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:12:24,251 INFO L471 AbstractCegarLoop]: Abstraction has 995 states and 1274 transitions. [2024-11-19 01:12:24,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 01:12:24,251 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1274 transitions. [2024-11-19 01:12:24,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-19 01:12:24,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:12:24,252 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:12:24,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 01:12:24,253 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:12:24,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:12:24,253 INFO L85 PathProgramCache]: Analyzing trace with hash -555389885, now seen corresponding path program 1 times [2024-11-19 01:12:24,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:12:24,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698408446] [2024-11-19 01:12:24,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:12:24,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:12:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:12:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 01:12:25,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:12:25,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698408446] [2024-11-19 01:12:25,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698408446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:12:25,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:12:25,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-19 01:12:25,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923918223] [2024-11-19 01:12:25,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:12:25,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 01:12:25,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:12:25,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 01:12:25,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-11-19 01:12:25,902 INFO L87 Difference]: Start difference. First operand 995 states and 1274 transitions. Second operand has 18 states, 16 states have (on average 4.0625) internal successors, (65), 18 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 01:12:27,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:12:27,777 INFO L93 Difference]: Finished difference Result 2307 states and 2942 transitions. [2024-11-19 01:12:27,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 01:12:27,778 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.0625) internal successors, (65), 18 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 162 [2024-11-19 01:12:27,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:12:27,784 INFO L225 Difference]: With dead ends: 2307 [2024-11-19 01:12:27,784 INFO L226 Difference]: Without dead ends: 1315 [2024-11-19 01:12:27,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2024-11-19 01:12:27,788 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 164 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1954 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 01:12:27,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1954 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 01:12:27,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2024-11-19 01:12:27,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1043. [2024-11-19 01:12:27,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 930 states have (on average 1.2344086021505376) internal successors, (1148), 943 states have internal predecessors, (1148), 90 states have call successors, (90), 22 states have call predecessors, (90), 22 states have return successors, (90), 77 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-19 01:12:27,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1328 transitions. [2024-11-19 01:12:27,863 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1328 transitions. Word has length 162 [2024-11-19 01:12:27,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:12:27,864 INFO L471 AbstractCegarLoop]: Abstraction has 1043 states and 1328 transitions. [2024-11-19 01:12:27,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.0625) internal successors, (65), 18 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 01:12:27,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1328 transitions. [2024-11-19 01:12:27,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-19 01:12:27,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:12:27,866 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:12:27,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 01:12:27,866 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:12:27,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:12:27,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1934139077, now seen corresponding path program 1 times [2024-11-19 01:12:27,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:12:27,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690105635] [2024-11-19 01:12:27,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:12:27,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:12:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:12:31,484 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 01:12:31,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:12:31,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690105635] [2024-11-19 01:12:31,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690105635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:12:31,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:12:31,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-19 01:12:31,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166701969] [2024-11-19 01:12:31,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:12:31,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 01:12:31,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:12:31,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 01:12:31,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2024-11-19 01:12:31,486 INFO L87 Difference]: Start difference. First operand 1043 states and 1328 transitions. Second operand has 16 states, 14 states have (on average 4.642857142857143) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 01:12:33,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:12:33,046 INFO L93 Difference]: Finished difference Result 2087 states and 2656 transitions. [2024-11-19 01:12:33,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 01:12:33,050 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.642857142857143) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 162 [2024-11-19 01:12:33,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:12:33,055 INFO L225 Difference]: With dead ends: 2087 [2024-11-19 01:12:33,059 INFO L226 Difference]: Without dead ends: 1047 [2024-11-19 01:12:33,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2024-11-19 01:12:33,064 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 51 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:12:33,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1467 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 01:12:33,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2024-11-19 01:12:33,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 995. [2024-11-19 01:12:33,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 882 states have (on average 1.2358276643990929) internal successors, (1090), 895 states have internal predecessors, (1090), 90 states have call successors, (90), 22 states have call predecessors, (90), 22 states have return successors, (90), 77 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-19 01:12:33,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1270 transitions. [2024-11-19 01:12:33,179 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1270 transitions. Word has length 162 [2024-11-19 01:12:33,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:12:33,180 INFO L471 AbstractCegarLoop]: Abstraction has 995 states and 1270 transitions. [2024-11-19 01:12:33,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.642857142857143) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 01:12:33,183 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1270 transitions. [2024-11-19 01:12:33,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-19 01:12:33,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:12:33,185 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:12:33,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 01:12:33,189 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:12:33,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:12:33,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1940567467, now seen corresponding path program 1 times [2024-11-19 01:12:33,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:12:33,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378760888] [2024-11-19 01:12:33,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:12:33,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:12:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:12:33,504 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 01:12:33,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:12:33,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378760888] [2024-11-19 01:12:33,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378760888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:12:33,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:12:33,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:12:33,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939919617] [2024-11-19 01:12:33,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:12:33,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:12:33,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:12:33,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:12:33,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:12:33,505 INFO L87 Difference]: Start difference. First operand 995 states and 1270 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-19 01:12:33,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:12:33,951 INFO L93 Difference]: Finished difference Result 2778 states and 3517 transitions. [2024-11-19 01:12:33,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:12:33,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 164 [2024-11-19 01:12:33,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:12:33,959 INFO L225 Difference]: With dead ends: 2778 [2024-11-19 01:12:33,959 INFO L226 Difference]: Without dead ends: 1786 [2024-11-19 01:12:33,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:12:33,962 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 102 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:12:33,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 290 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 01:12:33,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2024-11-19 01:12:34,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1266. [2024-11-19 01:12:34,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1153 states have (on average 1.2168256721595836) internal successors, (1403), 1166 states have internal predecessors, (1403), 90 states have call successors, (90), 22 states have call predecessors, (90), 22 states have return successors, (90), 77 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-19 01:12:34,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1583 transitions. [2024-11-19 01:12:34,030 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1583 transitions. Word has length 164 [2024-11-19 01:12:34,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:12:34,030 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1583 transitions. [2024-11-19 01:12:34,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-19 01:12:34,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1583 transitions. [2024-11-19 01:12:34,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-19 01:12:34,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:12:34,032 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:12:34,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 01:12:34,032 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:12:34,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:12:34,032 INFO L85 PathProgramCache]: Analyzing trace with hash 362288575, now seen corresponding path program 1 times [2024-11-19 01:12:34,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:12:34,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503505400] [2024-11-19 01:12:34,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:12:34,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:12:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:12:34,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:12:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:12:34,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:12:34,383 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:12:34,383 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 01:12:34,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 01:12:34,387 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:12:34,441 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:12:34,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:12:34 BoogieIcfgContainer [2024-11-19 01:12:34,443 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:12:34,443 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:12:34,443 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:12:34,443 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:12:34,444 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:11:46" (3/4) ... [2024-11-19 01:12:34,445 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 01:12:34,446 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:12:34,447 INFO L158 Benchmark]: Toolchain (without parser) took 49469.07ms. Allocated memory was 159.4MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 85.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 432.3MB. Max. memory is 16.1GB. [2024-11-19 01:12:34,447 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory was 109.2MB in the beginning and 109.1MB in the end (delta: 118.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:12:34,447 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.55ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 66.4MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 01:12:34,447 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.96ms. Allocated memory is still 159.4MB. Free memory was 66.4MB in the beginning and 61.5MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 01:12:34,447 INFO L158 Benchmark]: Boogie Preprocessor took 103.93ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 61.5MB in the beginning and 188.8MB in the end (delta: -127.3MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-11-19 01:12:34,448 INFO L158 Benchmark]: RCFGBuilder took 658.59ms. Allocated memory is still 220.2MB. Free memory was 188.8MB in the beginning and 153.2MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-19 01:12:34,448 INFO L158 Benchmark]: TraceAbstraction took 48358.06ms. Allocated memory was 220.2MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 153.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 438.5MB. Max. memory is 16.1GB. [2024-11-19 01:12:34,448 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 1.8GB. Free memory is still 1.3GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:12:34,449 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory was 109.2MB in the beginning and 109.1MB in the end (delta: 118.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.55ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 66.4MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.96ms. Allocated memory is still 159.4MB. Free memory was 66.4MB in the beginning and 61.5MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 103.93ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 61.5MB in the beginning and 188.8MB in the end (delta: -127.3MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * RCFGBuilder took 658.59ms. Allocated memory is still 220.2MB. Free memory was 188.8MB in the beginning and 153.2MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 48358.06ms. Allocated memory was 220.2MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 153.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 438.5MB. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 1.8GB. Free memory is still 1.3GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 120. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 128, 25, 64, 8, 0, 64, 1, 27843, -4, 128, 5, 28020, 128, 10000000000000.926, 1000000.6 }; [L57] unsigned short int last_1_WrapperStruct00_var_1_8 = 64; [L58] signed short int last_1_WrapperStruct00_var_1_11 = -4; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L116] EXPR WrapperStruct00.var_1_8 [L116] last_1_WrapperStruct00_var_1_8 = WrapperStruct00.var_1_8 [L117] EXPR WrapperStruct00.var_1_11 [L117] last_1_WrapperStruct00_var_1_11 = WrapperStruct00.var_1_11 [L127] RET updateLastVariables() [L128] CALL updateVariables() [L84] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L85] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L86] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L87] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L88] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L89] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L90] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L92] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L93] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L94] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L95] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L96] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L98] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L99] WrapperStruct00.var_1_10 = __VERIFIER_nondet_ushort() [L100] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L101] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L102] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L104] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L105] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L107] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L108] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_14 != 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_14 != 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L109] WrapperStruct00.var_1_15 = __VERIFIER_nondet_short() [L110] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L111] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L112] WrapperStruct00.var_1_18 = __VERIFIER_nondet_float() [L113] EXPR WrapperStruct00.var_1_18 [L113] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_18 [L113] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L113] EXPR (WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L128] RET updateVariables() [L129] CALL step() [L62] signed long int stepLocal_0 = last_1_WrapperStruct00_var_1_11; VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64, stepLocal_0=-4] [L63] COND TRUE stepLocal_0 != last_1_WrapperStruct00_var_1_8 [L64] EXPR WrapperStruct00.var_1_4 [L64] EXPR WrapperStruct00.var_1_5 [L64] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L64] EXPR ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6) [L64] EXPR WrapperStruct00.var_1_5 [L64] EXPR ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L64] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L64] EXPR ((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7) [L64] EXPR WrapperStruct00.var_1_7 [L64] EXPR ((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L64] WrapperStruct00.var_1_1 = (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))) [L68] WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L68] COND TRUE WrapperStruct00.var_1_9 [L69] EXPR WrapperStruct00.var_1_10 [L69] EXPR WrapperStruct00.var_1_6 [L69] WrapperStruct00.var_1_8 = ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)) [L71] EXPR WrapperStruct00.var_1_5 [L71] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L71] COND TRUE ! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10) [L72] WrapperStruct00.var_1_16 = (32 - 8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L76] EXPR WrapperStruct00.var_1_18 [L76] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_18 [L77] EXPR WrapperStruct00.var_1_1 [L77] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L77] COND FALSE !(WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR (last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4)) [L120] EXPR WrapperStruct00.var_1_1 [L120] EXPR WrapperStruct00.var_1_4 [L120] EXPR WrapperStruct00.var_1_5 [L120] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6) [L120] EXPR WrapperStruct00.var_1_5 [L120] EXPR ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7) [L120] EXPR WrapperStruct00.var_1_7 [L120] EXPR ((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1) [L120] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1 [L120] EXPR WrapperStruct00.var_1_8 [L120] EXPR WrapperStruct00.var_1_10 [L120] EXPR WrapperStruct00.var_1_6 [L120] EXPR WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1) [L120] EXPR WrapperStruct00.var_1_1 [L120] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)))) [L120] EXPR WrapperStruct00.var_1_5 [L120] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))) [L120] EXPR WrapperStruct00.var_1_16 [L120] EXPR (! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_18)) [L120] EXPR WrapperStruct00.var_1_17 [L120] EXPR WrapperStruct00.var_1_18 [L120] EXPR (((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_18)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120-L121] return (((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_18)) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.2s, OverallIterations: 23, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1470 SdHoareTripleChecker+Valid, 15.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1442 mSDsluCounter, 17967 SdHoareTripleChecker+Invalid, 13.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14897 mSDsCounter, 176 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12215 IncrementalHoareTripleChecker+Invalid, 12391 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 176 mSolverCounterUnsat, 3070 mSDtfsCounter, 12215 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 808 GetRequests, 578 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1266occurred in iteration=22, InterpolantAutomatonStates: 210, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 2729 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 25.6s InterpolantComputationTime, 3976 NumberOfCodeBlocks, 3976 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3788 ConstructedInterpolants, 0 QuantifiedInterpolants, 11813 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1098 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 24 InterpolantComputations, 22 PerfectInterpolantSequences, 18145/18240 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:12:34,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.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 4fa328083b1d4aa3a21868494aa94d1f433f55ced0b8b3227cc831ea530b809d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:12:36,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:12:36,721 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 01:12:36,725 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:12:36,725 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:12:36,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:12:36,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:12:36,744 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:12:36,744 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:12:36,744 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:12:36,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:12:36,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:12:36,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:12:36,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:12:36,746 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:12:36,746 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:12:36,746 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:12:36,746 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:12:36,747 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:12:36,747 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:12:36,747 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:12:36,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:12:36,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:12:36,748 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 01:12:36,748 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 01:12:36,748 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:12:36,749 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 01:12:36,749 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:12:36,749 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:12:36,749 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:12:36,750 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:12:36,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:12:36,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:12:36,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:12:36,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:12:36,751 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:12:36,751 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:12:36,751 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:12:36,751 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 01:12:36,752 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 01:12:36,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:12:36,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:12:36,752 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:12:36,753 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:12:36,753 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 -> 4fa328083b1d4aa3a21868494aa94d1f433f55ced0b8b3227cc831ea530b809d [2024-11-19 01:12:37,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:12:37,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:12:37,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:12:37,037 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:12:37,037 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:12:37,038 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-84.i [2024-11-19 01:12:38,601 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:12:38,931 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:12:38,931 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i [2024-11-19 01:12:38,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52feac739/8c53822694b147bfb0ef7d2bcc0eac6b/FLAG0258b2d12 [2024-11-19 01:12:38,983 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52feac739/8c53822694b147bfb0ef7d2bcc0eac6b [2024-11-19 01:12:38,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:12:38,992 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:12:38,993 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:12:38,993 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:12:39,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:12:39,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:12:38" (1/1) ... [2024-11-19 01:12:39,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41207ce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:12:39, skipping insertion in model container [2024-11-19 01:12:39,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:12:38" (1/1) ... [2024-11-19 01:12:39,062 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:12:39,211 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-84.i[916,929] [2024-11-19 01:12:39,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:12:39,254 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:12:39,263 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-84.i[916,929] [2024-11-19 01:12:39,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:12:39,316 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:12:39,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:12:39 WrapperNode [2024-11-19 01:12:39,316 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:12:39,317 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:12:39,317 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:12:39,317 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:12:39,322 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:12:39" (1/1) ... [2024-11-19 01:12:39,341 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:12:39" (1/1) ... [2024-11-19 01:12:39,379 INFO L138 Inliner]: procedures = 34, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 422 [2024-11-19 01:12:39,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:12:39,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:12:39,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:12:39,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:12:39,394 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:12:39" (1/1) ... [2024-11-19 01:12:39,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:12:39" (1/1) ... [2024-11-19 01:12:39,403 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:12:39" (1/1) ... [2024-11-19 01:12:39,426 INFO L175 MemorySlicer]: Split 123 memory accesses to 2 slices as follows [2, 121]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 33 writes are split as follows [0, 33]. [2024-11-19 01:12:39,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:12:39" (1/1) ... [2024-11-19 01:12:39,427 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:12:39" (1/1) ... [2024-11-19 01:12:39,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:12:39" (1/1) ... [2024-11-19 01:12:39,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:12:39" (1/1) ... [2024-11-19 01:12:39,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:12:39" (1/1) ... [2024-11-19 01:12:39,448 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:12:39" (1/1) ... [2024-11-19 01:12:39,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:12:39,458 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:12:39,458 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:12:39,459 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:12:39,459 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:12:39" (1/1) ... [2024-11-19 01:12:39,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:12:39,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:12:39,500 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:12:39,512 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:12:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:12:39,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 01:12:39,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 01:12:39,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 01:12:39,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 01:12:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 01:12:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 01:12:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 01:12:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 01:12:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 01:12:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 01:12:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-19 01:12:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-19 01:12:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-19 01:12:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-19 01:12:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:12:39,551 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:12:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-19 01:12:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-19 01:12:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:12:39,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:12:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 01:12:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 01:12:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 01:12:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 01:12:39,647 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:12:39,648 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:12:40,228 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-11-19 01:12:40,228 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:12:40,246 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:12:40,246 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:12:40,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:12:40 BoogieIcfgContainer [2024-11-19 01:12:40,247 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:12:40,249 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:12:40,249 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:12:40,251 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:12:40,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:12:38" (1/3) ... [2024-11-19 01:12:40,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69351725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:12:40, skipping insertion in model container [2024-11-19 01:12:40,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:12:39" (2/3) ... [2024-11-19 01:12:40,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69351725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:12:40, skipping insertion in model container [2024-11-19 01:12:40,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:12:40" (3/3) ... [2024-11-19 01:12:40,253 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-84.i [2024-11-19 01:12:40,266 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:12:40,266 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:12:40,324 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:12:40,329 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;@ebfe0df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:12:40,329 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:12:40,333 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 01:12:40,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 01:12:40,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:12:40,345 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:12:40,345 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:12:40,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:12:40,349 INFO L85 PathProgramCache]: Analyzing trace with hash 557809999, now seen corresponding path program 1 times [2024-11-19 01:12:40,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:12:40,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766428098] [2024-11-19 01:12:40,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:12:40,361 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:12:40,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:12:40,364 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:12:40,365 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:12:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:12:40,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:12:40,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:12:40,684 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-19 01:12:40,684 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:12:40,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:12:40,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766428098] [2024-11-19 01:12:40,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766428098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:12:40,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:12:40,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:12:40,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785122591] [2024-11-19 01:12:40,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:12:40,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:12:40,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:12:40,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:12:40,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:12:40,713 INFO L87 Difference]: Start difference. First operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 01:12:40,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:12:40,744 INFO L93 Difference]: Finished difference Result 199 states and 310 transitions. [2024-11-19 01:12:40,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:12:40,746 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 150 [2024-11-19 01:12:40,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:12:40,752 INFO L225 Difference]: With dead ends: 199 [2024-11-19 01:12:40,752 INFO L226 Difference]: Without dead ends: 99 [2024-11-19 01:12:40,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 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:12:40,758 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:12:40,759 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:12:40,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-19 01:12:40,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-19 01:12:40,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 01:12:40,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-19 01:12:40,795 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 150 [2024-11-19 01:12:40,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:12:40,795 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-19 01:12:40,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 01:12:40,795 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-19 01:12:40,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 01:12:40,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:12:40,798 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:12:40,806 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:12:40,999 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:12:40,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:12:41,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:12:41,000 INFO L85 PathProgramCache]: Analyzing trace with hash 665716147, now seen corresponding path program 1 times [2024-11-19 01:12:41,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:12:41,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156772] [2024-11-19 01:12:41,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:12:41,001 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:12:41,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:12:41,004 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:12:41,005 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:12:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:12:41,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 01:12:41,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:12:41,369 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 01:12:41,370 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:12:41,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:12:41,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156772] [2024-11-19 01:12:41,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1156772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:12:41,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:12:41,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:12:41,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357453558] [2024-11-19 01:12:41,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:12:41,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:12:41,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:12:41,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:12:41,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:12:41,373 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-19 01:12:41,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:12:41,437 INFO L93 Difference]: Finished difference Result 202 states and 289 transitions. [2024-11-19 01:12:41,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:12:41,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-19 01:12:41,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:12:41,440 INFO L225 Difference]: With dead ends: 202 [2024-11-19 01:12:41,440 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 01:12:41,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 145 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:12:41,441 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 1 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:12:41,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 653 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:12:41,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 01:12:41,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-19 01:12:41,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 83 states have internal predecessors, (107), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 01:12:41,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2024-11-19 01:12:41,451 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 150 [2024-11-19 01:12:41,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:12:41,453 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2024-11-19 01:12:41,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-19 01:12:41,453 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2024-11-19 01:12:41,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 01:12:41,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:12:41,455 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:12:41,463 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:12:41,655 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:12:41,655 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:12:41,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:12:41,656 INFO L85 PathProgramCache]: Analyzing trace with hash 667563189, now seen corresponding path program 1 times [2024-11-19 01:12:41,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:12:41,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550770020] [2024-11-19 01:12:41,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:12:41,657 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:12:41,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:12:41,662 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:12:41,663 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:12:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:12:42,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 01:12:42,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:12:42,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 84 [2024-11-19 01:12:42,577 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 153 treesize of output 129 [2024-11-19 01:12:43,094 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 01:12:43,095 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:12:43,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:12:43,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550770020] [2024-11-19 01:12:43,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550770020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:12:43,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:12:43,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:12:43,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822754682] [2024-11-19 01:12:43,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:12:43,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:12:43,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:12:43,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:12:43,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:12:43,100 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-19 01:12:44,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:12:44,693 INFO L93 Difference]: Finished difference Result 314 states and 439 transitions. [2024-11-19 01:12:44,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:12:44,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-19 01:12:44,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:12:44,696 INFO L225 Difference]: With dead ends: 314 [2024-11-19 01:12:44,696 INFO L226 Difference]: Without dead ends: 212 [2024-11-19 01:12:44,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:12:44,701 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 75 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:12:44,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 477 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 01:12:44,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-19 01:12:44,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 177. [2024-11-19 01:12:44,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 133 states have (on average 1.255639097744361) internal successors, (167), 133 states have internal predecessors, (167), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:12:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 247 transitions. [2024-11-19 01:12:44,729 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 247 transitions. Word has length 150 [2024-11-19 01:12:44,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:12:44,730 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 247 transitions. [2024-11-19 01:12:44,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-19 01:12:44,731 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 247 transitions. [2024-11-19 01:12:44,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-19 01:12:44,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:12:44,733 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:12:44,741 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:12:44,937 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:12:44,938 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:12:44,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:12:44,939 INFO L85 PathProgramCache]: Analyzing trace with hash -329940525, now seen corresponding path program 1 times [2024-11-19 01:12:44,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:12:44,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885980457] [2024-11-19 01:12:44,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:12:44,940 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:12:44,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:12:44,944 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:12:44,946 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:12:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:12:45,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-19 01:12:45,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:12:45,388 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:12:45,451 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:12:45,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:12:45,546 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:12:45,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:12:45,683 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:12:45,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:12:45,906 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:12:46,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:12:46,144 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 65 treesize of output 76 [2024-11-19 01:12:46,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:12:46,562 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 80 treesize of output 79 [2024-11-19 01:12:46,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:12:46,789 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 75 treesize of output 89 [2024-11-19 01:12:47,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:12:47,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 85 treesize of output 102 [2024-11-19 01:12:47,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:12:47,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 100 treesize of output 105 [2024-11-19 01:12:48,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:12:48,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 112 treesize of output 120 [2024-11-19 01:12:48,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:12:48,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 140 treesize of output 145 [2024-11-19 01:12:48,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:12:48,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 145 treesize of output 150 [2024-11-19 01:12:48,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:12:48,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 145 treesize of output 150 [2024-11-19 01:12:49,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:12:49,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 155 treesize of output 75 [2024-11-19 01:12:49,458 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 692 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-19 01:12:49,458 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:12:49,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:12:49,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885980457] [2024-11-19 01:12:49,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [885980457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:12:49,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:12:49,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-19 01:12:49,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948085174] [2024-11-19 01:12:49,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:12:49,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 01:12:49,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:12:49,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 01:12:49,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2024-11-19 01:12:49,460 INFO L87 Difference]: Start difference. First operand 177 states and 247 transitions. Second operand has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 18 states have internal predecessors, (82), 8 states have call successors, (20), 8 states have call predecessors, (20), 8 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2024-11-19 01:12:53,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:12:53,242 INFO L93 Difference]: Finished difference Result 388 states and 539 transitions. [2024-11-19 01:12:53,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 01:12:53,243 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 18 states have internal predecessors, (82), 8 states have call successors, (20), 8 states have call predecessors, (20), 8 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) Word has length 158 [2024-11-19 01:12:53,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:12:53,245 INFO L225 Difference]: With dead ends: 388 [2024-11-19 01:12:53,245 INFO L226 Difference]: Without dead ends: 286 [2024-11-19 01:12:53,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2024-11-19 01:12:53,251 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 404 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:12:53,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 521 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-19 01:12:53,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-19 01:12:53,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 203. [2024-11-19 01:12:53,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 159 states have (on average 1.2830188679245282) internal successors, (204), 159 states have internal predecessors, (204), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:12:53,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 284 transitions. [2024-11-19 01:12:53,299 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 284 transitions. Word has length 158 [2024-11-19 01:12:53,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:12:53,300 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 284 transitions. [2024-11-19 01:12:53,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 18 states have internal predecessors, (82), 8 states have call successors, (20), 8 states have call predecessors, (20), 8 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2024-11-19 01:12:53,300 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 284 transitions. [2024-11-19 01:12:53,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-19 01:12:53,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:12:53,306 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:12:53,322 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:12:53,508 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:12:53,509 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:12:53,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:12:53,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2135378859, now seen corresponding path program 1 times [2024-11-19 01:12:53,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:12:53,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142669826] [2024-11-19 01:12:53,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:12:53,514 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:12:53,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:12:53,516 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:12:53,517 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:12:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:12:53,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-19 01:12:53,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:12:53,952 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:12:53,964 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:12:54,012 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:12:54,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:12:54,176 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:12:54,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:12:54,313 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:12:54,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:12:54,450 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:12:54,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:12:54,608 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:12:54,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:12:54,797 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:12:55,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:12:55,034 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 65 treesize of output 76 [2024-11-19 01:12:55,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:12:55,239 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 80 treesize of output 79 [2024-11-19 01:12:55,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:12:55,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 92 treesize of output 112 [2024-11-19 01:12:55,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:12:55,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 107 treesize of output 115 [2024-11-19 01:12:55,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:12:55,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 107 treesize of output 115 [2024-11-19 01:12:56,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:12:56,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 117 treesize of output 49 [2024-11-19 01:12:56,213 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 668 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-19 01:12:56,214 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:12:56,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:12:56,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142669826] [2024-11-19 01:12:56,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142669826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:12:56,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:12:56,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 01:12:56,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069935804] [2024-11-19 01:12:56,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:12:56,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 01:12:56,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:12:56,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 01:12:56,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2024-11-19 01:12:56,216 INFO L87 Difference]: Start difference. First operand 203 states and 284 transitions. Second operand has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 15 states have internal predecessors, (79), 7 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) [2024-11-19 01:12:58,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:12:58,938 INFO L93 Difference]: Finished difference Result 374 states and 523 transitions. [2024-11-19 01:12:58,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 01:12:58,939 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 15 states have internal predecessors, (79), 7 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) Word has length 158 [2024-11-19 01:12:58,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:12:58,941 INFO L225 Difference]: With dead ends: 374 [2024-11-19 01:12:58,941 INFO L226 Difference]: Without dead ends: 256 [2024-11-19 01:12:58,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2024-11-19 01:12:58,942 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 353 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-19 01:12:58,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 504 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-19 01:12:58,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-19 01:12:58,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 203. [2024-11-19 01:12:58,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 159 states have (on average 1.2830188679245282) internal successors, (204), 159 states have internal predecessors, (204), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:12:58,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 284 transitions. [2024-11-19 01:12:58,984 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 284 transitions. Word has length 158 [2024-11-19 01:12:58,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:12:58,984 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 284 transitions. [2024-11-19 01:12:58,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 15 states have internal predecessors, (79), 7 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) [2024-11-19 01:12:58,985 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 284 transitions. [2024-11-19 01:12:58,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-19 01:12:58,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:12:58,988 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:12:58,997 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 (6)] Forceful destruction successful, exit code 0