./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-38.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-38.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 a66395e9b9e9d3ed5ab02e44ee80d513c62f29820549c5075cb60199ac316149 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:06:18,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:06:18,185 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:06:18,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:06:18,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:06:18,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:06:18,210 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:06:18,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:06:18,211 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:06:18,212 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:06:18,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:06:18,213 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:06:18,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:06:18,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:06:18,215 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:06:18,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:06:18,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:06:18,215 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:06:18,216 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:06:18,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:06:18,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:06:18,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:06:18,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:06:18,219 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:06:18,219 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:06:18,219 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:06:18,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:06:18,220 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:06:18,220 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:06:18,220 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:06:18,220 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:06:18,220 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:06:18,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:06:18,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:06:18,221 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:06:18,221 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:06:18,221 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:06:18,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:06:18,221 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:06:18,221 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:06:18,221 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:06:18,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:06:18,222 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 -> a66395e9b9e9d3ed5ab02e44ee80d513c62f29820549c5075cb60199ac316149 [2024-11-19 01:06:18,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:06:18,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:06:18,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:06:18,459 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:06:18,460 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:06:18,461 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-38.i [2024-11-19 01:06:19,634 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:06:19,800 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:06:19,800 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-38.i [2024-11-19 01:06:19,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce0805269/aca6fb3ef8864dec8c210afa4df1f01b/FLAGff046ce26 [2024-11-19 01:06:20,212 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce0805269/aca6fb3ef8864dec8c210afa4df1f01b [2024-11-19 01:06:20,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:06:20,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:06:20,217 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:06:20,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:06:20,223 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:06:20,224 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:06:20" (1/1) ... [2024-11-19 01:06:20,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68705197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:06:20, skipping insertion in model container [2024-11-19 01:06:20,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:06:20" (1/1) ... [2024-11-19 01:06:20,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:06:20,397 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-38.i[916,929] [2024-11-19 01:06:20,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:06:20,475 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:06:20,488 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-38.i[916,929] [2024-11-19 01:06:20,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:06:20,553 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:06:20,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:06:20 WrapperNode [2024-11-19 01:06:20,554 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:06:20,555 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:06:20,555 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:06:20,555 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:06:20,560 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:06:20" (1/1) ... [2024-11-19 01:06:20,574 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:06:20" (1/1) ... [2024-11-19 01:06:20,616 INFO L138 Inliner]: procedures = 30, calls = 177, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 495 [2024-11-19 01:06:20,617 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:06:20,617 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:06:20,617 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:06:20,617 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:06:20,626 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:06:20" (1/1) ... [2024-11-19 01:06:20,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:06:20" (1/1) ... [2024-11-19 01:06:20,635 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:06:20" (1/1) ... [2024-11-19 01:06:20,645 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-19 01:06:20,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:06:20" (1/1) ... [2024-11-19 01:06:20,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:06:20" (1/1) ... [2024-11-19 01:06:20,668 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:06:20" (1/1) ... [2024-11-19 01:06:20,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:06:20" (1/1) ... [2024-11-19 01:06:20,677 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:06:20" (1/1) ... [2024-11-19 01:06:20,681 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:06:20" (1/1) ... [2024-11-19 01:06:20,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:06:20,686 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:06:20,686 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:06:20,687 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:06:20,687 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:06:20" (1/1) ... [2024-11-19 01:06:20,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:06:20,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:06:20,719 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:06:20,721 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:06:20,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:06:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-19 01:06:20,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-19 01:06:20,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-19 01:06:20,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 01:06:20,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-19 01:06:20,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 01:06:20,761 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:06:20,761 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:06:20,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 01:06:20,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:06:20,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:06:20,850 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:06:20,851 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:06:21,345 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-19 01:06:21,346 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:06:21,359 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:06:21,359 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:06:21,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:06:21 BoogieIcfgContainer [2024-11-19 01:06:21,360 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:06:21,361 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:06:21,361 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:06:21,364 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:06:21,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:06:20" (1/3) ... [2024-11-19 01:06:21,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6447199d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:06:21, skipping insertion in model container [2024-11-19 01:06:21,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:06:20" (2/3) ... [2024-11-19 01:06:21,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6447199d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:06:21, skipping insertion in model container [2024-11-19 01:06:21,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:06:21" (3/3) ... [2024-11-19 01:06:21,365 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-38.i [2024-11-19 01:06:21,377 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:06:21,377 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:06:21,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:06:21,428 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;@95150ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:06:21,429 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:06:21,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 01:06:21,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-19 01:06:21,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:06:21,447 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:21,448 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:06:21,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:06:21,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1590797153, now seen corresponding path program 1 times [2024-11-19 01:06:21,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:06:21,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817583276] [2024-11-19 01:06:21,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:06:21,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:06:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:06:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2024-11-19 01:06:21,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:06:21,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817583276] [2024-11-19 01:06:21,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817583276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:06:21,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391573268] [2024-11-19 01:06:21,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:06:21,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:06:21,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:06:21,841 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:06:21,842 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:06:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:06:22,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:06:22,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:06:22,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2024-11-19 01:06:22,137 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:06:22,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391573268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:06:22,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:06:22,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 01:06:22,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531991767] [2024-11-19 01:06:22,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:06:22,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:06:22,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:06:22,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:06:22,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:06:22,167 INFO L87 Difference]: Start difference. First operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-19 01:06:22,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:06:22,201 INFO L93 Difference]: Finished difference Result 237 states and 376 transitions. [2024-11-19 01:06:22,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:06:22,203 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 184 [2024-11-19 01:06:22,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:06:22,210 INFO L225 Difference]: With dead ends: 237 [2024-11-19 01:06:22,210 INFO L226 Difference]: Without dead ends: 118 [2024-11-19 01:06:22,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 185 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:06:22,219 INFO L432 NwaCegarLoop]: 172 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, 172 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:06:22,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:06:22,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-19 01:06:22,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-19 01:06:22,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.3478260869565217) internal successors, (124), 92 states have internal predecessors, (124), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 01:06:22,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2024-11-19 01:06:22,253 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 184 [2024-11-19 01:06:22,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:06:22,253 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2024-11-19 01:06:22,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-19 01:06:22,254 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2024-11-19 01:06:22,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-19 01:06:22,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:06:22,256 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:22,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 01:06:22,457 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:06:22,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:06:22,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:06:22,458 INFO L85 PathProgramCache]: Analyzing trace with hash 798915143, now seen corresponding path program 1 times [2024-11-19 01:06:22,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:06:22,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499761145] [2024-11-19 01:06:22,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:06:22,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:06:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:06:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-19 01:06:22,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:06:22,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499761145] [2024-11-19 01:06:22,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499761145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:06:22,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:06:22,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:06:22,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105032339] [2024-11-19 01:06:22,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:06:22,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:06:22,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:06:22,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:06:22,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:06:22,794 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-19 01:06:22,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:06:22,836 INFO L93 Difference]: Finished difference Result 235 states and 344 transitions. [2024-11-19 01:06:22,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:06:22,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 184 [2024-11-19 01:06:22,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:06:22,838 INFO L225 Difference]: With dead ends: 235 [2024-11-19 01:06:22,838 INFO L226 Difference]: Without dead ends: 120 [2024-11-19 01:06:22,839 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:06:22,839 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:06:22,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 499 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:06:22,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-19 01:06:22,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-19 01:06:22,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 94 states have internal predecessors, (126), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 01:06:22,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 174 transitions. [2024-11-19 01:06:22,860 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 174 transitions. Word has length 184 [2024-11-19 01:06:22,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:06:22,862 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 174 transitions. [2024-11-19 01:06:22,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-19 01:06:22,862 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 174 transitions. [2024-11-19 01:06:22,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-19 01:06:22,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:06:22,866 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:22,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:06:22,866 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:06:22,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:06:22,867 INFO L85 PathProgramCache]: Analyzing trace with hash -928229819, now seen corresponding path program 1 times [2024-11-19 01:06:22,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:06:22,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386972916] [2024-11-19 01:06:22,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:06:22,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:06:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:06:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-19 01:06:23,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:06:23,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386972916] [2024-11-19 01:06:23,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386972916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:06:23,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:06:23,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:06:23,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468392841] [2024-11-19 01:06:23,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:06:23,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:06:23,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:06:23,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:06:23,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:06:23,107 INFO L87 Difference]: Start difference. First operand 120 states and 174 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-19 01:06:23,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:06:23,144 INFO L93 Difference]: Finished difference Result 240 states and 349 transitions. [2024-11-19 01:06:23,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:06:23,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 184 [2024-11-19 01:06:23,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:06:23,146 INFO L225 Difference]: With dead ends: 240 [2024-11-19 01:06:23,146 INFO L226 Difference]: Without dead ends: 123 [2024-11-19 01:06:23,147 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:06:23,147 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 1 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:06:23,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 496 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:06:23,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-19 01:06:23,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-11-19 01:06:23,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 96 states have internal predecessors, (128), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 01:06:23,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 176 transitions. [2024-11-19 01:06:23,162 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 176 transitions. Word has length 184 [2024-11-19 01:06:23,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:06:23,164 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 176 transitions. [2024-11-19 01:06:23,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-19 01:06:23,164 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 176 transitions. [2024-11-19 01:06:23,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-19 01:06:23,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:06:23,168 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:23,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:06:23,168 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:06:23,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:06:23,170 INFO L85 PathProgramCache]: Analyzing trace with hash -248171449, now seen corresponding path program 1 times [2024-11-19 01:06:23,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:06:23,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703051465] [2024-11-19 01:06:23,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:06:23,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:06:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:06:25,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-19 01:06:25,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:06:25,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703051465] [2024-11-19 01:06:25,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703051465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:06:25,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:06:25,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:06:25,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302008093] [2024-11-19 01:06:25,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:06:25,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:06:25,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:06:25,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:06:25,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:06:25,079 INFO L87 Difference]: Start difference. First operand 122 states and 176 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-19 01:06:25,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:06:25,516 INFO L93 Difference]: Finished difference Result 328 states and 474 transitions. [2024-11-19 01:06:25,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:06:25,517 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 184 [2024-11-19 01:06:25,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:06:25,519 INFO L225 Difference]: With dead ends: 328 [2024-11-19 01:06:25,519 INFO L226 Difference]: Without dead ends: 209 [2024-11-19 01:06:25,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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:06:25,520 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 197 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:06:25,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 419 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:06:25,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-19 01:06:25,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2024-11-19 01:06:25,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 167 states have (on average 1.341317365269461) internal successors, (224), 168 states have internal predecessors, (224), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 01:06:25,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 296 transitions. [2024-11-19 01:06:25,545 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 296 transitions. Word has length 184 [2024-11-19 01:06:25,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:06:25,546 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 296 transitions. [2024-11-19 01:06:25,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-19 01:06:25,546 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 296 transitions. [2024-11-19 01:06:25,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-19 01:06:25,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:06:25,550 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:25,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:06:25,551 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:06:25,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:06:25,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1745863815, now seen corresponding path program 1 times [2024-11-19 01:06:25,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:06:25,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428244971] [2024-11-19 01:06:25,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:06:25,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:06:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:06:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-19 01:06:28,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:06:28,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428244971] [2024-11-19 01:06:28,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428244971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:06:28,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:06:28,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 01:06:28,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205900825] [2024-11-19 01:06:28,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:06:28,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 01:06:28,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:06:28,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 01:06:28,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:06:28,350 INFO L87 Difference]: Start difference. First operand 206 states and 296 transitions. Second operand has 10 states, 8 states have (on average 8.375) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-19 01:06:29,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:06:29,562 INFO L93 Difference]: Finished difference Result 491 states and 704 transitions. [2024-11-19 01:06:29,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 01:06:29,563 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.375) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) Word has length 184 [2024-11-19 01:06:29,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:06:29,566 INFO L225 Difference]: With dead ends: 491 [2024-11-19 01:06:29,566 INFO L226 Difference]: Without dead ends: 288 [2024-11-19 01:06:29,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:06:29,569 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 50 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:06:29,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 970 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 01:06:29,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-19 01:06:29,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 228. [2024-11-19 01:06:29,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 189 states have (on average 1.343915343915344) internal successors, (254), 190 states have internal predecessors, (254), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 01:06:29,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 326 transitions. [2024-11-19 01:06:29,586 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 326 transitions. Word has length 184 [2024-11-19 01:06:29,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:06:29,586 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 326 transitions. [2024-11-19 01:06:29,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.375) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-19 01:06:29,587 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 326 transitions. [2024-11-19 01:06:29,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-19 01:06:29,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:06:29,589 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:29,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 01:06:29,590 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:06:29,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:06:29,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1159057801, now seen corresponding path program 1 times [2024-11-19 01:06:29,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:06:29,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514048329] [2024-11-19 01:06:29,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:06:29,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:06:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:06:31,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-19 01:06:31,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:06:31,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514048329] [2024-11-19 01:06:31,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514048329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:06:31,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:06:31,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 01:06:31,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755636442] [2024-11-19 01:06:31,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:06:31,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:06:31,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:06:31,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:06:31,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:06:31,812 INFO L87 Difference]: Start difference. First operand 228 states and 326 transitions. Second operand has 8 states, 5 states have (on average 13.4) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-19 01:06:32,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:06:32,508 INFO L93 Difference]: Finished difference Result 505 states and 722 transitions. [2024-11-19 01:06:32,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:06:32,509 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 13.4) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) Word has length 184 [2024-11-19 01:06:32,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:06:32,511 INFO L225 Difference]: With dead ends: 505 [2024-11-19 01:06:32,511 INFO L226 Difference]: Without dead ends: 280 [2024-11-19 01:06:32,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 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:06:32,513 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 48 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 01:06:32,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 900 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 01:06:32,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-19 01:06:32,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 228. [2024-11-19 01:06:32,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 189 states have (on average 1.3333333333333333) internal successors, (252), 190 states have internal predecessors, (252), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 01:06:32,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 324 transitions. [2024-11-19 01:06:32,528 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 324 transitions. Word has length 184 [2024-11-19 01:06:32,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:06:32,528 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 324 transitions. [2024-11-19 01:06:32,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 13.4) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-19 01:06:32,529 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 324 transitions. [2024-11-19 01:06:32,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-19 01:06:32,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:06:32,531 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:32,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:06:32,531 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:06:32,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:06:32,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1964718533, now seen corresponding path program 1 times [2024-11-19 01:06:32,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:06:32,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844458516] [2024-11-19 01:06:32,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:06:32,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:06:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:06:34,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-19 01:06:34,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:06:34,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844458516] [2024-11-19 01:06:34,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844458516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:06:34,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:06:34,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 01:06:34,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100080369] [2024-11-19 01:06:34,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:06:34,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:06:34,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:06:34,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:06:34,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:06:34,591 INFO L87 Difference]: Start difference. First operand 228 states and 324 transitions. Second operand has 8 states, 5 states have (on average 13.4) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-19 01:06:35,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:06:35,563 INFO L93 Difference]: Finished difference Result 505 states and 718 transitions. [2024-11-19 01:06:35,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:06:35,565 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 13.4) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) Word has length 184 [2024-11-19 01:06:35,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:06:35,567 INFO L225 Difference]: With dead ends: 505 [2024-11-19 01:06:35,567 INFO L226 Difference]: Without dead ends: 280 [2024-11-19 01:06:35,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 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:06:35,568 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 47 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 01:06:35,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 834 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 01:06:35,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-19 01:06:35,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 228. [2024-11-19 01:06:35,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 189 states have (on average 1.3227513227513228) internal successors, (250), 190 states have internal predecessors, (250), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 01:06:35,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 322 transitions. [2024-11-19 01:06:35,581 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 322 transitions. Word has length 184 [2024-11-19 01:06:35,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:06:35,582 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 322 transitions. [2024-11-19 01:06:35,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 13.4) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-19 01:06:35,583 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 322 transitions. [2024-11-19 01:06:35,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-19 01:06:35,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:06:35,584 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:35,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:06:35,585 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:06:35,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:06:35,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1377912519, now seen corresponding path program 1 times [2024-11-19 01:06:35,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:06:35,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42835113] [2024-11-19 01:06:35,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:06:35,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:06:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:06:39,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-19 01:06:39,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:06:39,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42835113] [2024-11-19 01:06:39,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42835113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:06:39,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:06:39,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 01:06:39,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022081701] [2024-11-19 01:06:39,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:06:39,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 01:06:39,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:06:39,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 01:06:39,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:06:39,824 INFO L87 Difference]: Start difference. First operand 228 states and 322 transitions. Second operand has 14 states, 9 states have (on average 7.444444444444445) internal successors, (67), 14 states have internal predecessors, (67), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-19 01:06:43,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:06:43,434 INFO L93 Difference]: Finished difference Result 517 states and 728 transitions. [2024-11-19 01:06:43,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 01:06:43,434 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 9 states have (on average 7.444444444444445) internal successors, (67), 14 states have internal predecessors, (67), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) Word has length 184 [2024-11-19 01:06:43,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:06:43,436 INFO L225 Difference]: With dead ends: 517 [2024-11-19 01:06:43,436 INFO L226 Difference]: Without dead ends: 292 [2024-11-19 01:06:43,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-11-19 01:06:43,437 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 52 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:06:43,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1682 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-19 01:06:43,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-19 01:06:43,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 288. [2024-11-19 01:06:43,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 243 states have (on average 1.3333333333333333) internal successors, (324), 246 states have internal predecessors, (324), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 01:06:43,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 404 transitions. [2024-11-19 01:06:43,448 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 404 transitions. Word has length 184 [2024-11-19 01:06:43,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:06:43,449 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 404 transitions. [2024-11-19 01:06:43,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 9 states have (on average 7.444444444444445) internal successors, (67), 14 states have internal predecessors, (67), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-19 01:06:43,449 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 404 transitions. [2024-11-19 01:06:43,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-19 01:06:43,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:06:43,450 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:43,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 01:06:43,451 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:06:43,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:06:43,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1715445312, now seen corresponding path program 1 times [2024-11-19 01:06:43,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:06:43,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909427018] [2024-11-19 01:06:43,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:06:43,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:06:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:06:45,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 18 proven. 114 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2024-11-19 01:06:45,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:06:45,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909427018] [2024-11-19 01:06:45,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909427018] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:06:45,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435238149] [2024-11-19 01:06:45,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:06:45,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:06:45,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:06:45,819 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:06:45,822 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:06:46,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:06:46,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-19 01:06:46,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:06:46,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 01:06:46,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 01:06:46,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:06:46,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-11-19 01:06:46,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:06:46,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-11-19 01:06:46,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:06:46,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-11-19 01:06:46,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:06:46,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-11-19 01:06:46,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:06:46,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-11-19 01:06:46,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:06:46,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-11-19 01:06:46,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:06:46,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-11-19 01:06:46,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:06:46,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-11-19 01:06:47,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:06:47,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-11-19 01:06:47,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:06:47,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-11-19 01:06:47,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:06:47,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-11-19 01:06:47,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:06:47,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2024-11-19 01:06:47,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 344 proven. 120 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-11-19 01:06:47,318 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:06:47,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 12 proven. 123 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-19 01:06:47,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435238149] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:06:47,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:06:47,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 32 [2024-11-19 01:06:47,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53246633] [2024-11-19 01:06:47,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:06:47,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 01:06:47,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:06:47,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 01:06:47,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2024-11-19 01:06:47,842 INFO L87 Difference]: Start difference. First operand 288 states and 404 transitions. Second operand has 32 states, 25 states have (on average 7.0) internal successors, (175), 32 states have internal predecessors, (175), 14 states have call successors, (72), 4 states have call predecessors, (72), 8 states have return successors, (72), 8 states have call predecessors, (72), 14 states have call successors, (72) [2024-11-19 01:06:49,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:06:49,959 INFO L93 Difference]: Finished difference Result 621 states and 842 transitions. [2024-11-19 01:06:49,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-19 01:06:49,960 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 25 states have (on average 7.0) internal successors, (175), 32 states have internal predecessors, (175), 14 states have call successors, (72), 4 states have call predecessors, (72), 8 states have return successors, (72), 8 states have call predecessors, (72), 14 states have call successors, (72) Word has length 186 [2024-11-19 01:06:49,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:06:49,962 INFO L225 Difference]: With dead ends: 621 [2024-11-19 01:06:49,962 INFO L226 Difference]: Without dead ends: 336 [2024-11-19 01:06:49,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=590, Invalid=2602, Unknown=0, NotChecked=0, Total=3192 [2024-11-19 01:06:49,964 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 885 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:06:49,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 710 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1446 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 01:06:49,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-19 01:06:49,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 252. [2024-11-19 01:06:49,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 205 states have (on average 1.278048780487805) internal successors, (262), 206 states have internal predecessors, (262), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 01:06:49,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 334 transitions. [2024-11-19 01:06:49,977 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 334 transitions. Word has length 186 [2024-11-19 01:06:49,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:06:49,978 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 334 transitions. [2024-11-19 01:06:49,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 25 states have (on average 7.0) internal successors, (175), 32 states have internal predecessors, (175), 14 states have call successors, (72), 4 states have call predecessors, (72), 8 states have return successors, (72), 8 states have call predecessors, (72), 14 states have call successors, (72) [2024-11-19 01:06:49,978 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 334 transitions. [2024-11-19 01:06:49,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-19 01:06:49,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:06:49,979 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:49,994 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:06:50,179 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,SelfDestructingSolverStorable8 [2024-11-19 01:06:50,180 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:06:50,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:06:50,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1496590594, now seen corresponding path program 1 times [2024-11-19 01:06:50,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:06:50,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024529545] [2024-11-19 01:06:50,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:06:50,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:06:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:06:52,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-19 01:06:52,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:06:52,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024529545] [2024-11-19 01:06:52,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024529545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:06:52,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:06:52,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 01:06:52,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17821168] [2024-11-19 01:06:52,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:06:52,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 01:06:52,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:06:52,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 01:06:52,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:06:52,231 INFO L87 Difference]: Start difference. First operand 252 states and 334 transitions. Second operand has 10 states, 8 states have (on average 8.625) internal successors, (69), 10 states have internal predecessors, (69), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-19 01:06:53,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:06:53,029 INFO L93 Difference]: Finished difference Result 503 states and 667 transitions. [2024-11-19 01:06:53,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 01:06:53,031 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.625) internal successors, (69), 10 states have internal predecessors, (69), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) Word has length 186 [2024-11-19 01:06:53,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:06:53,032 INFO L225 Difference]: With dead ends: 503 [2024-11-19 01:06:53,032 INFO L226 Difference]: Without dead ends: 254 [2024-11-19 01:06:53,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:06:53,033 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 46 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:06:53,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 818 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 01:06:53,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-19 01:06:53,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2024-11-19 01:06:53,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 205 states have (on average 1.2682926829268293) internal successors, (260), 206 states have internal predecessors, (260), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 01:06:53,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 332 transitions. [2024-11-19 01:06:53,048 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 332 transitions. Word has length 186 [2024-11-19 01:06:53,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:06:53,048 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 332 transitions. [2024-11-19 01:06:53,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.625) internal successors, (69), 10 states have internal predecessors, (69), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-19 01:06:53,049 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 332 transitions. [2024-11-19 01:06:53,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-19 01:06:53,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:06:53,050 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:53,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 01:06:53,050 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:06:53,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:06:53,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1238425156, now seen corresponding path program 1 times [2024-11-19 01:06:53,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:06:53,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327390083] [2024-11-19 01:06:53,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:06:53,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:06:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:06:53,146 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:06:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:06:53,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:06:53,275 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:06:53,276 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 01:06:53,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 01:06:53,282 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:06:53,342 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:06:53,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:06:53 BoogieIcfgContainer [2024-11-19 01:06:53,344 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:06:53,345 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:06:53,345 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:06:53,345 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:06:53,346 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:06:21" (3/4) ... [2024-11-19 01:06:53,347 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 01:06:53,348 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:06:53,349 INFO L158 Benchmark]: Toolchain (without parser) took 33132.69ms. Allocated memory was 151.0MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 114.8MB in the beginning and 985.7MB in the end (delta: -870.9MB). Peak memory consumption was 534.2MB. Max. memory is 16.1GB. [2024-11-19 01:06:53,349 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:06:53,349 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.24ms. Allocated memory is still 151.0MB. Free memory was 114.8MB in the beginning and 94.5MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-19 01:06:53,349 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.97ms. Allocated memory is still 151.0MB. Free memory was 94.5MB in the beginning and 89.7MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:06:53,350 INFO L158 Benchmark]: Boogie Preprocessor took 68.50ms. Allocated memory is still 151.0MB. Free memory was 89.7MB in the beginning and 85.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:06:53,350 INFO L158 Benchmark]: RCFGBuilder took 673.66ms. Allocated memory is still 151.0MB. Free memory was 85.5MB in the beginning and 49.8MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-19 01:06:53,352 INFO L158 Benchmark]: TraceAbstraction took 31983.38ms. Allocated memory was 151.0MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 49.1MB in the beginning and 985.7MB in the end (delta: -936.6MB). Peak memory consumption was 467.1MB. Max. memory is 16.1GB. [2024-11-19 01:06:53,352 INFO L158 Benchmark]: Witness Printer took 3.24ms. Allocated memory is still 1.6GB. Free memory is still 985.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:06:53,353 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 109.1MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.24ms. Allocated memory is still 151.0MB. Free memory was 114.8MB in the beginning and 94.5MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.97ms. Allocated memory is still 151.0MB. Free memory was 94.5MB in the beginning and 89.7MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.50ms. Allocated memory is still 151.0MB. Free memory was 89.7MB in the beginning and 85.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 673.66ms. Allocated memory is still 151.0MB. Free memory was 85.5MB in the beginning and 49.8MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 31983.38ms. Allocated memory was 151.0MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 49.1MB in the beginning and 985.7MB in the end (delta: -936.6MB). Peak memory consumption was 467.1MB. Max. memory is 16.1GB. * Witness Printer took 3.24ms. Allocated memory is still 1.6GB. Free memory is still 985.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryArithmeticDOUBLEoperation at line 73. Possible FailurePath: [L43] unsigned char isInitial = 0; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 0, 56507, 52902, 8, 16, 1771558822, 7.25, 31.2, 32.71, 0.4, 7.75, 32, 0, 20114, 32, 16773, 25, 0, 1 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] FCALL updateLastVariables() [L139] CALL updateVariables() [L89] WrapperStruct00.var_1_2 = __VERIFIER_nondet_ushort() [L90] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ushort() [L93] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ushort() [L96] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ulong() [L99] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 1610612735) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 1610612735) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L102] EXPR WrapperStruct00.var_1_8 [L102] EXPR WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_8 [L102] EXPR WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR (WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L103] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L104] EXPR WrapperStruct00.var_1_9 [L104] EXPR WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L104] EXPR WrapperStruct00.var_1_9 [L104] EXPR WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR (WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] WrapperStruct00.var_1_10 = __VERIFIER_nondet_double() [L106] EXPR WrapperStruct00.var_1_10 [L106] EXPR WrapperStruct00.var_1_10 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L106] EXPR WrapperStruct00.var_1_10 [L106] EXPR WrapperStruct00.var_1_10 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_10 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L108] EXPR WrapperStruct00.var_1_11 [L108] EXPR WrapperStruct00.var_1_11 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L108] EXPR WrapperStruct00.var_1_11 [L108] EXPR WrapperStruct00.var_1_11 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR (WrapperStruct00.var_1_11 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L110] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L112] WrapperStruct00.var_1_14 = __VERIFIER_nondet_ushort() [L113] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] WrapperStruct00.var_1_15 = __VERIFIER_nondet_ushort() [L116] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L117] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] WrapperStruct00.var_1_16 = __VERIFIER_nondet_ushort() [L119] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 16384) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 16384) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L121] WrapperStruct00.var_1_18 = __VERIFIER_nondet_uchar() [L122] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L123] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L124] WrapperStruct00.var_1_19 = __VERIFIER_nondet_uchar() [L125] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L126] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L139] RET updateVariables() [L140] CALL step() [L68] EXPR WrapperStruct00.var_1_2 [L68] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L68] EXPR ((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) [L68] EXPR WrapperStruct00.var_1_2 [L68] EXPR ((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1] [L68] EXPR WrapperStruct00.var_1_4 [L68] WrapperStruct00.var_1_1 = (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4) [L69] EXPR WrapperStruct00.var_1_2 [L69] unsigned short int stepLocal_0 = WrapperStruct00.var_1_2; [L70] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=-2] [L70] COND FALSE !(WrapperStruct00.var_1_4 > stepLocal_0) [L73] EXPR WrapperStruct00.var_1_8 [L73] EXPR WrapperStruct00.var_1_9 [L73] EXPR WrapperStruct00.var_1_10 [L73] EXPR WrapperStruct00.var_1_11 [L73] WrapperStruct00.var_1_7 = (WrapperStruct00.var_1_8 + (WrapperStruct00.var_1_9 + (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11))) [L74] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L74] COND TRUE ! WrapperStruct00.var_1_13 [L75] EXPR WrapperStruct00.var_1_3 [L75] EXPR WrapperStruct00.var_1_14 [L75] EXPR WrapperStruct00.var_1_15 [L75] WrapperStruct00.var_1_12 = (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)) [L83] EXPR WrapperStruct00.var_1_19 [L83] unsigned char stepLocal_1 = WrapperStruct00.var_1_19; [L84] EXPR WrapperStruct00.var_1_13 [L84] EXPR WrapperStruct00.var_1_13 && WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=-256] [L84] COND FALSE !((WrapperStruct00.var_1_13 && WrapperStruct00.var_1_18) && stepLocal_1) [L140] RET step() [L141] CALL, EXPR property() [L131] EXPR WrapperStruct00.var_1_1 [L131] EXPR WrapperStruct00.var_1_2 [L131] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) [L131] EXPR WrapperStruct00.var_1_2 [L131] EXPR ((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR WrapperStruct00.var_1_4 [L131] EXPR (WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1) [L131] EXPR WrapperStruct00.var_1_4 [L131] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1)) && (WrapperStruct00.var_1_7 == ((double) (WrapperStruct00.var_1_8 + (WrapperStruct00.var_1_9 + (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11))))) [L131] EXPR WrapperStruct00.var_1_7 [L131] EXPR WrapperStruct00.var_1_8 [L131] EXPR WrapperStruct00.var_1_9 [L131] EXPR WrapperStruct00.var_1_10 [L131] EXPR WrapperStruct00.var_1_11 [L131] EXPR ((WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1)) && (WrapperStruct00.var_1_7 == ((double) (WrapperStruct00.var_1_8 + (WrapperStruct00.var_1_9 + (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (((WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1)) && (WrapperStruct00.var_1_7 == ((double) (WrapperStruct00.var_1_8 + (WrapperStruct00.var_1_9 + (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11)))))) && ((! WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((27636 + WrapperStruct00.var_1_16) - (((((16853 - 10)) > (WrapperStruct00.var_1_14)) ? ((16853 - 10)) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_3)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((((WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1)) && (WrapperStruct00.var_1_7 == ((double) (WrapperStruct00.var_1_8 + (WrapperStruct00.var_1_9 + (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11)))))) && ((! WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((27636 + WrapperStruct00.var_1_16) - (((((16853 - 10)) > (WrapperStruct00.var_1_14)) ? ((16853 - 10)) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_3))))) && (((WrapperStruct00.var_1_13 && WrapperStruct00.var_1_18) && WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_17 == ((unsigned short int) (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_14))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L131-L132] return ((((WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1)) && (WrapperStruct00.var_1_7 == ((double) (WrapperStruct00.var_1_8 + (WrapperStruct00.var_1_9 + (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11)))))) && ((! WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((27636 + WrapperStruct00.var_1_16) - (((((16853 - 10)) > (WrapperStruct00.var_1_14)) ? ((16853 - 10)) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_3))))) && (((WrapperStruct00.var_1_13 && WrapperStruct00.var_1_18) && WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_17 == ((unsigned short int) (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_14))) : 1) ; [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.9s, OverallIterations: 11, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1342 SdHoareTripleChecker+Valid, 8.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1326 mSDsluCounter, 7500 SdHoareTripleChecker+Invalid, 8.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5980 mSDsCounter, 256 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5088 IncrementalHoareTripleChecker+Invalid, 5344 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 256 mSolverCounterUnsat, 1520 mSDtfsCounter, 5088 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 799 GetRequests, 683 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=288occurred in iteration=8, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 258 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 19.0s InterpolantComputationTime, 2400 NumberOfCodeBlocks, 2400 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2387 ConstructedInterpolants, 0 QuantifiedInterpolants, 10250 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1324 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 13949/14352 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:06:53,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-38.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 a66395e9b9e9d3ed5ab02e44ee80d513c62f29820549c5075cb60199ac316149 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:06:55,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:06:55,309 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 01:06:55,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:06:55,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:06:55,339 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:06:55,340 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:06:55,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:06:55,341 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:06:55,341 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:06:55,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:06:55,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:06:55,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:06:55,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:06:55,344 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:06:55,344 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:06:55,345 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:06:55,345 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:06:55,345 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:06:55,347 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:06:55,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:06:55,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:06:55,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:06:55,348 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 01:06:55,348 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 01:06:55,348 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:06:55,348 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 01:06:55,349 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:06:55,349 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:06:55,349 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:06:55,349 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:06:55,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:06:55,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:06:55,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:06:55,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:06:55,350 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:06:55,350 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:06:55,350 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:06:55,350 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 01:06:55,351 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 01:06:55,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:06:55,353 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:06:55,353 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:06:55,353 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:06:55,354 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 -> a66395e9b9e9d3ed5ab02e44ee80d513c62f29820549c5075cb60199ac316149 [2024-11-19 01:06:55,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:06:55,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:06:55,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:06:55,644 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:06:55,644 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:06:55,645 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-38.i [2024-11-19 01:06:56,890 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:06:57,082 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:06:57,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-38.i [2024-11-19 01:06:57,092 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79dafecae/e5b254b1955f46338670170863f4b481/FLAGf9710ffc3 [2024-11-19 01:06:57,468 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79dafecae/e5b254b1955f46338670170863f4b481 [2024-11-19 01:06:57,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:06:57,471 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:06:57,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:06:57,472 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:06:57,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:06:57,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:06:57" (1/1) ... [2024-11-19 01:06:57,476 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d729c6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:06:57, skipping insertion in model container [2024-11-19 01:06:57,476 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:06:57" (1/1) ... [2024-11-19 01:06:57,493 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:06:57,635 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-38.i[916,929] [2024-11-19 01:06:57,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:06:57,704 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:06:57,713 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-38.i[916,929] [2024-11-19 01:06:57,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:06:57,768 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:06:57,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:06:57 WrapperNode [2024-11-19 01:06:57,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:06:57,769 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:06:57,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:06:57,770 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:06:57,775 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:06:57" (1/1) ... [2024-11-19 01:06:57,791 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:06:57" (1/1) ... [2024-11-19 01:06:57,820 INFO L138 Inliner]: procedures = 37, calls = 177, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 494 [2024-11-19 01:06:57,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:06:57,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:06:57,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:06:57,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:06:57,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:06:57" (1/1) ... [2024-11-19 01:06:57,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:06:57" (1/1) ... [2024-11-19 01:06:57,841 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:06:57" (1/1) ... [2024-11-19 01:06:57,859 INFO L175 MemorySlicer]: Split 142 memory accesses to 2 slices as follows [2, 140]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 41 writes are split as follows [0, 41]. [2024-11-19 01:06:57,859 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:06:57" (1/1) ... [2024-11-19 01:06:57,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:06:57" (1/1) ... [2024-11-19 01:06:57,875 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:06:57" (1/1) ... [2024-11-19 01:06:57,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:06:57" (1/1) ... [2024-11-19 01:06:57,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:06:57" (1/1) ... [2024-11-19 01:06:57,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:06:57" (1/1) ... [2024-11-19 01:06:57,886 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:06:57,887 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:06:57,887 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:06:57,887 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:06:57,888 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:06:57" (1/1) ... [2024-11-19 01:06:57,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:06:57,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:06:57,921 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:06:57,926 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:06:57,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:06:57,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 01:06:57,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 01:06:57,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-19 01:06:57,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-19 01:06:57,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 01:06:57,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 01:06:57,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 01:06:57,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 01:06:57,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 01:06:57,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 01:06:57,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 01:06:57,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 01:06:57,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 01:06:57,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 01:06:57,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-19 01:06:57,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-19 01:06:57,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-19 01:06:57,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-19 01:06:57,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-19 01:06:57,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-19 01:06:57,964 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:06:57,964 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:06:57,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:06:57,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:06:57,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 01:06:57,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 01:06:57,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 01:06:57,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 01:06:57,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 01:06:57,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 01:06:58,118 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:06:58,119 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:07:02,832 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-19 01:07:02,832 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:07:02,846 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:07:02,846 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:07:02,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:07:02 BoogieIcfgContainer [2024-11-19 01:07:02,847 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:07:02,848 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:07:02,848 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:07:02,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:07:02,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:06:57" (1/3) ... [2024-11-19 01:07:02,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab4652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:07:02, skipping insertion in model container [2024-11-19 01:07:02,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:06:57" (2/3) ... [2024-11-19 01:07:02,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab4652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:07:02, skipping insertion in model container [2024-11-19 01:07:02,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:07:02" (3/3) ... [2024-11-19 01:07:02,853 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-38.i [2024-11-19 01:07:02,866 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:07:02,866 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:07:02,922 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:07:02,927 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;@234b86cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:07:02,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:07:02,930 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 01:07:02,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-19 01:07:02,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:02,941 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:02,941 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:02,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:02,945 INFO L85 PathProgramCache]: Analyzing trace with hash 695157323, now seen corresponding path program 1 times [2024-11-19 01:07:02,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:07:02,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634762694] [2024-11-19 01:07:02,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:02,955 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:07:02,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:07:02,958 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:07:02,959 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:07:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:03,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:07:03,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:07:03,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 818 trivial. 0 not checked. [2024-11-19 01:07:03,475 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:07:03,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:07:03,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634762694] [2024-11-19 01:07:03,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634762694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:03,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:07:03,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:07:03,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389014754] [2024-11-19 01:07:03,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:03,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:07:03,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:07:03,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:07:03,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:07:03,503 INFO L87 Difference]: Start difference. First operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-19 01:07:03,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:03,542 INFO L93 Difference]: Finished difference Result 237 states and 376 transitions. [2024-11-19 01:07:03,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:07:03,545 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 184 [2024-11-19 01:07:03,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:03,552 INFO L225 Difference]: With dead ends: 237 [2024-11-19 01:07:03,552 INFO L226 Difference]: Without dead ends: 118 [2024-11-19 01:07:03,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 183 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:07:03,562 INFO L432 NwaCegarLoop]: 172 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, 172 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:07:03,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:07:03,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-19 01:07:03,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-19 01:07:03,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.3478260869565217) internal successors, (124), 92 states have internal predecessors, (124), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 01:07:03,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2024-11-19 01:07:03,615 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 184 [2024-11-19 01:07:03,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:03,616 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2024-11-19 01:07:03,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-19 01:07:03,617 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2024-11-19 01:07:03,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-19 01:07:03,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:03,620 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:03,635 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:07:03,821 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:07:03,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:03,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:03,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1210097677, now seen corresponding path program 1 times [2024-11-19 01:07:03,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:07:03,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370029866] [2024-11-19 01:07:03,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:03,823 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:07:03,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:07:03,826 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:07:03,827 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:07:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:04,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-19 01:07:04,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:07:04,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 01:07:04,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-19 01:07:04,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:04,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2024-11-19 01:07:05,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:05,475 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 63 treesize of output 47 [2024-11-19 01:07:05,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:05,756 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 74 treesize of output 47 [2024-11-19 01:07:05,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:05,997 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 64 treesize of output 67 [2024-11-19 01:07:09,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:09,537 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 83 treesize of output 68 [2024-11-19 01:07:09,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:09,835 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 73 treesize of output 88 [2024-11-19 01:07:15,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:15,969 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 87 treesize of output 104 [2024-11-19 01:07:16,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:16,648 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 97 treesize of output 117 [2024-11-19 01:07:17,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:17,301 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 130 [2024-11-19 01:07:18,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:18,017 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 122 treesize of output 133 [2024-11-19 01:07:18,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:18,499 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 122 treesize of output 133 [2024-11-19 01:07:18,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:18,987 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 122 treesize of output 133 [2024-11-19 01:07:19,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 135 [2024-11-19 01:07:19,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:19,919 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 131 treesize of output 53 [2024-11-19 01:07:19,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 789 proven. 177 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-19 01:07:19,997 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:07:20,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:07:20,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370029866] [2024-11-19 01:07:20,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370029866] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:07:20,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1782091019] [2024-11-19 01:07:20,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:20,985 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 01:07:20,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 01:07:20,987 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 01:07:20,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-19 01:07:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:22,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 01:07:22,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:07:22,706 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 15 treesize of output 1 [2024-11-19 01:07:22,723 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 15 treesize of output 1 [2024-11-19 01:07:22,744 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 15 treesize of output 1 [2024-11-19 01:07:22,766 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 12 treesize of output 8 [2024-11-19 01:07:22,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-19 01:07:23,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:23,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2024-11-19 01:07:23,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:23,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 34 [2024-11-19 01:07:23,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:23,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 58 treesize of output 72 [2024-11-19 01:07:23,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 36 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2024-11-19 01:07:23,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:23,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 77 treesize of output 86 [2024-11-19 01:07:24,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2024-11-19 01:07:24,171 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:07:24,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1782091019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:24,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:07:24,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [23] total 31 [2024-11-19 01:07:24,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832768645] [2024-11-19 01:07:24,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:24,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 01:07:24,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:07:24,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 01:07:24,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1283, Unknown=3, NotChecked=0, Total=1560 [2024-11-19 01:07:24,174 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 9 states have internal predecessors, (76), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-19 01:07:26,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 01:07:31,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]