./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.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_fillercode_fillercodestructure_filler-pr-ci_file-42.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 63de2d71d444749da4273a6a58c4b105d09e2f11c04911b2ed4cbf82a61c5b48 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 20:44:54,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 20:44:54,895 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 20:44:54,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 20:44:54,904 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 20:44:54,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 20:44:54,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 20:44:54,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 20:44:54,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 20:44:54,941 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 20:44:54,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 20:44:54,943 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 20:44:54,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 20:44:54,944 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 20:44:54,944 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 20:44:54,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 20:44:54,945 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 20:44:54,945 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 20:44:54,946 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 20:44:54,946 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 20:44:54,946 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 20:44:54,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 20:44:54,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 20:44:54,951 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 20:44:54,951 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 20:44:54,951 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 20:44:54,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 20:44:54,951 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 20:44:54,952 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 20:44:54,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 20:44:54,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 20:44:54,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 20:44:54,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 20:44:54,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 20:44:54,954 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 20:44:54,955 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 20:44:54,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 20:44:54,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 20:44:54,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 20:44:54,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 20:44:54,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 20:44:54,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 20:44:54,957 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 -> 63de2d71d444749da4273a6a58c4b105d09e2f11c04911b2ed4cbf82a61c5b48 [2024-11-18 20:44:55,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 20:44:55,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 20:44:55,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 20:44:55,255 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 20:44:55,256 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 20:44:55,258 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i [2024-11-18 20:44:56,728 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 20:44:56,970 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 20:44:56,971 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i [2024-11-18 20:44:56,979 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63d18b75d/4753d313df95402ca6366285a722446b/FLAGae93b8355 [2024-11-18 20:44:56,995 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63d18b75d/4753d313df95402ca6366285a722446b [2024-11-18 20:44:56,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 20:44:56,998 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 20:44:56,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 20:44:57,000 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 20:44:57,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 20:44:57,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:44:56" (1/1) ... [2024-11-18 20:44:57,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b7cf45d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:44:57, skipping insertion in model container [2024-11-18 20:44:57,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:44:56" (1/1) ... [2024-11-18 20:44:57,037 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 20:44:57,191 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_fillercode_fillercodestructure_filler-pr-ci_file-42.i[919,932] [2024-11-18 20:44:57,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 20:44:57,280 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 20:44:57,289 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_fillercode_fillercodestructure_filler-pr-ci_file-42.i[919,932] [2024-11-18 20:44:57,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 20:44:57,344 INFO L204 MainTranslator]: Completed translation [2024-11-18 20:44:57,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:44:57 WrapperNode [2024-11-18 20:44:57,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 20:44:57,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 20:44:57,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 20:44:57,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 20:44:57,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:44:57" (1/1) ... [2024-11-18 20:44:57,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:44:57" (1/1) ... [2024-11-18 20:44:57,408 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171 [2024-11-18 20:44:57,409 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 20:44:57,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 20:44:57,410 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 20:44:57,410 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 20:44:57,425 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:44:57" (1/1) ... [2024-11-18 20:44:57,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:44:57" (1/1) ... [2024-11-18 20:44:57,435 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:44:57" (1/1) ... [2024-11-18 20:44:57,458 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 20:44:57,458 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:44:57" (1/1) ... [2024-11-18 20:44:57,459 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:44:57" (1/1) ... [2024-11-18 20:44:57,473 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:44:57" (1/1) ... [2024-11-18 20:44:57,482 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:44:57" (1/1) ... [2024-11-18 20:44:57,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:44:57" (1/1) ... [2024-11-18 20:44:57,492 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:44:57" (1/1) ... [2024-11-18 20:44:57,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 20:44:57,503 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 20:44:57,504 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 20:44:57,504 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 20:44:57,505 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:44:57" (1/1) ... [2024-11-18 20:44:57,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 20:44:57,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:44:57,540 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-18 20:44:57,543 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-18 20:44:57,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 20:44:57,592 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 20:44:57,593 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 20:44:57,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 20:44:57,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 20:44:57,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 20:44:57,680 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 20:44:57,682 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 20:44:58,155 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-18 20:44:58,156 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 20:44:58,171 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 20:44:58,172 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 20:44:58,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:44:58 BoogieIcfgContainer [2024-11-18 20:44:58,172 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 20:44:58,175 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 20:44:58,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 20:44:58,179 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 20:44:58,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:44:56" (1/3) ... [2024-11-18 20:44:58,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25601ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:44:58, skipping insertion in model container [2024-11-18 20:44:58,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:44:57" (2/3) ... [2024-11-18 20:44:58,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25601ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:44:58, skipping insertion in model container [2024-11-18 20:44:58,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:44:58" (3/3) ... [2024-11-18 20:44:58,184 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i [2024-11-18 20:44:58,202 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 20:44:58,202 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 20:44:58,264 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 20:44:58,274 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;@444fe5b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 20:44:58,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 20:44:58,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 20:44:58,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-18 20:44:58,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:44:58,293 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:44:58,294 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:44:58,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:44:58,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1129688923, now seen corresponding path program 1 times [2024-11-18 20:44:58,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:44:58,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111197338] [2024-11-18 20:44:58,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:44:58,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:44:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:44:58,671 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-11-18 20:44:58,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:44:58,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111197338] [2024-11-18 20:44:58,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111197338] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 20:44:58,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029775300] [2024-11-18 20:44:58,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:44:58,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:44:58,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:44:58,676 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-18 20:44:58,677 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-18 20:44:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:44:58,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 20:44:58,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:44:58,949 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-11-18 20:44:58,951 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 20:44:58,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029775300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:44:58,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 20:44:58,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 20:44:58,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080954945] [2024-11-18 20:44:58,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:44:58,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 20:44:58,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:44:58,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 20:44:58,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 20:44:58,990 INFO L87 Difference]: Start difference. First operand has 72 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 20:44:59,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:44:59,015 INFO L93 Difference]: Finished difference Result 136 states and 236 transitions. [2024-11-18 20:44:59,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 20:44:59,018 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2024-11-18 20:44:59,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:44:59,024 INFO L225 Difference]: With dead ends: 136 [2024-11-18 20:44:59,024 INFO L226 Difference]: Without dead ends: 67 [2024-11-18 20:44:59,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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-18 20:44:59,030 INFO L432 NwaCegarLoop]: 103 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, 103 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-18 20:44:59,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 20:44:59,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-18 20:44:59,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-18 20:44:59,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.425531914893617) internal successors, (67), 47 states have internal predecessors, (67), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 20:44:59,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 103 transitions. [2024-11-18 20:44:59,073 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 103 transitions. Word has length 129 [2024-11-18 20:44:59,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:44:59,073 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 103 transitions. [2024-11-18 20:44:59,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 20:44:59,074 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 103 transitions. [2024-11-18 20:44:59,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-18 20:44:59,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:44:59,077 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:44:59,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 20:44:59,277 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-18 20:44:59,278 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:44:59,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:44:59,279 INFO L85 PathProgramCache]: Analyzing trace with hash 590839201, now seen corresponding path program 1 times [2024-11-18 20:44:59,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:44:59,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672589694] [2024-11-18 20:44:59,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:44:59,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:44:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:44:59,805 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 20:44:59,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:44:59,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672589694] [2024-11-18 20:44:59,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672589694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:44:59,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:44:59,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 20:44:59,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211324484] [2024-11-18 20:44:59,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:44:59,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 20:44:59,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:44:59,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 20:44:59,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 20:44:59,812 INFO L87 Difference]: Start difference. First operand 67 states and 103 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:44:59,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:44:59,978 INFO L93 Difference]: Finished difference Result 196 states and 304 transitions. [2024-11-18 20:44:59,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 20:44:59,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2024-11-18 20:44:59,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:45:00,004 INFO L225 Difference]: With dead ends: 196 [2024-11-18 20:45:00,005 INFO L226 Difference]: Without dead ends: 132 [2024-11-18 20:45:00,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 20:45:00,008 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 107 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 20:45:00,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 291 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 20:45:00,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-18 20:45:00,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 102. [2024-11-18 20:45:00,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-18 20:45:00,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2024-11-18 20:45:00,046 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 129 [2024-11-18 20:45:00,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:45:00,047 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2024-11-18 20:45:00,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:45:00,048 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2024-11-18 20:45:00,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-18 20:45:00,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:45:00,052 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:45:00,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 20:45:00,052 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:45:00,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:45:00,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1528368339, now seen corresponding path program 1 times [2024-11-18 20:45:00,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:45:00,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234112446] [2024-11-18 20:45:00,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:45:00,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:45:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:45:00,428 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 20:45:00,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:45:00,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234112446] [2024-11-18 20:45:00,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234112446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:45:00,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:45:00,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 20:45:00,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064964035] [2024-11-18 20:45:00,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:45:00,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 20:45:00,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:45:00,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 20:45:00,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 20:45:00,434 INFO L87 Difference]: Start difference. First operand 102 states and 155 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:45:00,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:45:00,612 INFO L93 Difference]: Finished difference Result 230 states and 355 transitions. [2024-11-18 20:45:00,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 20:45:00,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-18 20:45:00,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:45:00,617 INFO L225 Difference]: With dead ends: 230 [2024-11-18 20:45:00,620 INFO L226 Difference]: Without dead ends: 166 [2024-11-18 20:45:00,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 20:45:00,622 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 54 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 20:45:00,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 226 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 20:45:00,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-18 20:45:00,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2024-11-18 20:45:00,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 106 states have (on average 1.3584905660377358) internal successors, (144), 106 states have internal predecessors, (144), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-18 20:45:00,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 252 transitions. [2024-11-18 20:45:00,664 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 252 transitions. Word has length 130 [2024-11-18 20:45:00,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:45:00,665 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 252 transitions. [2024-11-18 20:45:00,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:45:00,666 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 252 transitions. [2024-11-18 20:45:00,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-18 20:45:00,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:45:00,669 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:45:00,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 20:45:00,670 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:45:00,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:45:00,672 INFO L85 PathProgramCache]: Analyzing trace with hash -827303761, now seen corresponding path program 1 times [2024-11-18 20:45:00,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:45:00,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504535856] [2024-11-18 20:45:00,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:45:00,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:45:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:45:01,005 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 20:45:01,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:45:01,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504535856] [2024-11-18 20:45:01,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504535856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:45:01,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:45:01,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 20:45:01,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140794920] [2024-11-18 20:45:01,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:45:01,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 20:45:01,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:45:01,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 20:45:01,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 20:45:01,009 INFO L87 Difference]: Start difference. First operand 164 states and 252 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:45:01,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:45:01,317 INFO L93 Difference]: Finished difference Result 431 states and 670 transitions. [2024-11-18 20:45:01,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 20:45:01,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-18 20:45:01,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:45:01,321 INFO L225 Difference]: With dead ends: 431 [2024-11-18 20:45:01,321 INFO L226 Difference]: Without dead ends: 305 [2024-11-18 20:45:01,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-18 20:45:01,323 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 190 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 20:45:01,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 396 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 20:45:01,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-18 20:45:01,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 226. [2024-11-18 20:45:01,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 149 states have (on average 1.3691275167785235) internal successors, (204), 149 states have internal predecessors, (204), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-18 20:45:01,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 348 transitions. [2024-11-18 20:45:01,369 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 348 transitions. Word has length 130 [2024-11-18 20:45:01,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:45:01,370 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 348 transitions. [2024-11-18 20:45:01,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:45:01,370 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 348 transitions. [2024-11-18 20:45:01,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-18 20:45:01,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:45:01,373 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:45:01,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 20:45:01,373 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:45:01,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:45:01,374 INFO L85 PathProgramCache]: Analyzing trace with hash -961317267, now seen corresponding path program 1 times [2024-11-18 20:45:01,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:45:01,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484045682] [2024-11-18 20:45:01,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:45:01,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:45:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:45:01,898 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-18 20:45:01,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:45:01,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484045682] [2024-11-18 20:45:01,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484045682] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 20:45:01,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103872524] [2024-11-18 20:45:01,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:45:01,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:45:01,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:45:01,901 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-18 20:45:01,902 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-18 20:45:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:45:02,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-18 20:45:02,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:45:03,199 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-11-18 20:45:03,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 20:45:03,817 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-18 20:45:03,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103872524] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 20:45:03,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 20:45:03,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 10] total 23 [2024-11-18 20:45:03,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452547550] [2024-11-18 20:45:03,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 20:45:03,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-18 20:45:03,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:45:03,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-18 20:45:03,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2024-11-18 20:45:03,823 INFO L87 Difference]: Start difference. First operand 226 states and 348 transitions. Second operand has 23 states, 23 states have (on average 5.217391304347826) internal successors, (120), 23 states have internal predecessors, (120), 6 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (54), 6 states have call predecessors, (54), 6 states have call successors, (54) [2024-11-18 20:45:07,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:45:07,606 INFO L93 Difference]: Finished difference Result 1220 states and 1776 transitions. [2024-11-18 20:45:07,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-11-18 20:45:07,607 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.217391304347826) internal successors, (120), 23 states have internal predecessors, (120), 6 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (54), 6 states have call predecessors, (54), 6 states have call successors, (54) Word has length 130 [2024-11-18 20:45:07,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:45:07,617 INFO L225 Difference]: With dead ends: 1220 [2024-11-18 20:45:07,617 INFO L226 Difference]: Without dead ends: 1032 [2024-11-18 20:45:07,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3868 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2266, Invalid=8240, Unknown=0, NotChecked=0, Total=10506 [2024-11-18 20:45:07,623 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 2210 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2232 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 2107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-18 20:45:07,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2232 Valid, 949 Invalid, 2107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 1663 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-18 20:45:07,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2024-11-18 20:45:07,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 510. [2024-11-18 20:45:07,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 375 states have (on average 1.384) internal successors, (519), 380 states have internal predecessors, (519), 118 states have call successors, (118), 16 states have call predecessors, (118), 16 states have return successors, (118), 113 states have call predecessors, (118), 118 states have call successors, (118) [2024-11-18 20:45:07,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 755 transitions. [2024-11-18 20:45:07,707 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 755 transitions. Word has length 130 [2024-11-18 20:45:07,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:45:07,709 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 755 transitions. [2024-11-18 20:45:07,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.217391304347826) internal successors, (120), 23 states have internal predecessors, (120), 6 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (54), 6 states have call predecessors, (54), 6 states have call successors, (54) [2024-11-18 20:45:07,709 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 755 transitions. [2024-11-18 20:45:07,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-18 20:45:07,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:45:07,712 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:45:07,732 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-18 20:45:07,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:45:07,914 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:45:07,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:45:07,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1354344277, now seen corresponding path program 1 times [2024-11-18 20:45:07,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:45:07,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026599124] [2024-11-18 20:45:07,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:45:07,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:45:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:45:08,456 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 45 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2024-11-18 20:45:08,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:45:08,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026599124] [2024-11-18 20:45:08,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026599124] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 20:45:08,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018808834] [2024-11-18 20:45:08,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:45:08,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:45:08,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:45:08,459 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 20:45:08,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 20:45:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:45:08,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-18 20:45:08,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:45:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 401 proven. 45 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-11-18 20:45:08,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 20:45:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 48 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-11-18 20:45:09,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018808834] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 20:45:09,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 20:45:09,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-11-18 20:45:09,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157346272] [2024-11-18 20:45:09,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 20:45:09,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-18 20:45:09,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:45:09,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-18 20:45:09,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-18 20:45:09,302 INFO L87 Difference]: Start difference. First operand 510 states and 755 transitions. Second operand has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-11-18 20:45:10,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:45:10,476 INFO L93 Difference]: Finished difference Result 1860 states and 2651 transitions. [2024-11-18 20:45:10,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-18 20:45:10,477 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 130 [2024-11-18 20:45:10,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:45:10,492 INFO L225 Difference]: With dead ends: 1860 [2024-11-18 20:45:10,493 INFO L226 Difference]: Without dead ends: 1392 [2024-11-18 20:45:10,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 256 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2024-11-18 20:45:10,498 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 244 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 20:45:10,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 747 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 20:45:10,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2024-11-18 20:45:10,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 804. [2024-11-18 20:45:10,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 607 states have (on average 1.3377265238879736) internal successors, (812), 614 states have internal predecessors, (812), 158 states have call successors, (158), 38 states have call predecessors, (158), 38 states have return successors, (158), 151 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-18 20:45:10,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1128 transitions. [2024-11-18 20:45:10,628 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1128 transitions. Word has length 130 [2024-11-18 20:45:10,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:45:10,629 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1128 transitions. [2024-11-18 20:45:10,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-11-18 20:45:10,630 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1128 transitions. [2024-11-18 20:45:10,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-18 20:45:10,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:45:10,631 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:45:10,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-18 20:45:10,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:45:10,833 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:45:10,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:45:10,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1251679277, now seen corresponding path program 1 times [2024-11-18 20:45:10,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:45:10,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635945189] [2024-11-18 20:45:10,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:45:10,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:45:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 20:45:10,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1010321925] [2024-11-18 20:45:10,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:45:10,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:45:10,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:45:10,909 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 20:45:10,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 20:45:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:45:11,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-18 20:45:11,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:45:12,151 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-11-18 20:45:12,151 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 20:45:16,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:45:16,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635945189] [2024-11-18 20:45:16,979 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-18 20:45:16,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010321925] [2024-11-18 20:45:16,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010321925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 20:45:16,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-18 20:45:16,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-11-18 20:45:16,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596601293] [2024-11-18 20:45:16,980 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-18 20:45:16,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 20:45:16,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:45:16,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 20:45:16,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=193, Unknown=1, NotChecked=0, Total=272 [2024-11-18 20:45:16,982 INFO L87 Difference]: Start difference. First operand 804 states and 1128 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 20:45:18,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:45:18,415 INFO L93 Difference]: Finished difference Result 2034 states and 2835 transitions. [2024-11-18 20:45:18,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-18 20:45:18,415 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 130 [2024-11-18 20:45:18,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:45:18,422 INFO L225 Difference]: With dead ends: 2034 [2024-11-18 20:45:18,422 INFO L226 Difference]: Without dead ends: 1298 [2024-11-18 20:45:18,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=230, Invalid=525, Unknown=1, NotChecked=0, Total=756 [2024-11-18 20:45:18,426 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 189 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-18 20:45:18,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 664 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-18 20:45:18,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2024-11-18 20:45:18,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1083. [2024-11-18 20:45:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 811 states have (on average 1.3205918618988903) internal successors, (1071), 821 states have internal predecessors, (1071), 218 states have call successors, (218), 53 states have call predecessors, (218), 53 states have return successors, (218), 208 states have call predecessors, (218), 218 states have call successors, (218) [2024-11-18 20:45:18,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1507 transitions. [2024-11-18 20:45:18,539 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1507 transitions. Word has length 130 [2024-11-18 20:45:18,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:45:18,539 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1507 transitions. [2024-11-18 20:45:18,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 20:45:18,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1507 transitions. [2024-11-18 20:45:18,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-18 20:45:18,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:45:18,542 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:45:18,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-18 20:45:18,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:45:18,743 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:45:18,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:45:18,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1750207891, now seen corresponding path program 1 times [2024-11-18 20:45:18,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:45:18,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585018446] [2024-11-18 20:45:18,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:45:18,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:45:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:45:18,914 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 20:45:18,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:45:18,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585018446] [2024-11-18 20:45:18,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585018446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:45:18,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:45:18,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 20:45:18,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127135636] [2024-11-18 20:45:18,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:45:18,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 20:45:18,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:45:18,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 20:45:18,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 20:45:18,917 INFO L87 Difference]: Start difference. First operand 1083 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:45:19,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:45:19,047 INFO L93 Difference]: Finished difference Result 1418 states and 1997 transitions. [2024-11-18 20:45:19,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 20:45:19,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-18 20:45:19,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:45:19,054 INFO L225 Difference]: With dead ends: 1418 [2024-11-18 20:45:19,054 INFO L226 Difference]: Without dead ends: 1083 [2024-11-18 20:45:19,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 20:45:19,056 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 187 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-18 20:45:19,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 20:45:19,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2024-11-18 20:45:19,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1083. [2024-11-18 20:45:19,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 811 states have (on average 1.3070283600493218) internal successors, (1060), 821 states have internal predecessors, (1060), 218 states have call successors, (218), 53 states have call predecessors, (218), 53 states have return successors, (218), 208 states have call predecessors, (218), 218 states have call successors, (218) [2024-11-18 20:45:19,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1496 transitions. [2024-11-18 20:45:19,182 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1496 transitions. Word has length 130 [2024-11-18 20:45:19,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:45:19,182 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1496 transitions. [2024-11-18 20:45:19,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:45:19,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1496 transitions. [2024-11-18 20:45:19,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-18 20:45:19,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:45:19,184 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:45:19,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 20:45:19,185 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:45:19,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:45:19,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1049143313, now seen corresponding path program 1 times [2024-11-18 20:45:19,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:45:19,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052804628] [2024-11-18 20:45:19,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:45:19,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:45:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 20:45:19,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [261595901] [2024-11-18 20:45:19,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:45:19,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:45:19,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:45:19,293 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 20:45:19,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 20:45:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:45:19,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-18 20:45:19,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:45:20,182 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-11-18 20:45:20,183 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 20:45:21,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:45:21,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052804628] [2024-11-18 20:45:21,215 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-18 20:45:21,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261595901] [2024-11-18 20:45:21,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261595901] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 20:45:21,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-18 20:45:21,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-11-18 20:45:21,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493642384] [2024-11-18 20:45:21,216 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-18 20:45:21,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 20:45:21,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:45:21,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 20:45:21,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=148, Unknown=4, NotChecked=0, Total=210 [2024-11-18 20:45:21,218 INFO L87 Difference]: Start difference. First operand 1083 states and 1496 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 20:45:22,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:45:22,236 INFO L93 Difference]: Finished difference Result 2251 states and 3102 transitions. [2024-11-18 20:45:22,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-18 20:45:22,237 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 130 [2024-11-18 20:45:22,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:45:22,247 INFO L225 Difference]: With dead ends: 2251 [2024-11-18 20:45:22,247 INFO L226 Difference]: Without dead ends: 1916 [2024-11-18 20:45:22,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=451, Unknown=4, NotChecked=0, Total=650 [2024-11-18 20:45:22,250 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 135 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 20:45:22,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 638 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 20:45:22,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2024-11-18 20:45:22,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1494. [2024-11-18 20:45:22,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 1126 states have (on average 1.308170515097691) internal successors, (1473), 1138 states have internal predecessors, (1473), 294 states have call successors, (294), 73 states have call predecessors, (294), 73 states have return successors, (294), 282 states have call predecessors, (294), 294 states have call successors, (294) [2024-11-18 20:45:22,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 2061 transitions. [2024-11-18 20:45:22,431 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 2061 transitions. Word has length 130 [2024-11-18 20:45:22,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:45:22,437 INFO L471 AbstractCegarLoop]: Abstraction has 1494 states and 2061 transitions. [2024-11-18 20:45:22,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 20:45:22,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 2061 transitions. [2024-11-18 20:45:22,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-18 20:45:22,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:45:22,439 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:45:22,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-18 20:45:22,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:45:22,640 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:45:22,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:45:22,641 INFO L85 PathProgramCache]: Analyzing trace with hash 33716728, now seen corresponding path program 1 times [2024-11-18 20:45:22,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:45:22,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302732474] [2024-11-18 20:45:22,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:45:22,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:45:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 20:45:22,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [839589065] [2024-11-18 20:45:22,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:45:22,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:45:22,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:45:22,704 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 20:45:22,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-18 20:45:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 20:45:22,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 20:45:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 20:45:22,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 20:45:22,946 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 20:45:22,948 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 20:45:22,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-18 20:45:23,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:45:23,155 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:45:23,275 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 20:45:23,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:45:23 BoogieIcfgContainer [2024-11-18 20:45:23,278 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 20:45:23,279 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 20:45:23,279 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 20:45:23,279 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 20:45:23,280 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:44:58" (3/4) ... [2024-11-18 20:45:23,283 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 20:45:23,284 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 20:45:23,285 INFO L158 Benchmark]: Toolchain (without parser) took 26286.46ms. Allocated memory was 151.0MB in the beginning and 287.3MB in the end (delta: 136.3MB). Free memory was 120.6MB in the beginning and 182.1MB in the end (delta: -61.5MB). Peak memory consumption was 73.9MB. Max. memory is 16.1GB. [2024-11-18 20:45:23,285 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 151.0MB. Free memory is still 108.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 20:45:23,285 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.89ms. Allocated memory is still 151.0MB. Free memory was 120.6MB in the beginning and 103.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-18 20:45:23,285 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.13ms. Allocated memory is still 151.0MB. Free memory was 103.4MB in the beginning and 98.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 20:45:23,285 INFO L158 Benchmark]: Boogie Preprocessor took 92.56ms. Allocated memory is still 151.0MB. Free memory was 98.8MB in the beginning and 92.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-18 20:45:23,285 INFO L158 Benchmark]: RCFGBuilder took 669.51ms. Allocated memory is still 151.0MB. Free memory was 92.5MB in the beginning and 65.7MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-18 20:45:23,286 INFO L158 Benchmark]: TraceAbstraction took 25103.16ms. Allocated memory was 151.0MB in the beginning and 287.3MB in the end (delta: 136.3MB). Free memory was 65.2MB in the beginning and 182.1MB in the end (delta: -116.9MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2024-11-18 20:45:23,286 INFO L158 Benchmark]: Witness Printer took 5.54ms. Allocated memory is still 287.3MB. Free memory is still 182.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 20:45:23,288 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.20ms. Allocated memory is still 151.0MB. Free memory is still 108.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.89ms. Allocated memory is still 151.0MB. Free memory was 120.6MB in the beginning and 103.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.13ms. Allocated memory is still 151.0MB. Free memory was 103.4MB in the beginning and 98.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.56ms. Allocated memory is still 151.0MB. Free memory was 98.8MB in the beginning and 92.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 669.51ms. Allocated memory is still 151.0MB. Free memory was 92.5MB in the beginning and 65.7MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 25103.16ms. Allocated memory was 151.0MB in the beginning and 287.3MB in the end (delta: 136.3MB). Free memory was 65.2MB in the beginning and 182.1MB in the end (delta: -116.9MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Witness Printer took 5.54ms. Allocated memory is still 287.3MB. Free memory is still 182.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 177, overapproximation of someUnaryDOUBLEoperation at line 30. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] unsigned char var_1_21 = 0; [L37] float var_1_26 = 500.65; [L38] float var_1_30 = 9.8; [L39] unsigned char var_1_31 = 4; [L40] unsigned short int var_1_34 = 1; [L41] unsigned long int var_1_35 = 10; [L42] unsigned char var_1_36 = 10; [L43] unsigned char var_1_38 = 16; [L44] unsigned char var_1_39 = 0; [L45] unsigned short int var_1_40 = 10; [L46] unsigned short int var_1_41 = 128; [L47] unsigned short int var_1_42 = 40597; [L48] signed short int last_1_var_1_1 = 16; [L49] unsigned char last_1_var_1_6 = 10; [L50] unsigned char last_1_var_1_8 = 1; [L51] signed short int last_1_var_1_13 = 200; VAL [isInitial=0, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] CALL updateLastVariables() [L171] last_1_var_1_1 = var_1_1 [L172] last_1_var_1_6 = var_1_6 [L173] last_1_var_1_8 = var_1_8 [L174] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L184] RET updateLastVariables() [L185] CALL updateVariables() [L141] var_1_5 = __VERIFIER_nondet_char() [L142] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=128, var_1_8=1] [L142] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=128, var_1_8=1] [L143] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=128, var_1_8=1] [L143] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=128, var_1_8=1] [L144] var_1_7 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L145] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L146] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L146] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L147] var_1_11 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L148] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L149] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L149] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L150] var_1_12 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L151] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L152] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L152] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L153] var_1_15 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L154] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L155] var_1_16 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L156] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L157] var_1_20 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L158] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L159] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L159] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L160] var_1_38 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L161] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L162] CALL assume_abort_if_not(var_1_38 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L162] RET assume_abort_if_not(var_1_38 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L163] var_1_39 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L164] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L165] CALL assume_abort_if_not(var_1_39 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L165] RET assume_abort_if_not(var_1_39 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L166] var_1_42 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_42 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L167] RET assume_abort_if_not(var_1_42 >= 32767) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L168] CALL assume_abort_if_not(var_1_42 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L168] RET assume_abort_if_not(var_1_42 <= 65534) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L185] RET updateVariables() [L186] CALL step() [L55] signed long int stepLocal_6 = last_1_var_1_1; [L56] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=0, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L57] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L58] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L61] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L66] COND TRUE (- var_1_15) < ((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15))) [L67] var_1_30 = var_1_15 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L69] COND TRUE \read(var_1_11) [L70] var_1_35 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=4, var_1_34=1, var_1_35=201, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L72] COND TRUE \read(var_1_11) [L73] var_1_36 = (var_1_7 - var_1_38) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=4, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L77] COND FALSE !(var_1_7 <= (~ var_1_6)) [L82] var_1_41 = var_1_6 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=4, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=10, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L84] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=4, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=10, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L87] COND FALSE !(var_1_5 >= -2) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=4, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=10, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L90] COND TRUE ((((((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) < (var_1_5)) ? (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) : (var_1_5))) <= var_1_13 [L91] var_1_31 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=10, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L93] COND TRUE (- var_1_6) != var_1_7 [L94] var_1_40 = var_1_39 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L96] unsigned char stepLocal_4 = var_1_6; [L97] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=10, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L98] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=10, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L99] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L100] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L107] COND FALSE !(((var_1_7 + 25) % var_1_7) < 2) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L110] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=10, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L111] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L114] COND FALSE !(var_1_7 < ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L117] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=10, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L118] COND TRUE \read(var_1_19) [L119] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=10, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L125] COND TRUE var_1_12 || var_1_19 [L126] var_1_21 = ((var_1_6 > -4) || var_1_11) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=10, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L128] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L129] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=10, stepLocal_1=201, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L130] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L137] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=10, stepLocal_1=201, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=0] [L186] RET step() [L187] CALL, EXPR property() [L177-L178] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=0] [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.9s, OverallIterations: 10, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3171 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3129 mSDsluCounter, 4201 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3183 mSDsCounter, 746 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3642 IncrementalHoareTripleChecker+Invalid, 4388 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 746 mSolverCounterUnsat, 1018 mSDtfsCounter, 3642 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1322 GetRequests, 1111 SyntacticMatches, 2 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4605 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1494occurred in iteration=9, InterpolantAutomatonStates: 179, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 9 MinimizatonAttempts, 1858 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 2079 NumberOfCodeBlocks, 2079 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1803 ConstructedInterpolants, 0 QuantifiedInterpolants, 9495 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1676 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 8171/8568 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-18 20:45:23,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.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 63de2d71d444749da4273a6a58c4b105d09e2f11c04911b2ed4cbf82a61c5b48 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 20:45:25,449 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 20:45:25,503 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 20:45:25,509 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 20:45:25,509 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 20:45:25,543 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 20:45:25,544 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 20:45:25,544 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 20:45:25,545 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 20:45:25,545 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 20:45:25,545 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 20:45:25,546 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 20:45:25,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 20:45:25,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 20:45:25,553 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 20:45:25,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 20:45:25,554 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 20:45:25,554 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 20:45:25,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 20:45:25,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 20:45:25,554 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 20:45:25,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 20:45:25,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 20:45:25,556 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 20:45:25,557 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 20:45:25,557 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 20:45:25,557 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 20:45:25,558 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 20:45:25,558 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 20:45:25,558 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 20:45:25,559 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 20:45:25,559 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 20:45:25,560 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 20:45:25,560 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 20:45:25,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 20:45:25,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 20:45:25,561 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 20:45:25,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 20:45:25,568 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 20:45:25,569 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 20:45:25,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 20:45:25,569 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 20:45:25,569 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 20:45:25,570 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 20:45:25,570 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 -> 63de2d71d444749da4273a6a58c4b105d09e2f11c04911b2ed4cbf82a61c5b48 [2024-11-18 20:45:25,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 20:45:25,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 20:45:25,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 20:45:25,925 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 20:45:25,926 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 20:45:25,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i [2024-11-18 20:45:27,376 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 20:45:27,638 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 20:45:27,643 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i [2024-11-18 20:45:27,660 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87d9dcdc1/dc41371487c3400caeed3704d5ae817b/FLAG43b6b58c8 [2024-11-18 20:45:27,967 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87d9dcdc1/dc41371487c3400caeed3704d5ae817b [2024-11-18 20:45:27,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 20:45:27,971 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 20:45:27,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 20:45:27,974 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 20:45:27,979 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 20:45:27,980 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:45:27" (1/1) ... [2024-11-18 20:45:27,981 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29002272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:27, skipping insertion in model container [2024-11-18 20:45:27,983 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:45:27" (1/1) ... [2024-11-18 20:45:28,018 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 20:45:28,213 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_fillercode_fillercodestructure_filler-pr-ci_file-42.i[919,932] [2024-11-18 20:45:28,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 20:45:28,334 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 20:45:28,349 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_fillercode_fillercodestructure_filler-pr-ci_file-42.i[919,932] [2024-11-18 20:45:28,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 20:45:28,430 INFO L204 MainTranslator]: Completed translation [2024-11-18 20:45:28,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:28 WrapperNode [2024-11-18 20:45:28,431 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 20:45:28,432 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 20:45:28,432 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 20:45:28,432 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 20:45:28,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:28" (1/1) ... [2024-11-18 20:45:28,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:28" (1/1) ... [2024-11-18 20:45:28,496 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2024-11-18 20:45:28,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 20:45:28,501 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 20:45:28,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 20:45:28,503 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 20:45:28,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:28" (1/1) ... [2024-11-18 20:45:28,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:28" (1/1) ... [2024-11-18 20:45:28,524 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:28" (1/1) ... [2024-11-18 20:45:28,547 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 20:45:28,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:28" (1/1) ... [2024-11-18 20:45:28,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:28" (1/1) ... [2024-11-18 20:45:28,567 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:28" (1/1) ... [2024-11-18 20:45:28,571 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:28" (1/1) ... [2024-11-18 20:45:28,573 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:28" (1/1) ... [2024-11-18 20:45:28,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:28" (1/1) ... [2024-11-18 20:45:28,579 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 20:45:28,581 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 20:45:28,581 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 20:45:28,585 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 20:45:28,586 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:28" (1/1) ... [2024-11-18 20:45:28,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 20:45:28,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:45:28,624 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-18 20:45:28,628 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-18 20:45:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 20:45:28,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 20:45:28,675 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 20:45:28,675 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 20:45:28,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 20:45:28,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 20:45:28,779 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 20:45:28,784 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 20:45:29,524 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-18 20:45:29,524 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 20:45:29,543 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 20:45:29,544 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 20:45:29,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:45:29 BoogieIcfgContainer [2024-11-18 20:45:29,545 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 20:45:29,548 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 20:45:29,548 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 20:45:29,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 20:45:29,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:45:27" (1/3) ... [2024-11-18 20:45:29,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa7f1e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:45:29, skipping insertion in model container [2024-11-18 20:45:29,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:28" (2/3) ... [2024-11-18 20:45:29,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa7f1e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:45:29, skipping insertion in model container [2024-11-18 20:45:29,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:45:29" (3/3) ... [2024-11-18 20:45:29,556 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i [2024-11-18 20:45:29,575 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 20:45:29,575 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 20:45:29,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 20:45:29,647 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;@29bbe348, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 20:45:29,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 20:45:29,654 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 20:45:29,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-18 20:45:29,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:45:29,672 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:45:29,673 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:45:29,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:45:29,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1129688923, now seen corresponding path program 1 times [2024-11-18 20:45:29,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:45:29,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139524114] [2024-11-18 20:45:29,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:45:29,698 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-18 20:45:29,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:45:29,702 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-18 20:45:29,717 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-18 20:45:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:45:30,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 20:45:30,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:45:30,136 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-18 20:45:30,136 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 20:45:30,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 20:45:30,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139524114] [2024-11-18 20:45:30,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139524114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:45:30,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:45:30,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 20:45:30,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756407852] [2024-11-18 20:45:30,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:45:30,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 20:45:30,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 20:45:30,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 20:45:30,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 20:45:30,175 INFO L87 Difference]: Start difference. First operand has 72 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 20:45:30,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:45:30,207 INFO L93 Difference]: Finished difference Result 136 states and 236 transitions. [2024-11-18 20:45:30,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 20:45:30,211 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2024-11-18 20:45:30,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:45:30,218 INFO L225 Difference]: With dead ends: 136 [2024-11-18 20:45:30,218 INFO L226 Difference]: Without dead ends: 67 [2024-11-18 20:45:30,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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-18 20:45:30,227 INFO L432 NwaCegarLoop]: 103 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, 103 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-18 20:45:30,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 20:45:30,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-18 20:45:30,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-18 20:45:30,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.425531914893617) internal successors, (67), 47 states have internal predecessors, (67), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 20:45:30,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 103 transitions. [2024-11-18 20:45:30,281 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 103 transitions. Word has length 129 [2024-11-18 20:45:30,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:45:30,282 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 103 transitions. [2024-11-18 20:45:30,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 20:45:30,282 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 103 transitions. [2024-11-18 20:45:30,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-18 20:45:30,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:45:30,285 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:45:30,296 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-18 20:45:30,486 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-18 20:45:30,486 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:45:30,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:45:30,487 INFO L85 PathProgramCache]: Analyzing trace with hash 590839201, now seen corresponding path program 1 times [2024-11-18 20:45:30,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:45:30,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809974696] [2024-11-18 20:45:30,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:45:30,489 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-18 20:45:30,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:45:30,492 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-18 20:45:30,493 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-18 20:45:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:45:30,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 20:45:30,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:45:31,028 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 20:45:31,029 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 20:45:31,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 20:45:31,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809974696] [2024-11-18 20:45:31,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1809974696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:45:31,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:45:31,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 20:45:31,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546260338] [2024-11-18 20:45:31,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:45:31,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 20:45:31,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 20:45:31,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 20:45:31,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 20:45:31,033 INFO L87 Difference]: Start difference. First operand 67 states and 103 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:45:31,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:45:31,371 INFO L93 Difference]: Finished difference Result 196 states and 304 transitions. [2024-11-18 20:45:31,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 20:45:31,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2024-11-18 20:45:31,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:45:31,378 INFO L225 Difference]: With dead ends: 196 [2024-11-18 20:45:31,378 INFO L226 Difference]: Without dead ends: 132 [2024-11-18 20:45:31,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 20:45:31,380 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 104 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 20:45:31,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 291 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 20:45:31,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-18 20:45:31,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 102. [2024-11-18 20:45:31,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-18 20:45:31,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2024-11-18 20:45:31,411 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 129 [2024-11-18 20:45:31,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:45:31,412 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2024-11-18 20:45:31,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:45:31,412 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2024-11-18 20:45:31,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-18 20:45:31,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:45:31,415 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:45:31,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-18 20:45:31,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:45:31,620 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:45:31,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:45:31,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1528368339, now seen corresponding path program 1 times [2024-11-18 20:45:31,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:45:31,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634752995] [2024-11-18 20:45:31,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:45:31,623 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-18 20:45:31,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:45:31,625 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 20:45:31,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-18 20:45:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:45:31,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 20:45:31,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:45:32,611 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 20:45:32,612 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 20:45:32,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 20:45:32,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634752995] [2024-11-18 20:45:32,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634752995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:45:32,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:45:32,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 20:45:32,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023928363] [2024-11-18 20:45:32,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:45:32,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 20:45:32,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 20:45:32,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 20:45:32,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 20:45:32,618 INFO L87 Difference]: Start difference. First operand 102 states and 155 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:45:33,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:45:33,425 INFO L93 Difference]: Finished difference Result 293 states and 459 transitions. [2024-11-18 20:45:33,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 20:45:33,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-18 20:45:33,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:45:33,436 INFO L225 Difference]: With dead ends: 293 [2024-11-18 20:45:33,439 INFO L226 Difference]: Without dead ends: 229 [2024-11-18 20:45:33,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-18 20:45:33,441 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 190 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 20:45:33,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 388 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 20:45:33,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-18 20:45:33,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 164. [2024-11-18 20:45:33,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 106 states have (on average 1.3584905660377358) internal successors, (144), 106 states have internal predecessors, (144), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-18 20:45:33,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 252 transitions. [2024-11-18 20:45:33,480 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 252 transitions. Word has length 130 [2024-11-18 20:45:33,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:45:33,480 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 252 transitions. [2024-11-18 20:45:33,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:45:33,481 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 252 transitions. [2024-11-18 20:45:33,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-18 20:45:33,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:45:33,483 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:45:33,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-18 20:45:33,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:45:33,687 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:45:33,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:45:33,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1662381845, now seen corresponding path program 1 times [2024-11-18 20:45:33,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:45:33,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325115866] [2024-11-18 20:45:33,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:45:33,689 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-18 20:45:33,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:45:33,692 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 20:45:33,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-18 20:45:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:45:33,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 20:45:33,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:45:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 20:45:33,979 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 20:45:33,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 20:45:33,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325115866] [2024-11-18 20:45:33,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1325115866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:45:33,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:45:33,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 20:45:33,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005910532] [2024-11-18 20:45:33,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:45:33,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 20:45:33,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 20:45:33,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 20:45:33,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 20:45:33,982 INFO L87 Difference]: Start difference. First operand 164 states and 252 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:45:34,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:45:34,110 INFO L93 Difference]: Finished difference Result 290 states and 449 transitions. [2024-11-18 20:45:34,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 20:45:34,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-18 20:45:34,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:45:34,123 INFO L225 Difference]: With dead ends: 290 [2024-11-18 20:45:34,124 INFO L226 Difference]: Without dead ends: 164 [2024-11-18 20:45:34,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 20:45:34,126 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 20:45:34,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 186 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 20:45:34,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-18 20:45:34,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-11-18 20:45:34,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 106 states have (on average 1.3396226415094339) internal successors, (142), 106 states have internal predecessors, (142), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-18 20:45:34,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 250 transitions. [2024-11-18 20:45:34,153 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 250 transitions. Word has length 130 [2024-11-18 20:45:34,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:45:34,153 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 250 transitions. [2024-11-18 20:45:34,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:45:34,154 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 250 transitions. [2024-11-18 20:45:34,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-18 20:45:34,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:45:34,156 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:45:34,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-18 20:45:34,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:45:34,357 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:45:34,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:45:34,357 INFO L85 PathProgramCache]: Analyzing trace with hash -961317267, now seen corresponding path program 1 times [2024-11-18 20:45:34,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:45:34,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122657018] [2024-11-18 20:45:34,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:45:34,363 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-18 20:45:34,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:45:34,365 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 20:45:34,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-18 20:45:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:45:34,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 20:45:34,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:45:35,192 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-11-18 20:45:35,192 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 20:45:35,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 20:45:35,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122657018] [2024-11-18 20:45:35,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [122657018] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 20:45:35,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2117806257] [2024-11-18 20:45:35,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:45:35,435 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-18 20:45:35,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-18 20:45:35,438 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-18 20:45:35,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-18 20:45:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:45:36,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 20:45:36,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:45:36,649 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 20:45:36,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 20:45:36,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2117806257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:45:36,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 20:45:36,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-18 20:45:36,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806360388] [2024-11-18 20:45:36,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:45:36,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 20:45:36,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 20:45:36,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 20:45:36,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-18 20:45:36,652 INFO L87 Difference]: Start difference. First operand 164 states and 250 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:45:38,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:45:38,272 INFO L93 Difference]: Finished difference Result 450 states and 689 transitions. [2024-11-18 20:45:38,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 20:45:38,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-18 20:45:38,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:45:38,276 INFO L225 Difference]: With dead ends: 450 [2024-11-18 20:45:38,276 INFO L226 Difference]: Without dead ends: 324 [2024-11-18 20:45:38,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-11-18 20:45:38,277 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 93 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-18 20:45:38,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 391 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-18 20:45:38,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-18 20:45:38,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 288. [2024-11-18 20:45:38,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 192 states have (on average 1.3489583333333333) internal successors, (259), 192 states have internal predecessors, (259), 90 states have call successors, (90), 5 states have call predecessors, (90), 5 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-18 20:45:38,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 439 transitions. [2024-11-18 20:45:38,331 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 439 transitions. Word has length 130 [2024-11-18 20:45:38,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:45:38,331 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 439 transitions. [2024-11-18 20:45:38,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:45:38,332 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 439 transitions. [2024-11-18 20:45:38,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-18 20:45:38,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:45:38,337 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:45:38,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-18 20:45:38,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-18 20:45:38,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:45:38,738 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:45:38,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:45:38,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1032827439, now seen corresponding path program 1 times [2024-11-18 20:45:38,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:45:38,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912468603] [2024-11-18 20:45:38,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:45:38,740 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-18 20:45:38,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:45:38,743 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 20:45:38,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-18 20:45:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:45:38,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 20:45:38,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:45:39,253 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 401 proven. 45 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-11-18 20:45:39,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 20:45:39,574 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 48 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-11-18 20:45:39,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 20:45:39,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912468603] [2024-11-18 20:45:39,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [912468603] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 20:45:39,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 20:45:39,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-11-18 20:45:39,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793298530] [2024-11-18 20:45:39,575 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 20:45:39,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-18 20:45:39,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 20:45:39,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-18 20:45:39,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-18 20:45:39,580 INFO L87 Difference]: Start difference. First operand 288 states and 439 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2024-11-18 20:45:40,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:45:40,626 INFO L93 Difference]: Finished difference Result 784 states and 1133 transitions. [2024-11-18 20:45:40,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-18 20:45:40,628 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 130 [2024-11-18 20:45:40,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:45:40,632 INFO L225 Difference]: With dead ends: 784 [2024-11-18 20:45:40,632 INFO L226 Difference]: Without dead ends: 534 [2024-11-18 20:45:40,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2024-11-18 20:45:40,634 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 203 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 20:45:40,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 470 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 20:45:40,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-18 20:45:40,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 490. [2024-11-18 20:45:40,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 342 states have (on average 1.304093567251462) internal successors, (446), 342 states have internal predecessors, (446), 126 states have call successors, (126), 21 states have call predecessors, (126), 21 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-18 20:45:40,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 698 transitions. [2024-11-18 20:45:40,711 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 698 transitions. Word has length 130 [2024-11-18 20:45:40,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:45:40,712 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 698 transitions. [2024-11-18 20:45:40,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2024-11-18 20:45:40,713 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 698 transitions. [2024-11-18 20:45:40,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-18 20:45:40,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:45:40,715 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:45:40,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-18 20:45:40,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:45:40,916 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:45:40,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:45:40,917 INFO L85 PathProgramCache]: Analyzing trace with hash -656116303, now seen corresponding path program 1 times [2024-11-18 20:45:40,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:45:40,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898128350] [2024-11-18 20:45:40,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:45:40,918 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-18 20:45:40,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:45:40,919 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 20:45:40,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-18 20:45:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:45:41,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 20:45:41,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:45:41,736 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-11-18 20:45:41,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 20:45:42,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 20:45:42,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898128350] [2024-11-18 20:45:42,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898128350] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 20:45:42,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1262602490] [2024-11-18 20:45:42,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:45:42,174 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-18 20:45:42,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-18 20:45:42,175 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-18 20:45:42,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-18 20:45:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:45:42,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 20:45:42,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:45:43,298 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 20:45:43,298 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 20:45:43,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1262602490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:45:43,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 20:45:43,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-18 20:45:43,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026706310] [2024-11-18 20:45:43,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:45:43,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 20:45:43,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 20:45:43,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 20:45:43,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-18 20:45:43,300 INFO L87 Difference]: Start difference. First operand 490 states and 698 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:45:45,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:45:45,770 INFO L93 Difference]: Finished difference Result 913 states and 1301 transitions. [2024-11-18 20:45:45,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 20:45:45,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-18 20:45:45,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:45:45,782 INFO L225 Difference]: With dead ends: 913 [2024-11-18 20:45:45,782 INFO L226 Difference]: Without dead ends: 772 [2024-11-18 20:45:45,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-18 20:45:45,784 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 132 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-18 20:45:45,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 492 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-18 20:45:45,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-11-18 20:45:45,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 684. [2024-11-18 20:45:45,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 488 states have (on average 1.3114754098360655) internal successors, (640), 490 states have internal predecessors, (640), 166 states have call successors, (166), 29 states have call predecessors, (166), 29 states have return successors, (166), 164 states have call predecessors, (166), 166 states have call successors, (166) [2024-11-18 20:45:45,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 972 transitions. [2024-11-18 20:45:45,853 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 972 transitions. Word has length 130 [2024-11-18 20:45:45,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:45:45,854 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 972 transitions. [2024-11-18 20:45:45,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:45:45,854 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 972 transitions. [2024-11-18 20:45:45,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-18 20:45:45,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:45:45,857 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:45:45,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-18 20:45:46,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-11-18 20:45:46,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-18 20:45:46,258 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:45:46,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:45:46,258 INFO L85 PathProgramCache]: Analyzing trace with hash 426743738, now seen corresponding path program 1 times [2024-11-18 20:45:46,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:45:46,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978231758] [2024-11-18 20:45:46,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:45:46,259 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-18 20:45:46,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:45:46,260 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 20:45:46,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-18 20:45:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:45:46,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 20:45:46,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:45:46,848 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 158 proven. 84 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-18 20:45:46,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 20:45:46,975 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 20:45:46,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 20:45:46,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978231758] [2024-11-18 20:45:46,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978231758] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 20:45:46,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 20:45:46,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-18 20:45:46,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337806189] [2024-11-18 20:45:46,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:45:46,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 20:45:46,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 20:45:46,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 20:45:46,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-18 20:45:46,977 INFO L87 Difference]: Start difference. First operand 684 states and 972 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:45:47,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:45:47,461 INFO L93 Difference]: Finished difference Result 1107 states and 1550 transitions. [2024-11-18 20:45:47,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 20:45:47,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2024-11-18 20:45:47,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:45:47,468 INFO L225 Difference]: With dead ends: 1107 [2024-11-18 20:45:47,469 INFO L226 Difference]: Without dead ends: 894 [2024-11-18 20:45:47,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-18 20:45:47,470 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 29 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 20:45:47,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 180 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 20:45:47,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-11-18 20:45:47,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 810. [2024-11-18 20:45:47,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 596 states have (on average 1.3036912751677852) internal successors, (777), 604 states have internal predecessors, (777), 178 states have call successors, (178), 35 states have call predecessors, (178), 35 states have return successors, (178), 170 states have call predecessors, (178), 178 states have call successors, (178) [2024-11-18 20:45:47,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1133 transitions. [2024-11-18 20:45:47,545 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1133 transitions. Word has length 131 [2024-11-18 20:45:47,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:45:47,546 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 1133 transitions. [2024-11-18 20:45:47,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:45:47,546 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1133 transitions. [2024-11-18 20:45:47,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-18 20:45:47,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:45:47,548 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:45:47,559 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 (11)] Ended with exit code 0 [2024-11-18 20:45:47,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:45:47,749 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:45:47,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:45:47,749 INFO L85 PathProgramCache]: Analyzing trace with hash 33716728, now seen corresponding path program 1 times [2024-11-18 20:45:47,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:45:47,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682472539] [2024-11-18 20:45:47,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:45:47,750 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-18 20:45:47,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:45:47,751 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 20:45:47,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-18 20:45:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:45:47,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-18 20:45:47,954 INFO L278 TraceCheckSpWp]: Computing forward predicates...