./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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_fillercodesize_ps-cn-25_file-3.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 fcab9d14a39efb8d0bba4b7e607a800a4978f63d5ac50f5af469476854f605eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:14:53,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:14:53,061 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:14:53,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:14:53,066 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:14:53,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:14:53,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:14:53,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:14:53,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:14:53,092 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:14:53,092 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:14:53,092 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:14:53,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:14:53,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:14:53,093 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:14:53,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:14:53,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:14:53,093 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:14:53,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:14:53,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:14:53,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:14:53,093 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:14:53,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:14:53,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:14:53,093 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:14:53,093 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:14:53,093 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:14:53,095 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:14:53,095 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:14:53,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:14:53,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:14:53,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:14:53,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:14:53,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:14:53,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:14:53,096 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:14:53,096 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:14:53,096 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:14:53,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:14:53,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:14:53,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:14:53,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:14:53,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:14:53,096 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> fcab9d14a39efb8d0bba4b7e607a800a4978f63d5ac50f5af469476854f605eb [2025-03-17 00:14:53,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:14:53,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:14:53,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:14:53,340 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:14:53,341 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:14:53,342 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i [2025-03-17 00:14:54,518 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75f469a25/c5c2e69f44ac4b5eba0eb360a594a5be/FLAG7ac0dd817 [2025-03-17 00:14:54,744 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:14:54,745 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i [2025-03-17 00:14:54,755 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75f469a25/c5c2e69f44ac4b5eba0eb360a594a5be/FLAG7ac0dd817 [2025-03-17 00:14:55,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75f469a25/c5c2e69f44ac4b5eba0eb360a594a5be [2025-03-17 00:14:55,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:14:55,069 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:14:55,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:14:55,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:14:55,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:14:55,074 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:14:55" (1/1) ... [2025-03-17 00:14:55,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4bf41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:14:55, skipping insertion in model container [2025-03-17 00:14:55,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:14:55" (1/1) ... [2025-03-17 00:14:55,089 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:14:55,184 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_fillercodesize_ps-cn-25_file-3.i[914,927] [2025-03-17 00:14:55,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:14:55,264 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:14:55,273 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_fillercodesize_ps-cn-25_file-3.i[914,927] [2025-03-17 00:14:55,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:14:55,316 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:14:55,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:14:55 WrapperNode [2025-03-17 00:14:55,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:14:55,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:14:55,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:14:55,318 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:14:55,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:14:55" (1/1) ... [2025-03-17 00:14:55,330 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:14:55" (1/1) ... [2025-03-17 00:14:55,377 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 232 [2025-03-17 00:14:55,377 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:14:55,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:14:55,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:14:55,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:14:55,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:14:55" (1/1) ... [2025-03-17 00:14:55,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:14:55" (1/1) ... [2025-03-17 00:14:55,389 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:14:55" (1/1) ... [2025-03-17 00:14:55,408 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]. [2025-03-17 00:14:55,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:14:55" (1/1) ... [2025-03-17 00:14:55,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:14:55" (1/1) ... [2025-03-17 00:14:55,420 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:14:55" (1/1) ... [2025-03-17 00:14:55,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:14:55" (1/1) ... [2025-03-17 00:14:55,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:14:55" (1/1) ... [2025-03-17 00:14:55,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:14:55" (1/1) ... [2025-03-17 00:14:55,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:14:55,435 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:14:55,436 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:14:55,436 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:14:55,436 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:14:55" (1/1) ... [2025-03-17 00:14:55,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:14:55,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:14:55,460 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) [2025-03-17 00:14:55,462 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 [2025-03-17 00:14:55,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:14:55,478 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:14:55,478 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:14:55,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:14:55,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:14:55,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:14:55,544 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:14:55,546 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:14:55,849 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L168: havoc property_#t~bitwise23#1;havoc property_#t~short24#1; [2025-03-17 00:14:55,871 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-17 00:14:55,871 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:14:55,884 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:14:55,885 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:14:55,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:14:55 BoogieIcfgContainer [2025-03-17 00:14:55,885 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:14:55,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:14:55,887 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:14:55,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:14:55,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:14:55" (1/3) ... [2025-03-17 00:14:55,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@468d70cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:14:55, skipping insertion in model container [2025-03-17 00:14:55,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:14:55" (2/3) ... [2025-03-17 00:14:55,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@468d70cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:14:55, skipping insertion in model container [2025-03-17 00:14:55,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:14:55" (3/3) ... [2025-03-17 00:14:55,892 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-3.i [2025-03-17 00:14:55,901 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:14:55,902 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-3.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:14:55,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:14:55,943 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;@42b13f4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:14:55,943 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:14:55,945 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 71 states have internal predecessors, (107), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 00:14:55,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-17 00:14:55,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:14:55,956 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:14:55,957 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:14:55,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:14:55,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1305277442, now seen corresponding path program 1 times [2025-03-17 00:14:55,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:14:55,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013661734] [2025-03-17 00:14:55,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:14:55,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:14:56,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-17 00:14:56,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-17 00:14:56,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:14:56,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:14:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-17 00:14:56,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:14:56,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013661734] [2025-03-17 00:14:56,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013661734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:14:56,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371873201] [2025-03-17 00:14:56,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:14:56,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:14:56,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:14:56,228 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) [2025-03-17 00:14:56,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 00:14:56,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-17 00:14:56,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-17 00:14:56,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:14:56,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:14:56,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:14:56,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:14:56,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-17 00:14:56,403 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:14:56,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371873201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:14:56,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:14:56,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:14:56,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131846998] [2025-03-17 00:14:56,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:14:56,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:14:56,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:14:56,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:14:56,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:14:56,428 INFO L87 Difference]: Start difference. First operand has 101 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 71 states have internal predecessors, (107), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 00:14:56,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:14:56,461 INFO L93 Difference]: Finished difference Result 199 states and 352 transitions. [2025-03-17 00:14:56,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:14:56,464 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 178 [2025-03-17 00:14:56,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:14:56,469 INFO L225 Difference]: With dead ends: 199 [2025-03-17 00:14:56,470 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 00:14:56,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:14:56,477 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:14:56,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:14:56,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 00:14:56,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-17 00:14:56,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 69 states have internal predecessors, (102), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 00:14:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 158 transitions. [2025-03-17 00:14:56,522 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 158 transitions. Word has length 178 [2025-03-17 00:14:56,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:14:56,523 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 158 transitions. [2025-03-17 00:14:56,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 00:14:56,524 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 158 transitions. [2025-03-17 00:14:56,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-17 00:14:56,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:14:56,527 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:14:56,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 00:14:56,728 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 [2025-03-17 00:14:56,729 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:14:56,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:14:56,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1333321760, now seen corresponding path program 1 times [2025-03-17 00:14:56,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:14:56,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3178968] [2025-03-17 00:14:56,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:14:56,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:14:56,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-17 00:14:56,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-17 00:14:56,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:14:56,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:14:57,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 00:14:57,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:14:57,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3178968] [2025-03-17 00:14:57,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3178968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:14:57,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:14:57,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:14:57,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766567790] [2025-03-17 00:14:57,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:14:57,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:14:57,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:14:57,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:14:57,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:14:57,194 INFO L87 Difference]: Start difference. First operand 99 states and 158 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:14:57,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:14:57,273 INFO L93 Difference]: Finished difference Result 295 states and 472 transitions. [2025-03-17 00:14:57,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:14:57,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2025-03-17 00:14:57,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:14:57,277 INFO L225 Difference]: With dead ends: 295 [2025-03-17 00:14:57,277 INFO L226 Difference]: Without dead ends: 197 [2025-03-17 00:14:57,279 INFO L434 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 [2025-03-17 00:14:57,280 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 96 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:14:57,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 307 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:14:57,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-17 00:14:57,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2025-03-17 00:14:57,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 136 states have (on average 1.4558823529411764) internal successors, (198), 136 states have internal predecessors, (198), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 00:14:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 310 transitions. [2025-03-17 00:14:57,309 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 310 transitions. Word has length 178 [2025-03-17 00:14:57,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:14:57,309 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 310 transitions. [2025-03-17 00:14:57,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:14:57,311 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 310 transitions. [2025-03-17 00:14:57,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-17 00:14:57,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:14:57,313 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:14:57,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:14:57,313 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:14:57,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:14:57,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1129732984, now seen corresponding path program 1 times [2025-03-17 00:14:57,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:14:57,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121064324] [2025-03-17 00:14:57,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:14:57,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:14:57,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-17 00:14:57,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-17 00:14:57,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:14:57,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:14:57,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 00:14:57,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:14:57,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121064324] [2025-03-17 00:14:57,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121064324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:14:57,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:14:57,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:14:57,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642205694] [2025-03-17 00:14:57,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:14:57,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:14:57,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:14:57,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:14:57,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:14:57,415 INFO L87 Difference]: Start difference. First operand 195 states and 310 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:14:57,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:14:57,498 INFO L93 Difference]: Finished difference Result 451 states and 712 transitions. [2025-03-17 00:14:57,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:14:57,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 179 [2025-03-17 00:14:57,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:14:57,502 INFO L225 Difference]: With dead ends: 451 [2025-03-17 00:14:57,502 INFO L226 Difference]: Without dead ends: 257 [2025-03-17 00:14:57,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:14:57,503 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 40 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:14:57,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 324 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:14:57,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-17 00:14:57,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 213. [2025-03-17 00:14:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 154 states have (on average 1.4545454545454546) internal successors, (224), 154 states have internal predecessors, (224), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 00:14:57,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 336 transitions. [2025-03-17 00:14:57,525 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 336 transitions. Word has length 179 [2025-03-17 00:14:57,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:14:57,526 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 336 transitions. [2025-03-17 00:14:57,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:14:57,526 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 336 transitions. [2025-03-17 00:14:57,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-17 00:14:57,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:14:57,527 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:14:57,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:14:57,528 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:14:57,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:14:57,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1275497591, now seen corresponding path program 1 times [2025-03-17 00:14:57,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:14:57,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257957058] [2025-03-17 00:14:57,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:14:57,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:14:57,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-17 00:14:57,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-17 00:14:57,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:14:57,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:14:57,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 00:14:57,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:14:57,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257957058] [2025-03-17 00:14:57,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257957058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:14:57,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:14:57,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:14:57,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675943722] [2025-03-17 00:14:57,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:14:57,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:14:57,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:14:57,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:14:57,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:14:57,728 INFO L87 Difference]: Start difference. First operand 213 states and 336 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:14:57,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:14:57,850 INFO L93 Difference]: Finished difference Result 629 states and 996 transitions. [2025-03-17 00:14:57,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:14:57,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 179 [2025-03-17 00:14:57,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:14:57,856 INFO L225 Difference]: With dead ends: 629 [2025-03-17 00:14:57,856 INFO L226 Difference]: Without dead ends: 417 [2025-03-17 00:14:57,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:14:57,859 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 144 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:14:57,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 419 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:14:57,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-17 00:14:57,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 415. [2025-03-17 00:14:57,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 298 states have (on average 1.4429530201342282) internal successors, (430), 298 states have internal predecessors, (430), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-17 00:14:57,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 654 transitions. [2025-03-17 00:14:57,906 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 654 transitions. Word has length 179 [2025-03-17 00:14:57,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:14:57,906 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 654 transitions. [2025-03-17 00:14:57,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:14:57,907 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 654 transitions. [2025-03-17 00:14:57,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-17 00:14:57,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:14:57,910 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:14:57,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:14:57,910 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:14:57,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:14:57,911 INFO L85 PathProgramCache]: Analyzing trace with hash -825329437, now seen corresponding path program 1 times [2025-03-17 00:14:57,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:14:57,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338384291] [2025-03-17 00:14:57,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:14:57,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:14:57,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-17 00:14:57,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-17 00:14:57,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:14:57,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:14:58,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 00:14:58,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:14:58,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338384291] [2025-03-17 00:14:58,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338384291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:14:58,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:14:58,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 00:14:58,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572934897] [2025-03-17 00:14:58,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:14:58,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 00:14:58,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:14:58,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 00:14:58,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:14:58,292 INFO L87 Difference]: Start difference. First operand 415 states and 654 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 00:14:58,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:14:58,847 INFO L93 Difference]: Finished difference Result 1253 states and 1977 transitions. [2025-03-17 00:14:58,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 00:14:58,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 180 [2025-03-17 00:14:58,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:14:58,857 INFO L225 Difference]: With dead ends: 1253 [2025-03-17 00:14:58,857 INFO L226 Difference]: Without dead ends: 1045 [2025-03-17 00:14:58,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:14:58,860 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 423 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:14:58,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 664 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:14:58,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2025-03-17 00:14:58,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1033. [2025-03-17 00:14:58,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 742 states have (on average 1.4501347708894878) internal successors, (1076), 742 states have internal predecessors, (1076), 280 states have call successors, (280), 10 states have call predecessors, (280), 10 states have return successors, (280), 280 states have call predecessors, (280), 280 states have call successors, (280) [2025-03-17 00:14:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1636 transitions. [2025-03-17 00:14:58,970 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1636 transitions. Word has length 180 [2025-03-17 00:14:58,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:14:58,970 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1636 transitions. [2025-03-17 00:14:58,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 00:14:58,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1636 transitions. [2025-03-17 00:14:58,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-17 00:14:58,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:14:58,974 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:14:58,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:14:58,974 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:14:58,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:14:58,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1702147100, now seen corresponding path program 1 times [2025-03-17 00:14:58,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:14:58,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168282086] [2025-03-17 00:14:58,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:14:58,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:14:58,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-17 00:14:59,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-17 00:14:59,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:14:59,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:15:00,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 42 proven. 39 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-17 00:15:00,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:15:00,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168282086] [2025-03-17 00:15:00,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168282086] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:15:00,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990446554] [2025-03-17 00:15:00,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:15:00,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:15:00,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:15:00,131 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) [2025-03-17 00:15:00,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 00:15:00,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-17 00:15:00,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-17 00:15:00,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:15:00,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:15:00,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 00:15:00,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:15:01,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 950 proven. 138 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-03-17 00:15:01,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:15:02,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 87 proven. 147 refuted. 0 times theorem prover too weak. 1278 trivial. 0 not checked. [2025-03-17 00:15:02,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990446554] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:15:02,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:15:02,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 12] total 25 [2025-03-17 00:15:02,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703259661] [2025-03-17 00:15:02,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:15:02,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 00:15:02,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:15:02,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 00:15:02,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2025-03-17 00:15:02,266 INFO L87 Difference]: Start difference. First operand 1033 states and 1636 transitions. Second operand has 25 states, 25 states have (on average 4.88) internal successors, (122), 25 states have internal predecessors, (122), 8 states have call successors, (70), 4 states have call predecessors, (70), 10 states have return successors, (72), 8 states have call predecessors, (72), 8 states have call successors, (72) [2025-03-17 00:15:03,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:15:03,560 INFO L93 Difference]: Finished difference Result 2087 states and 3180 transitions. [2025-03-17 00:15:03,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 00:15:03,561 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.88) internal successors, (122), 25 states have internal predecessors, (122), 8 states have call successors, (70), 4 states have call predecessors, (70), 10 states have return successors, (72), 8 states have call predecessors, (72), 8 states have call successors, (72) Word has length 180 [2025-03-17 00:15:03,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:15:03,567 INFO L225 Difference]: With dead ends: 2087 [2025-03-17 00:15:03,567 INFO L226 Difference]: Without dead ends: 1055 [2025-03-17 00:15:03,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=655, Invalid=1601, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 00:15:03,570 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 1294 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 00:15:03,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1294 Valid, 659 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 00:15:03,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2025-03-17 00:15:03,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1011. [2025-03-17 00:15:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 770 states have (on average 1.3896103896103895) internal successors, (1070), 776 states have internal predecessors, (1070), 204 states have call successors, (204), 36 states have call predecessors, (204), 36 states have return successors, (204), 198 states have call predecessors, (204), 204 states have call successors, (204) [2025-03-17 00:15:03,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1478 transitions. [2025-03-17 00:15:03,650 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1478 transitions. Word has length 180 [2025-03-17 00:15:03,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:15:03,650 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1478 transitions. [2025-03-17 00:15:03,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.88) internal successors, (122), 25 states have internal predecessors, (122), 8 states have call successors, (70), 4 states have call predecessors, (70), 10 states have return successors, (72), 8 states have call predecessors, (72), 8 states have call successors, (72) [2025-03-17 00:15:03,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1478 transitions. [2025-03-17 00:15:03,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-17 00:15:03,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:15:03,654 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:15:03,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 00:15:03,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 00:15:03,855 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:15:03,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:15:03,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1240370282, now seen corresponding path program 1 times [2025-03-17 00:15:03,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:15:03,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136743821] [2025-03-17 00:15:03,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:15:03,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:15:03,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-17 00:15:03,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-17 00:15:03,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:15:03,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:15:04,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 00:15:04,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:15:04,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136743821] [2025-03-17 00:15:04,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136743821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:15:04,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:15:04,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 00:15:04,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972803802] [2025-03-17 00:15:04,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:15:04,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 00:15:04,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:15:04,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 00:15:04,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:15:04,028 INFO L87 Difference]: Start difference. First operand 1011 states and 1478 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:15:04,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:15:04,244 INFO L93 Difference]: Finished difference Result 1529 states and 2242 transitions. [2025-03-17 00:15:04,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:15:04,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 181 [2025-03-17 00:15:04,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:15:04,252 INFO L225 Difference]: With dead ends: 1529 [2025-03-17 00:15:04,252 INFO L226 Difference]: Without dead ends: 1021 [2025-03-17 00:15:04,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:15:04,254 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 173 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:15:04,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 519 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:15:04,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2025-03-17 00:15:04,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 683. [2025-03-17 00:15:04,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 522 states have (on average 1.3908045977011494) internal successors, (726), 526 states have internal predecessors, (726), 136 states have call successors, (136), 24 states have call predecessors, (136), 24 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-17 00:15:04,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 998 transitions. [2025-03-17 00:15:04,328 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 998 transitions. Word has length 181 [2025-03-17 00:15:04,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:15:04,329 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 998 transitions. [2025-03-17 00:15:04,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:15:04,329 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 998 transitions. [2025-03-17 00:15:04,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-17 00:15:04,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:15:04,330 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:15:04,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:15:04,331 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:15:04,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:15:04,331 INFO L85 PathProgramCache]: Analyzing trace with hash -361282941, now seen corresponding path program 1 times [2025-03-17 00:15:04,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:15:04,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755282166] [2025-03-17 00:15:04,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:15:04,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:15:04,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-17 00:15:04,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-17 00:15:04,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:15:04,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:15:04,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 00:15:04,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:15:04,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755282166] [2025-03-17 00:15:04,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755282166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:15:04,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:15:04,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:15:04,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778138711] [2025-03-17 00:15:04,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:15:04,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:15:04,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:15:04,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:15:04,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:15:04,483 INFO L87 Difference]: Start difference. First operand 683 states and 998 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:15:04,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:15:04,764 INFO L93 Difference]: Finished difference Result 1407 states and 2051 transitions. [2025-03-17 00:15:04,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:15:04,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 181 [2025-03-17 00:15:04,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:15:04,774 INFO L225 Difference]: With dead ends: 1407 [2025-03-17 00:15:04,774 INFO L226 Difference]: Without dead ends: 1235 [2025-03-17 00:15:04,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:15:04,777 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 155 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:15:04,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 519 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 00:15:04,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2025-03-17 00:15:04,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 989. [2025-03-17 00:15:04,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 748 states have (on average 1.3770053475935828) internal successors, (1030), 754 states have internal predecessors, (1030), 204 states have call successors, (204), 36 states have call predecessors, (204), 36 states have return successors, (204), 198 states have call predecessors, (204), 204 states have call successors, (204) [2025-03-17 00:15:04,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1438 transitions. [2025-03-17 00:15:04,861 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1438 transitions. Word has length 181 [2025-03-17 00:15:04,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:15:04,861 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1438 transitions. [2025-03-17 00:15:04,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:15:04,861 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1438 transitions. [2025-03-17 00:15:04,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-17 00:15:04,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:15:04,863 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:15:04,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:15:04,864 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:15:04,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:15:04,865 INFO L85 PathProgramCache]: Analyzing trace with hash -631836214, now seen corresponding path program 1 times [2025-03-17 00:15:04,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:15:04,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724473414] [2025-03-17 00:15:04,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:15:04,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:15:04,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-17 00:15:04,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-17 00:15:04,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:15:04,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:15:05,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 00:15:05,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:15:05,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724473414] [2025-03-17 00:15:05,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724473414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:15:05,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:15:05,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:15:05,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141252920] [2025-03-17 00:15:05,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:15:05,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:15:05,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:15:05,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:15:05,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:15:05,065 INFO L87 Difference]: Start difference. First operand 989 states and 1438 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:15:05,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:15:05,362 INFO L93 Difference]: Finished difference Result 2158 states and 3149 transitions. [2025-03-17 00:15:05,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:15:05,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 181 [2025-03-17 00:15:05,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:15:05,371 INFO L225 Difference]: With dead ends: 2158 [2025-03-17 00:15:05,372 INFO L226 Difference]: Without dead ends: 1659 [2025-03-17 00:15:05,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:15:05,376 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 259 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:15:05,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 586 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 00:15:05,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2025-03-17 00:15:05,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1536. [2025-03-17 00:15:05,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1536 states, 1163 states have (on average 1.3834909716251076) internal successors, (1609), 1169 states have internal predecessors, (1609), 316 states have call successors, (316), 56 states have call predecessors, (316), 56 states have return successors, (316), 310 states have call predecessors, (316), 316 states have call successors, (316) [2025-03-17 00:15:05,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 2241 transitions. [2025-03-17 00:15:05,511 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 2241 transitions. Word has length 181 [2025-03-17 00:15:05,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:15:05,512 INFO L471 AbstractCegarLoop]: Abstraction has 1536 states and 2241 transitions. [2025-03-17 00:15:05,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:15:05,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 2241 transitions. [2025-03-17 00:15:05,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-17 00:15:05,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:15:05,515 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:15:05,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:15:05,515 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:15:05,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:15:05,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1795119052, now seen corresponding path program 1 times [2025-03-17 00:15:05,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:15:05,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495562032] [2025-03-17 00:15:05,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:15:05,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:15:05,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-17 00:15:05,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-17 00:15:05,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:15:05,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:15:05,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 00:15:05,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:15:05,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495562032] [2025-03-17 00:15:05,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495562032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:15:05,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:15:05,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 00:15:05,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367570110] [2025-03-17 00:15:05,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:15:05,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 00:15:05,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:15:05,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 00:15:05,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:15:05,793 INFO L87 Difference]: Start difference. First operand 1536 states and 2241 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 00:15:06,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:15:06,388 INFO L93 Difference]: Finished difference Result 3450 states and 5027 transitions. [2025-03-17 00:15:06,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 00:15:06,389 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 181 [2025-03-17 00:15:06,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:15:06,399 INFO L225 Difference]: With dead ends: 3450 [2025-03-17 00:15:06,399 INFO L226 Difference]: Without dead ends: 1915 [2025-03-17 00:15:06,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-17 00:15:06,404 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 436 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:15:06,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 726 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:15:06,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2025-03-17 00:15:06,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1895. [2025-03-17 00:15:06,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1895 states, 1442 states have (on average 1.3828016643550625) internal successors, (1994), 1450 states have internal predecessors, (1994), 384 states have call successors, (384), 68 states have call predecessors, (384), 68 states have return successors, (384), 376 states have call predecessors, (384), 384 states have call successors, (384) [2025-03-17 00:15:06,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 2762 transitions. [2025-03-17 00:15:06,546 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 2762 transitions. Word has length 181 [2025-03-17 00:15:06,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:15:06,547 INFO L471 AbstractCegarLoop]: Abstraction has 1895 states and 2762 transitions. [2025-03-17 00:15:06,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 00:15:06,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2762 transitions. [2025-03-17 00:15:06,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-17 00:15:06,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:15:06,552 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:15:06,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:15:06,552 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:15:06,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:15:06,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1953542650, now seen corresponding path program 1 times [2025-03-17 00:15:06,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:15:06,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105000691] [2025-03-17 00:15:06,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:15:06,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:15:06,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-17 00:15:06,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-17 00:15:06,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:15:06,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:15:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 00:15:06,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:15:06,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105000691] [2025-03-17 00:15:06,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105000691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:15:06,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:15:06,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 00:15:06,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455111653] [2025-03-17 00:15:06,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:15:06,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 00:15:06,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:15:06,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 00:15:06,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:15:06,808 INFO L87 Difference]: Start difference. First operand 1895 states and 2762 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 00:15:07,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:15:07,288 INFO L93 Difference]: Finished difference Result 2911 states and 4253 transitions. [2025-03-17 00:15:07,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 00:15:07,289 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 182 [2025-03-17 00:15:07,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:15:07,300 INFO L225 Difference]: With dead ends: 2911 [2025-03-17 00:15:07,300 INFO L226 Difference]: Without dead ends: 1911 [2025-03-17 00:15:07,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:15:07,304 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 391 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:15:07,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 682 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:15:07,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2025-03-17 00:15:07,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1887. [2025-03-17 00:15:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1887 states, 1434 states have (on average 1.3821478382147838) internal successors, (1982), 1442 states have internal predecessors, (1982), 384 states have call successors, (384), 68 states have call predecessors, (384), 68 states have return successors, (384), 376 states have call predecessors, (384), 384 states have call successors, (384) [2025-03-17 00:15:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 2750 transitions. [2025-03-17 00:15:07,476 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 2750 transitions. Word has length 182 [2025-03-17 00:15:07,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:15:07,477 INFO L471 AbstractCegarLoop]: Abstraction has 1887 states and 2750 transitions. [2025-03-17 00:15:07,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 00:15:07,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2750 transitions. [2025-03-17 00:15:07,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-17 00:15:07,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:15:07,479 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:15:07,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 00:15:07,479 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:15:07,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:15:07,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1841068500, now seen corresponding path program 1 times [2025-03-17 00:15:07,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:15:07,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968834672] [2025-03-17 00:15:07,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:15:07,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:15:07,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-17 00:15:07,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-17 00:15:07,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:15:07,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 00:15:07,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [731566100] [2025-03-17 00:15:07,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:15:07,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:15:07,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:15:07,541 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) [2025-03-17 00:15:07,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 00:15:07,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-17 00:15:07,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-17 00:15:07,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:15:07,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 00:15:07,648 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 00:15:07,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-17 00:15:07,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-17 00:15:07,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:15:07,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 00:15:07,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 00:15:07,774 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 00:15:07,775 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 00:15:07,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 00:15:07,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:15:07,986 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:15:08,089 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 00:15:08,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 12:15:08 BoogieIcfgContainer [2025-03-17 00:15:08,093 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 00:15:08,094 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 00:15:08,094 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 00:15:08,094 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 00:15:08,094 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:14:55" (3/4) ... [2025-03-17 00:15:08,096 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 00:15:08,097 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 00:15:08,098 INFO L158 Benchmark]: Toolchain (without parser) took 13028.39ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 106.0MB in the beginning and 367.9MB in the end (delta: -261.9MB). Peak memory consumption was 115.3MB. Max. memory is 16.1GB. [2025-03-17 00:15:08,099 INFO L158 Benchmark]: CDTParser took 0.90ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 00:15:08,099 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.89ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 90.6MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 00:15:08,099 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.83ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 86.0MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 00:15:08,099 INFO L158 Benchmark]: Boogie Preprocessor took 56.32ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 80.4MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 00:15:08,099 INFO L158 Benchmark]: IcfgBuilder took 450.34ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 48.6MB in the end (delta: 31.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 00:15:08,100 INFO L158 Benchmark]: TraceAbstraction took 12205.96ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 48.6MB in the beginning and 368.0MB in the end (delta: -319.4MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2025-03-17 00:15:08,100 INFO L158 Benchmark]: Witness Printer took 3.64ms. Allocated memory is still 520.1MB. Free memory was 368.0MB in the beginning and 367.9MB in the end (delta: 105.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 00:15:08,101 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.90ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.89ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 90.6MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.83ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 86.0MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.32ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 80.4MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 450.34ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 48.6MB in the end (delta: 31.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12205.96ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 48.6MB in the beginning and 368.0MB in the end (delta: -319.4MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * Witness Printer took 3.64ms. Allocated memory is still 520.1MB. Free memory was 368.0MB in the beginning and 367.9MB in the end (delta: 105.2kB). 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 61, overapproximation of someBinaryFLOATComparisonOperation at line 155, overapproximation of bitwiseOr at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 168, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 168, overapproximation of someBinaryDOUBLEComparisonOperation at line 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 132. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -64; [L23] unsigned char var_1_3 = 1; [L24] signed char var_1_5 = -32; [L25] unsigned short int var_1_6 = 256; [L26] unsigned long int var_1_10 = 256; [L27] double var_1_12 = 8.2; [L28] signed char var_1_13 = 16; [L29] signed char var_1_14 = 10; [L30] double var_1_15 = 199.125; [L31] double var_1_16 = 9.4; [L32] double var_1_17 = 9999999999999.6; [L33] unsigned char var_1_20 = 32; [L34] unsigned char var_1_21 = 128; [L35] unsigned char var_1_22 = 64; [L36] unsigned long int var_1_23 = 64; [L37] unsigned long int var_1_24 = 5; [L38] unsigned short int var_1_25 = 2; [L39] unsigned short int var_1_26 = 1; [L40] unsigned short int var_1_27 = 64; [L41] signed long int var_1_28 = -4; [L42] unsigned long int var_1_29 = 10; [L43] unsigned char var_1_30 = 4; [L44] unsigned char var_1_31 = 16; [L45] signed long int var_1_32 = 8; [L46] float var_1_33 = 24.55; [L47] signed long int var_1_34 = 5; [L48] unsigned short int var_1_35 = 256; [L49] unsigned char var_1_36 = 0; [L50] unsigned long int last_1_var_1_10 = 256; [L51] unsigned char last_1_var_1_20 = 32; [L172] isInitial = 1 [L173] FCALL initially() [L174] COND TRUE 1 [L175] CALL updateLastVariables() [L164] last_1_var_1_10 = var_1_10 [L165] last_1_var_1_20 = var_1_20 [L175] RET updateLastVariables() [L176] CALL updateVariables() [L119] var_1_3 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_5=-32, var_1_6=256] [L120] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_5=-32, var_1_6=256] [L121] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-32, var_1_6=256] [L121] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-32, var_1_6=256] [L122] var_1_5 = __VERIFIER_nondet_char() [L123] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L123] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L124] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L124] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L125] var_1_13 = __VERIFIER_nondet_char() [L126] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L126] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L127] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L127] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L128] var_1_14 = __VERIFIER_nondet_char() [L129] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L129] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L130] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L130] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L131] var_1_15 = __VERIFIER_nondet_double() [L132] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L132] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L133] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L133] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L134] var_1_16 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L135] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L136] var_1_21 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L137] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L138] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L138] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L139] var_1_22 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L140] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L141] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L141] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L142] var_1_25 = __VERIFIER_nondet_ushort() [L143] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L143] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L144] CALL assume_abort_if_not(var_1_25 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L144] RET assume_abort_if_not(var_1_25 <= 65535) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L145] var_1_26 = __VERIFIER_nondet_ushort() [L146] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L146] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L147] CALL assume_abort_if_not(var_1_26 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L147] RET assume_abort_if_not(var_1_26 <= 65535) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L148] var_1_27 = __VERIFIER_nondet_ushort() [L149] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L149] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L150] CALL assume_abort_if_not(var_1_27 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L150] RET assume_abort_if_not(var_1_27 <= 65535) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L151] var_1_31 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L152] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L153] CALL assume_abort_if_not(var_1_31 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L153] RET assume_abort_if_not(var_1_31 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L154] var_1_33 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_33 >= -922337.2036854776000e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L155] RET assume_abort_if_not((var_1_33 >= -922337.2036854776000e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L156] var_1_34 = __VERIFIER_nondet_long() [L157] CALL assume_abort_if_not(var_1_34 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L157] RET assume_abort_if_not(var_1_34 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L158] CALL assume_abort_if_not(var_1_34 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L158] RET assume_abort_if_not(var_1_34 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L159] var_1_36 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_3=0, var_1_5=-126, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_3=0, var_1_5=-126, var_1_6=256] [L160] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_3=0, var_1_5=-126, var_1_6=256] [L161] CALL assume_abort_if_not(var_1_36 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L161] RET assume_abort_if_not(var_1_36 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L176] RET updateVariables() [L177] CALL step() [L55] COND TRUE var_1_25 >= ((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27))) [L56] var_1_24 = var_1_26 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L58] var_1_28 = var_1_27 [L59] var_1_29 = var_1_26 [L60] var_1_30 = var_1_31 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L61] COND FALSE !(((((1.25f) < 0 ) ? -(1.25f) : (1.25f))) != var_1_33) [L68] var_1_32 = var_1_30 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L70] COND FALSE !(\read(var_1_36)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L73] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L78] signed long int stepLocal_2 = var_1_5 * var_1_13; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_2=-16002, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L79] COND TRUE stepLocal_2 > last_1_var_1_10 [L80] var_1_20 = ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=67, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L82] COND TRUE (((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=67, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L83] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=67, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L87] unsigned char stepLocal_1 = var_1_17 <= var_1_17; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_1=0, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=67, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L88] COND FALSE !(stepLocal_1 || var_1_3) [L93] var_1_12 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=62, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=67, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L95] COND FALSE !(99999.8f < var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=62, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=67, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L106] COND FALSE !((var_1_17 + var_1_12) <= var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=62, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=67, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L111] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=62, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=67, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L111] unsigned long int stepLocal_0 = (var_1_6 ^ var_1_20) + var_1_23; [L112] COND FALSE !(var_1_20 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=62, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=67, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L177] RET step() [L178] CALL, EXPR property() [L168] EXPR (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=62, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=67, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L168-L169] return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1) ; [L178] RET, EXPR property() [L178] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=62, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=67, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=62, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=67, var_1_21=128, var_1_22=59, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-126, var_1_6=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 191 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.1s, OverallIterations: 12, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3411 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3411 mSDsluCounter, 5559 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3719 mSDsCounter, 1162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2293 IncrementalHoareTripleChecker+Invalid, 3455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1162 mSolverCounterUnsat, 1840 mSDtfsCounter, 2293 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 648 GetRequests, 553 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1895occurred in iteration=10, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 855 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 2702 NumberOfCodeBlocks, 2702 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2504 ConstructedInterpolants, 0 QuantifiedInterpolants, 9395 SizeOfPredicates, 7 NumberOfNonLiveVariables, 828 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 20790/21168 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 00:15:08,134 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/21.0.5-tem/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.6.800.v20240513-1750.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_fillercodesize_ps-cn-25_file-3.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 fcab9d14a39efb8d0bba4b7e607a800a4978f63d5ac50f5af469476854f605eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:15:10,026 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:15:10,114 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 00:15:10,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:15:10,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:15:10,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:15:10,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:15:10,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:15:10,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:15:10,137 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:15:10,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:15:10,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:15:10,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:15:10,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:15:10,137 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:15:10,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:15:10,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:15:10,138 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:15:10,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:15:10,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:15:10,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:15:10,138 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:15:10,138 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:15:10,138 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 00:15:10,138 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 00:15:10,138 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 00:15:10,138 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:15:10,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:15:10,138 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:15:10,139 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:15:10,139 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:15:10,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:15:10,139 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:15:10,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:15:10,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:15:10,139 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:15:10,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:15:10,139 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:15:10,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:15:10,139 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 00:15:10,139 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 00:15:10,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:15:10,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:15:10,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:15:10,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:15:10,139 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> fcab9d14a39efb8d0bba4b7e607a800a4978f63d5ac50f5af469476854f605eb [2025-03-17 00:15:10,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:15:10,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:15:10,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:15:10,404 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:15:10,404 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:15:10,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i [2025-03-17 00:15:11,587 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/148187b06/2545d85e78d44a80a389681af7189f2e/FLAG152215d6f [2025-03-17 00:15:11,808 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:15:11,809 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i [2025-03-17 00:15:11,818 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/148187b06/2545d85e78d44a80a389681af7189f2e/FLAG152215d6f [2025-03-17 00:15:11,836 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/148187b06/2545d85e78d44a80a389681af7189f2e [2025-03-17 00:15:11,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:15:11,839 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:15:11,840 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:15:11,840 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:15:11,844 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:15:11,844 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:15:11" (1/1) ... [2025-03-17 00:15:11,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@469f2ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:11, skipping insertion in model container [2025-03-17 00:15:11,847 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:15:11" (1/1) ... [2025-03-17 00:15:11,866 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:15:11,972 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_fillercodesize_ps-cn-25_file-3.i[914,927] [2025-03-17 00:15:12,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:15:12,027 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:15:12,035 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_fillercodesize_ps-cn-25_file-3.i[914,927] [2025-03-17 00:15:12,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:15:12,081 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:15:12,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:12 WrapperNode [2025-03-17 00:15:12,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:15:12,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:15:12,083 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:15:12,083 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:15:12,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:12" (1/1) ... [2025-03-17 00:15:12,098 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:12" (1/1) ... [2025-03-17 00:15:12,118 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2025-03-17 00:15:12,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:15:12,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:15:12,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:15:12,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:15:12,126 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:12" (1/1) ... [2025-03-17 00:15:12,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:12" (1/1) ... [2025-03-17 00:15:12,128 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:12" (1/1) ... [2025-03-17 00:15:12,143 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]. [2025-03-17 00:15:12,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:12" (1/1) ... [2025-03-17 00:15:12,144 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:12" (1/1) ... [2025-03-17 00:15:12,151 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:12" (1/1) ... [2025-03-17 00:15:12,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:12" (1/1) ... [2025-03-17 00:15:12,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:12" (1/1) ... [2025-03-17 00:15:12,157 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:12" (1/1) ... [2025-03-17 00:15:12,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:15:12,162 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:15:12,162 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:15:12,162 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:15:12,163 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:12" (1/1) ... [2025-03-17 00:15:12,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:15:12,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:15:12,186 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) [2025-03-17 00:15:12,189 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 [2025-03-17 00:15:12,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:15:12,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 00:15:12,207 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:15:12,207 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:15:12,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:15:12,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:15:12,286 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:15:12,287 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:15:28,961 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 00:15:28,961 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:15:28,968 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:15:28,968 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:15:28,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:15:28 BoogieIcfgContainer [2025-03-17 00:15:28,968 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:15:28,970 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:15:28,970 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:15:28,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:15:28,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:15:11" (1/3) ... [2025-03-17 00:15:28,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d10c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:15:28, skipping insertion in model container [2025-03-17 00:15:28,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:12" (2/3) ... [2025-03-17 00:15:28,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d10c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:15:28, skipping insertion in model container [2025-03-17 00:15:28,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:15:28" (3/3) ... [2025-03-17 00:15:28,975 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-3.i [2025-03-17 00:15:28,985 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:15:28,986 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-3.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:15:29,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:15:29,032 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;@6bf8663, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:15:29,033 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:15:29,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 00:15:29,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-17 00:15:29,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:15:29,046 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:15:29,047 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:15:29,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:15:29,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1066044138, now seen corresponding path program 1 times [2025-03-17 00:15:29,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:15:29,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575276885] [2025-03-17 00:15:29,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:15:29,058 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 [2025-03-17 00:15:29,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:15:29,060 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) [2025-03-17 00:15:29,062 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 [2025-03-17 00:15:29,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-17 00:15:29,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-17 00:15:29,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:15:29,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:15:30,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 00:15:30,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:15:35,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 00:15:35,213 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:15:35,214 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:15:35,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575276885] [2025-03-17 00:15:35,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575276885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:15:35,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:15:35,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:15:35,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819275469] [2025-03-17 00:15:35,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:15:35,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:15:35,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:15:35,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:15:35,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:15:35,233 INFO L87 Difference]: Start difference. First operand has 79 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:15:39,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:15:42,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:15:45,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:15:50,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:15:54,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:15:59,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:16:03,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:16:07,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:16:11,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:16:15,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:16:15,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:16:15,578 INFO L93 Difference]: Finished difference Result 231 states and 433 transitions. [2025-03-17 00:16:15,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:16:15,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 174 [2025-03-17 00:16:15,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:16:15,709 INFO L225 Difference]: With dead ends: 231 [2025-03-17 00:16:15,709 INFO L226 Difference]: Without dead ends: 153 [2025-03-17 00:16:15,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:16:15,715 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 34 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:16:15,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 359 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 7 Unknown, 0 Unchecked, 40.2s Time] [2025-03-17 00:16:15,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-17 00:16:15,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2025-03-17 00:16:15,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 92 states have (on average 1.3804347826086956) internal successors, (127), 92 states have internal predecessors, (127), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 00:16:15,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 239 transitions. [2025-03-17 00:16:15,770 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 239 transitions. Word has length 174 [2025-03-17 00:16:15,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:16:15,771 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 239 transitions. [2025-03-17 00:16:15,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:16:15,771 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 239 transitions. [2025-03-17 00:16:15,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-17 00:16:15,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:16:15,773 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:16:15,799 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 [2025-03-17 00:16:15,973 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 [2025-03-17 00:16:15,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:16:15,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:16:15,974 INFO L85 PathProgramCache]: Analyzing trace with hash 527245944, now seen corresponding path program 1 times [2025-03-17 00:16:15,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:16:15,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454112045] [2025-03-17 00:16:15,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:16:15,975 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 [2025-03-17 00:16:15,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:16:15,977 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) [2025-03-17 00:16:15,977 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 [2025-03-17 00:16:16,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-17 00:16:16,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-17 00:16:16,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:16:16,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:16:16,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 00:16:16,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:16:17,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 00:16:17,042 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:16:17,042 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:16:17,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454112045] [2025-03-17 00:16:17,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [454112045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:16:17,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:16:17,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:16:17,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169632290] [2025-03-17 00:16:17,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:16:17,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:16:17,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:16:17,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:16:17,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:16:17,044 INFO L87 Difference]: Start difference. First operand 151 states and 239 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:16:21,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:16:25,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:16:25,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:16:25,637 INFO L93 Difference]: Finished difference Result 339 states and 534 transitions. [2025-03-17 00:16:25,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:16:25,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 175 [2025-03-17 00:16:25,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:16:25,640 INFO L225 Difference]: With dead ends: 339 [2025-03-17 00:16:25,640 INFO L226 Difference]: Without dead ends: 189 [2025-03-17 00:16:25,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:16:25,641 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 25 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-03-17 00:16:25,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 236 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2025-03-17 00:16:25,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-17 00:16:25,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2025-03-17 00:16:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 109 states have (on average 1.385321100917431) internal successors, (151), 109 states have internal predecessors, (151), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 00:16:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 263 transitions. [2025-03-17 00:16:25,660 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 263 transitions. Word has length 175 [2025-03-17 00:16:25,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:16:25,661 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 263 transitions. [2025-03-17 00:16:25,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:16:25,662 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 263 transitions. [2025-03-17 00:16:25,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-17 00:16:25,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:16:25,663 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:16:25,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 00:16:25,863 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 [2025-03-17 00:16:25,864 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:16:25,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:16:25,864 INFO L85 PathProgramCache]: Analyzing trace with hash 10049993, now seen corresponding path program 1 times [2025-03-17 00:16:25,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:16:25,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105341082] [2025-03-17 00:16:25,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:16:25,865 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 [2025-03-17 00:16:25,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:16:25,867 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) [2025-03-17 00:16:25,868 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 [2025-03-17 00:16:25,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 00:16:26,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 00:16:26,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:16:26,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:16:26,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 00:16:26,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:16:27,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 00:16:27,134 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:16:27,134 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:16:27,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105341082] [2025-03-17 00:16:27,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105341082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:16:27,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:16:27,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:16:27,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056717746] [2025-03-17 00:16:27,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:16:27,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:16:27,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:16:27,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:16:27,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:16:27,136 INFO L87 Difference]: Start difference. First operand 168 states and 263 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)