./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_fillercodestructure_filler-pr-co_file-9.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 6dd6d776f9e66c8cc025ab32529fca2ff2ccbfe84cc1f436072541a4cb2f09b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:33:02,095 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:33:02,150 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:33:02,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:33:02,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:33:02,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:33:02,178 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:33:02,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:33:02,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:33:02,178 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:33:02,178 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:33:02,178 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:33:02,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:33:02,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:33:02,179 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:33:02,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:33:02,179 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:33:02,179 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:33:02,179 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:33:02,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:33:02,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:33:02,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:33:02,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:33:02,180 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:33:02,180 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:33:02,180 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:33:02,180 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:33:02,180 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:33:02,180 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:33:02,180 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:33:02,180 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:33:02,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:33:02,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:33:02,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:33:02,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:33:02,180 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:33:02,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:33:02,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:33:02,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:33:02,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:33:02,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:33:02,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:33:02,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:33:02,181 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 -> 6dd6d776f9e66c8cc025ab32529fca2ff2ccbfe84cc1f436072541a4cb2f09b4 [2025-03-03 21:33:02,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:33:02,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:33:02,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:33:02,420 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:33:02,421 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:33:02,423 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-9.i [2025-03-03 21:33:03,563 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65109c6cd/ade64b47af514b53b53813a6d0f4cf1a/FLAG8a7658325 [2025-03-03 21:33:03,810 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:33:03,811 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-9.i [2025-03-03 21:33:03,817 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65109c6cd/ade64b47af514b53b53813a6d0f4cf1a/FLAG8a7658325 [2025-03-03 21:33:04,137 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65109c6cd/ade64b47af514b53b53813a6d0f4cf1a [2025-03-03 21:33:04,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:33:04,139 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:33:04,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:33:04,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:33:04,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:33:04,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:33:04" (1/1) ... [2025-03-03 21:33:04,144 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e439fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:04, skipping insertion in model container [2025-03-03 21:33:04,144 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:33:04" (1/1) ... [2025-03-03 21:33:04,157 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:33:04,255 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-9.i[918,931] [2025-03-03 21:33:04,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:33:04,335 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:33:04,343 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-9.i[918,931] [2025-03-03 21:33:04,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:33:04,397 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:33:04,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:04 WrapperNode [2025-03-03 21:33:04,398 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:33:04,399 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:33:04,399 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:33:04,399 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:33:04,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:04" (1/1) ... [2025-03-03 21:33:04,415 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:04" (1/1) ... [2025-03-03 21:33:04,453 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 265 [2025-03-03 21:33:04,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:33:04,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:33:04,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:33:04,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:33:04,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:04" (1/1) ... [2025-03-03 21:33:04,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:04" (1/1) ... [2025-03-03 21:33:04,467 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:04" (1/1) ... [2025-03-03 21:33:04,481 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-03 21:33:04,481 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:04" (1/1) ... [2025-03-03 21:33:04,481 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:04" (1/1) ... [2025-03-03 21:33:04,486 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:04" (1/1) ... [2025-03-03 21:33:04,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:04" (1/1) ... [2025-03-03 21:33:04,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:04" (1/1) ... [2025-03-03 21:33:04,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:04" (1/1) ... [2025-03-03 21:33:04,495 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:33:04,496 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:33:04,496 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:33:04,496 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:33:04,501 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:04" (1/1) ... [2025-03-03 21:33:04,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:33:04,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:33:04,524 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-03 21:33:04,526 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-03 21:33:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:33:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:33:04,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:33:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:33:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:33:04,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:33:04,608 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:33:04,610 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:33:04,905 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L197: havoc property_#t~bitwise25#1;havoc property_#t~ite27#1;havoc property_#t~bitwise26#1;havoc property_#t~bitwise28#1;havoc property_#t~short29#1; [2025-03-03 21:33:04,939 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-03 21:33:04,940 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:33:04,961 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:33:04,962 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:33:04,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:33:04 BoogieIcfgContainer [2025-03-03 21:33:04,962 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:33:04,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:33:04,964 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:33:04,967 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:33:04,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:33:04" (1/3) ... [2025-03-03 21:33:04,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30995c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:33:04, skipping insertion in model container [2025-03-03 21:33:04,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:04" (2/3) ... [2025-03-03 21:33:04,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30995c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:33:04, skipping insertion in model container [2025-03-03 21:33:04,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:33:04" (3/3) ... [2025-03-03 21:33:04,969 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-9.i [2025-03-03 21:33:04,979 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:33:04,981 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-9.i that has 2 procedures, 117 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:33:05,014 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:33:05,022 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;@5e9e9164, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:33:05,023 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:33:05,026 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 81 states have (on average 1.4567901234567902) internal successors, (118), 82 states have internal predecessors, (118), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 21:33:05,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-03 21:33:05,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:33:05,038 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:33:05,038 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:33:05,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:33:05,042 INFO L85 PathProgramCache]: Analyzing trace with hash 949075477, now seen corresponding path program 1 times [2025-03-03 21:33:05,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:33:05,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855146148] [2025-03-03 21:33:05,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:33:05,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:33:05,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 21:33:05,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 21:33:05,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:33:05,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:33:05,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-03 21:33:05,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:33:05,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855146148] [2025-03-03 21:33:05,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855146148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:33:05,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971699963] [2025-03-03 21:33:05,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:33:05,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:33:05,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:33:05,304 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-03 21:33:05,305 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-03 21:33:05,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 21:33:05,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 21:33:05,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:33:05,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:33:05,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:33:05,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:33:05,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-03 21:33:05,502 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:33:05,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971699963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:33:05,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:33:05,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:33:05,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602469712] [2025-03-03 21:33:05,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:33:05,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:33:05,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:33:05,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:33:05,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:33:05,527 INFO L87 Difference]: Start difference. First operand has 117 states, 81 states have (on average 1.4567901234567902) internal successors, (118), 82 states have internal predecessors, (118), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-03 21:33:05,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:33:05,569 INFO L93 Difference]: Finished difference Result 227 states and 394 transitions. [2025-03-03 21:33:05,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:33:05,571 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 214 [2025-03-03 21:33:05,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:33:05,577 INFO L225 Difference]: With dead ends: 227 [2025-03-03 21:33:05,577 INFO L226 Difference]: Without dead ends: 113 [2025-03-03 21:33:05,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 215 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-03 21:33:05,584 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:33:05,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:33:05,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-03 21:33:05,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-03 21:33:05,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 21:33:05,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 175 transitions. [2025-03-03 21:33:05,625 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 175 transitions. Word has length 214 [2025-03-03 21:33:05,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:33:05,626 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 175 transitions. [2025-03-03 21:33:05,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-03 21:33:05,626 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 175 transitions. [2025-03-03 21:33:05,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-03 21:33:05,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:33:05,630 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:33:05,637 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-03 21:33:05,835 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-03 21:33:05,835 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:33:05,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:33:05,836 INFO L85 PathProgramCache]: Analyzing trace with hash 460682928, now seen corresponding path program 1 times [2025-03-03 21:33:05,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:33:05,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488615525] [2025-03-03 21:33:05,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:33:05,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:33:05,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 21:33:05,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 21:33:05,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:33:05,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:33:06,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 21:33:06,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:33:06,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488615525] [2025-03-03 21:33:06,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488615525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:33:06,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:33:06,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:33:06,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270730120] [2025-03-03 21:33:06,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:33:06,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:33:06,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:33:06,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:33:06,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:33:06,121 INFO L87 Difference]: Start difference. First operand 113 states and 175 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:33:06,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:33:06,197 INFO L93 Difference]: Finished difference Result 224 states and 349 transitions. [2025-03-03 21:33:06,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:33:06,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-03-03 21:33:06,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:33:06,199 INFO L225 Difference]: With dead ends: 224 [2025-03-03 21:33:06,202 INFO L226 Difference]: Without dead ends: 114 [2025-03-03 21:33:06,203 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-03 21:33:06,203 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:33:06,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 330 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:33:06,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-03 21:33:06,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-03 21:33:06,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 79 states have (on average 1.3924050632911393) internal successors, (110), 79 states have internal predecessors, (110), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 21:33:06,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 176 transitions. [2025-03-03 21:33:06,222 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 176 transitions. Word has length 214 [2025-03-03 21:33:06,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:33:06,223 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 176 transitions. [2025-03-03 21:33:06,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:33:06,224 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 176 transitions. [2025-03-03 21:33:06,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-03 21:33:06,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:33:06,228 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:33:06,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:33:06,229 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:33:06,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:33:06,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1856974196, now seen corresponding path program 1 times [2025-03-03 21:33:06,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:33:06,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362262645] [2025-03-03 21:33:06,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:33:06,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:33:06,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-03 21:33:06,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 21:33:06,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:33:06,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:33:10,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 33 proven. 63 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-03 21:33:10,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:33:10,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362262645] [2025-03-03 21:33:10,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362262645] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:33:10,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047434779] [2025-03-03 21:33:10,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:33:10,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:33:10,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:33:10,440 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-03 21:33:10,442 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-03 21:33:10,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-03 21:33:10,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 21:33:10,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:33:10,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:33:10,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 21:33:10,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:33:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 480 proven. 96 refuted. 0 times theorem prover too weak. 1536 trivial. 0 not checked. [2025-03-03 21:33:11,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:33:11,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-03 21:33:11,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047434779] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:33:11,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:33:11,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6, 6] total 21 [2025-03-03 21:33:11,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121085972] [2025-03-03 21:33:11,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:33:11,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 21:33:11,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:33:11,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 21:33:11,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-03-03 21:33:11,425 INFO L87 Difference]: Start difference. First operand 114 states and 176 transitions. Second operand has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 21 states have internal predecessors, (131), 7 states have call successors, (98), 3 states have call predecessors, (98), 5 states have return successors, (99), 6 states have call predecessors, (99), 7 states have call successors, (99) [2025-03-03 21:33:13,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:33:13,482 INFO L93 Difference]: Finished difference Result 284 states and 435 transitions. [2025-03-03 21:33:13,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 21:33:13,483 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 21 states have internal predecessors, (131), 7 states have call successors, (98), 3 states have call predecessors, (98), 5 states have return successors, (99), 6 states have call predecessors, (99), 7 states have call successors, (99) Word has length 215 [2025-03-03 21:33:13,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:33:13,486 INFO L225 Difference]: With dead ends: 284 [2025-03-03 21:33:13,487 INFO L226 Difference]: Without dead ends: 173 [2025-03-03 21:33:13,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=163, Invalid=707, Unknown=0, NotChecked=0, Total=870 [2025-03-03 21:33:13,488 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 1096 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:33:13,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 554 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 21:33:13,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-03 21:33:13,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 118. [2025-03-03 21:33:13,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 21:33:13,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 178 transitions. [2025-03-03 21:33:13,504 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 178 transitions. Word has length 215 [2025-03-03 21:33:13,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:33:13,505 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 178 transitions. [2025-03-03 21:33:13,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 21 states have internal predecessors, (131), 7 states have call successors, (98), 3 states have call predecessors, (98), 5 states have return successors, (99), 6 states have call predecessors, (99), 7 states have call successors, (99) [2025-03-03 21:33:13,505 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 178 transitions. [2025-03-03 21:33:13,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-03 21:33:13,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:33:13,509 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:33:13,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 21:33:13,710 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,SelfDestructingSolverStorable2 [2025-03-03 21:33:13,710 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:33:13,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:33:13,710 INFO L85 PathProgramCache]: Analyzing trace with hash 399936811, now seen corresponding path program 1 times [2025-03-03 21:33:13,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:33:13,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187652274] [2025-03-03 21:33:13,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:33:13,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:33:13,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-03 21:33:13,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 21:33:13,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:33:13,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:33:15,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 33 proven. 63 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-03 21:33:15,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:33:15,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187652274] [2025-03-03 21:33:15,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187652274] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:33:15,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283298847] [2025-03-03 21:33:15,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:33:15,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:33:15,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:33:15,907 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-03 21:33:15,908 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-03 21:33:15,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-03 21:33:16,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 21:33:16,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:33:16,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:33:16,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 21:33:16,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:33:16,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1016 proven. 60 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2025-03-03 21:33:16,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:33:17,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 21:33:17,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283298847] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 21:33:17,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:33:17,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 11] total 21 [2025-03-03 21:33:17,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731635879] [2025-03-03 21:33:17,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:33:17,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:33:17,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:33:17,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:33:17,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-03-03 21:33:17,712 INFO L87 Difference]: Start difference. First operand 118 states and 178 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:33:22,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-03 21:33:23,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:33:23,920 INFO L93 Difference]: Finished difference Result 471 states and 712 transitions. [2025-03-03 21:33:23,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 21:33:23,922 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 215 [2025-03-03 21:33:23,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:33:23,924 INFO L225 Difference]: With dead ends: 471 [2025-03-03 21:33:23,924 INFO L226 Difference]: Without dead ends: 356 [2025-03-03 21:33:23,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2025-03-03 21:33:23,925 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 478 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-03-03 21:33:23,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 829 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2025-03-03 21:33:23,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-03 21:33:23,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 256. [2025-03-03 21:33:23,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 213 states have (on average 1.483568075117371) internal successors, (316), 214 states have internal predecessors, (316), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 21:33:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 392 transitions. [2025-03-03 21:33:23,957 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 392 transitions. Word has length 215 [2025-03-03 21:33:23,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:33:23,958 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 392 transitions. [2025-03-03 21:33:23,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:33:23,958 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 392 transitions. [2025-03-03 21:33:23,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-03 21:33:23,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:33:23,960 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:33:23,967 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-03 21:33:24,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:33:24,161 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:33:24,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:33:24,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1969534379, now seen corresponding path program 1 times [2025-03-03 21:33:24,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:33:24,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612141673] [2025-03-03 21:33:24,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:33:24,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:33:24,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-03 21:33:24,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 21:33:24,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:33:24,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:33:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 33 proven. 63 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-03 21:33:25,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:33:25,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612141673] [2025-03-03 21:33:25,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612141673] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:33:25,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057269244] [2025-03-03 21:33:25,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:33:25,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:33:25,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:33:25,338 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:33:25,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 21:33:25,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-03 21:33:25,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 21:33:25,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:33:25,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:33:25,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-03 21:33:25,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:33:27,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1458 proven. 231 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2025-03-03 21:33:27,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:33:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 21:33:29,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057269244] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 21:33:29,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:33:29,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9, 23] total 36 [2025-03-03 21:33:29,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341441242] [2025-03-03 21:33:29,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:33:29,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 21:33:29,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:33:29,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 21:33:29,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1036, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 21:33:29,130 INFO L87 Difference]: Start difference. First operand 256 states and 392 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:33:36,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:33:36,704 INFO L93 Difference]: Finished difference Result 995 states and 1527 transitions. [2025-03-03 21:33:36,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 21:33:36,707 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 215 [2025-03-03 21:33:36,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:33:36,711 INFO L225 Difference]: With dead ends: 995 [2025-03-03 21:33:36,711 INFO L226 Difference]: Without dead ends: 742 [2025-03-03 21:33:36,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 406 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=395, Invalid=1675, Unknown=0, NotChecked=0, Total=2070 [2025-03-03 21:33:36,713 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 898 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:33:36,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 1182 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-03-03 21:33:36,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2025-03-03 21:33:36,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 281. [2025-03-03 21:33:36,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 238 states have (on average 1.5) internal successors, (357), 239 states have internal predecessors, (357), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 21:33:36,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 433 transitions. [2025-03-03 21:33:36,742 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 433 transitions. Word has length 215 [2025-03-03 21:33:36,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:33:36,742 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 433 transitions. [2025-03-03 21:33:36,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:33:36,742 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 433 transitions. [2025-03-03 21:33:36,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-03 21:33:36,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:33:36,745 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:33:36,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 21:33:36,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:33:36,946 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:33:36,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:33:36,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1677272532, now seen corresponding path program 1 times [2025-03-03 21:33:36,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:33:36,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012903705] [2025-03-03 21:33:36,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:33:36,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:33:36,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-03 21:33:36,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 21:33:36,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:33:36,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:33:38,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 33 proven. 63 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-03 21:33:38,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:33:38,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012903705] [2025-03-03 21:33:38,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012903705] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:33:38,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702584190] [2025-03-03 21:33:38,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:33:38,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:33:38,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:33:38,165 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:33:38,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 21:33:38,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-03 21:33:38,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 21:33:38,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:33:38,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:33:38,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 21:33:38,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:33:38,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 696 proven. 150 refuted. 0 times theorem prover too weak. 1266 trivial. 0 not checked. [2025-03-03 21:33:38,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:33:39,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 153 refuted. 0 times theorem prover too weak. 1923 trivial. 0 not checked. [2025-03-03 21:33:39,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702584190] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:33:39,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:33:39,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 28 [2025-03-03 21:33:39,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322014735] [2025-03-03 21:33:39,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:33:39,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 21:33:39,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:33:39,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 21:33:39,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2025-03-03 21:33:39,250 INFO L87 Difference]: Start difference. First operand 281 states and 433 transitions. Second operand has 28 states, 28 states have (on average 5.214285714285714) internal successors, (146), 28 states have internal predecessors, (146), 7 states have call successors, (99), 4 states have call predecessors, (99), 8 states have return successors, (99), 7 states have call predecessors, (99), 7 states have call successors, (99) [2025-03-03 21:33:42,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:33:42,841 INFO L93 Difference]: Finished difference Result 1064 states and 1637 transitions. [2025-03-03 21:33:42,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-03 21:33:42,842 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.214285714285714) internal successors, (146), 28 states have internal predecessors, (146), 7 states have call successors, (99), 4 states have call predecessors, (99), 8 states have return successors, (99), 7 states have call predecessors, (99), 7 states have call successors, (99) Word has length 215 [2025-03-03 21:33:42,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:33:42,846 INFO L225 Difference]: With dead ends: 1064 [2025-03-03 21:33:42,846 INFO L226 Difference]: Without dead ends: 786 [2025-03-03 21:33:42,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=548, Invalid=2422, Unknown=0, NotChecked=0, Total=2970 [2025-03-03 21:33:42,848 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 1197 mSDsluCounter, 2095 mSDsCounter, 0 mSdLazyCounter, 2638 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 2295 SdHoareTripleChecker+Invalid, 2954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 2638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:33:42,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 2295 Invalid, 2954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 2638 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 21:33:42,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2025-03-03 21:33:42,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 558. [2025-03-03 21:33:42,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 471 states have (on average 1.494692144373673) internal successors, (704), 473 states have internal predecessors, (704), 76 states have call successors, (76), 10 states have call predecessors, (76), 10 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-03 21:33:42,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 856 transitions. [2025-03-03 21:33:42,887 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 856 transitions. Word has length 215 [2025-03-03 21:33:42,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:33:42,888 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 856 transitions. [2025-03-03 21:33:42,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.214285714285714) internal successors, (146), 28 states have internal predecessors, (146), 7 states have call successors, (99), 4 states have call predecessors, (99), 8 states have return successors, (99), 7 states have call predecessors, (99), 7 states have call successors, (99) [2025-03-03 21:33:42,890 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 856 transitions. [2025-03-03 21:33:42,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-03 21:33:42,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:33:42,891 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:33:42,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 21:33:43,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:33:43,091 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:33:43,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:33:43,093 INFO L85 PathProgramCache]: Analyzing trace with hash 145200266, now seen corresponding path program 1 times [2025-03-03 21:33:43,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:33:43,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708146531] [2025-03-03 21:33:43,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:33:43,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:33:43,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-03 21:33:43,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 21:33:43,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:33:43,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:33:44,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 33 proven. 63 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-03 21:33:44,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:33:44,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708146531] [2025-03-03 21:33:44,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708146531] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:33:44,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494873486] [2025-03-03 21:33:44,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:33:44,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:33:44,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:33:44,027 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:33:44,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 21:33:44,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-03 21:33:44,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 21:33:44,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:33:44,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:33:44,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 21:33:44,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:33:44,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1016 proven. 60 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2025-03-03 21:33:44,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:33:45,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 21:33:45,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494873486] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 21:33:45,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:33:45,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13, 11] total 24 [2025-03-03 21:33:45,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911028149] [2025-03-03 21:33:45,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:33:45,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:33:45,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:33:45,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:33:45,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2025-03-03 21:33:45,298 INFO L87 Difference]: Start difference. First operand 558 states and 856 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:33:46,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:33:46,390 INFO L93 Difference]: Finished difference Result 1336 states and 2048 transitions. [2025-03-03 21:33:46,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 21:33:46,391 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 215 [2025-03-03 21:33:46,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:33:46,394 INFO L225 Difference]: With dead ends: 1336 [2025-03-03 21:33:46,394 INFO L226 Difference]: Without dead ends: 781 [2025-03-03 21:33:46,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2025-03-03 21:33:46,396 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 453 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 21:33:46,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1066 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 21:33:46,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2025-03-03 21:33:46,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 565. [2025-03-03 21:33:46,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 478 states have (on average 1.49163179916318) internal successors, (713), 480 states have internal predecessors, (713), 76 states have call successors, (76), 10 states have call predecessors, (76), 10 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-03 21:33:46,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 865 transitions. [2025-03-03 21:33:46,425 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 865 transitions. Word has length 215 [2025-03-03 21:33:46,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:33:46,426 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 865 transitions. [2025-03-03 21:33:46,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:33:46,426 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 865 transitions. [2025-03-03 21:33:46,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-03 21:33:46,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:33:46,427 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:33:46,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 21:33:46,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:33:46,628 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:33:46,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:33:46,629 INFO L85 PathProgramCache]: Analyzing trace with hash 2070696372, now seen corresponding path program 1 times [2025-03-03 21:33:46,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:33:46,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850458014] [2025-03-03 21:33:46,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:33:46,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:33:46,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-03 21:33:46,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 21:33:46,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:33:46,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:33:47,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 33 proven. 63 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-03 21:33:47,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:33:47,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850458014] [2025-03-03 21:33:47,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850458014] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:33:47,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896580041] [2025-03-03 21:33:47,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:33:47,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:33:47,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:33:47,413 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:33:47,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 21:33:47,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-03 21:33:47,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 21:33:47,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:33:47,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:33:47,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 21:33:47,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:33:48,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1016 proven. 60 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2025-03-03 21:33:48,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:33:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 21:33:48,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896580041] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 21:33:48,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:33:48,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 11] total 23 [2025-03-03 21:33:48,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696055363] [2025-03-03 21:33:48,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:33:48,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:33:48,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:33:48,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:33:48,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2025-03-03 21:33:48,791 INFO L87 Difference]: Start difference. First operand 565 states and 865 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:33:49,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:33:49,745 INFO L93 Difference]: Finished difference Result 1347 states and 2057 transitions. [2025-03-03 21:33:49,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 21:33:49,746 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 215 [2025-03-03 21:33:49,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:33:49,750 INFO L225 Difference]: With dead ends: 1347 [2025-03-03 21:33:49,750 INFO L226 Difference]: Without dead ends: 785 [2025-03-03 21:33:49,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 423 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2025-03-03 21:33:49,752 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 395 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 21:33:49,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 932 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 21:33:49,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2025-03-03 21:33:49,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 500. [2025-03-03 21:33:49,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 413 states have (on average 1.4624697336561743) internal successors, (604), 415 states have internal predecessors, (604), 76 states have call successors, (76), 10 states have call predecessors, (76), 10 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-03 21:33:49,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 756 transitions. [2025-03-03 21:33:49,790 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 756 transitions. Word has length 215 [2025-03-03 21:33:49,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:33:49,793 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 756 transitions. [2025-03-03 21:33:49,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:33:49,793 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 756 transitions. [2025-03-03 21:33:49,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-03 21:33:49,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:33:49,795 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:33:49,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 21:33:49,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:33:49,995 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:33:49,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:33:49,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1922355674, now seen corresponding path program 1 times [2025-03-03 21:33:49,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:33:49,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558205213] [2025-03-03 21:33:49,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:33:49,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:33:50,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-03 21:33:50,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-03 21:33:50,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:33:50,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:33:52,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 33 proven. 63 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-03 21:33:52,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:33:52,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558205213] [2025-03-03 21:33:52,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558205213] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:33:52,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884793902] [2025-03-03 21:33:52,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:33:52,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:33:52,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:33:52,979 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:33:52,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 21:33:53,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-03 21:33:53,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-03 21:33:53,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:33:53,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:33:53,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 21:33:53,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:33:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1016 proven. 60 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2025-03-03 21:33:53,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:33:55,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 21:33:55,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884793902] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 21:33:55,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:33:55,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [20, 11] total 32 [2025-03-03 21:33:55,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310889214] [2025-03-03 21:33:55,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:33:55,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:33:55,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:33:55,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:33:55,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2025-03-03 21:33:55,129 INFO L87 Difference]: Start difference. First operand 500 states and 756 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:33:57,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:33:57,059 INFO L93 Difference]: Finished difference Result 1144 states and 1719 transitions. [2025-03-03 21:33:57,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 21:33:57,060 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 216 [2025-03-03 21:33:57,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:33:57,067 INFO L225 Difference]: With dead ends: 1144 [2025-03-03 21:33:57,068 INFO L226 Difference]: Without dead ends: 863 [2025-03-03 21:33:57,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=167, Invalid=1093, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 21:33:57,070 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 485 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:33:57,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 905 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 21:33:57,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-03-03 21:33:57,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 445. [2025-03-03 21:33:57,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 358 states have (on average 1.4301675977653632) internal successors, (512), 360 states have internal predecessors, (512), 76 states have call successors, (76), 10 states have call predecessors, (76), 10 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-03 21:33:57,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 664 transitions. [2025-03-03 21:33:57,098 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 664 transitions. Word has length 216 [2025-03-03 21:33:57,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:33:57,099 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 664 transitions. [2025-03-03 21:33:57,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:33:57,099 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 664 transitions. [2025-03-03 21:33:57,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-03 21:33:57,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:33:57,101 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:33:57,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 21:33:57,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-03 21:33:57,303 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:33:57,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:33:57,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1260786793, now seen corresponding path program 1 times [2025-03-03 21:33:57,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:33:57,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072286839] [2025-03-03 21:33:57,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:33:57,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:33:57,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 21:33:57,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 21:33:57,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:33:57,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:33:57,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2107589776] [2025-03-03 21:33:57,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:33:57,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:33:57,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:33:57,385 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:33:57,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 21:33:57,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 21:33:57,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 21:33:57,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:33:57,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:33:57,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 21:33:57,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:33:57,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 488 proven. 84 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2025-03-03 21:33:57,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:33:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 12 proven. 84 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-03 21:33:57,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:33:57,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072286839] [2025-03-03 21:33:57,918 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 21:33:57,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107589776] [2025-03-03 21:33:57,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107589776] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:33:57,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:33:57,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2025-03-03 21:33:57,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148238447] [2025-03-03 21:33:57,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:33:57,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 21:33:57,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:33:57,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 21:33:57,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:33:57,919 INFO L87 Difference]: Start difference. First operand 445 states and 664 transitions. Second operand has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 3 states have call successors, (61), 2 states have call predecessors, (61), 4 states have return successors, (62), 3 states have call predecessors, (62), 3 states have call successors, (62) [2025-03-03 21:33:59,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:33:59,116 INFO L93 Difference]: Finished difference Result 1282 states and 1841 transitions. [2025-03-03 21:33:59,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 21:33:59,117 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 3 states have call successors, (61), 2 states have call predecessors, (61), 4 states have return successors, (62), 3 states have call predecessors, (62), 3 states have call successors, (62) Word has length 217 [2025-03-03 21:33:59,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:33:59,120 INFO L225 Difference]: With dead ends: 1282 [2025-03-03 21:33:59,120 INFO L226 Difference]: Without dead ends: 840 [2025-03-03 21:33:59,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=694, Unknown=0, NotChecked=0, Total=930 [2025-03-03 21:33:59,122 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 371 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:33:59,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1083 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 21:33:59,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2025-03-03 21:33:59,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 450. [2025-03-03 21:33:59,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 367 states have (on average 1.4168937329700273) internal successors, (520), 369 states have internal predecessors, (520), 70 states have call successors, (70), 12 states have call predecessors, (70), 12 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-03 21:33:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 660 transitions. [2025-03-03 21:33:59,178 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 660 transitions. Word has length 217 [2025-03-03 21:33:59,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:33:59,178 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 660 transitions. [2025-03-03 21:33:59,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 3 states have call successors, (61), 2 states have call predecessors, (61), 4 states have return successors, (62), 3 states have call predecessors, (62), 3 states have call successors, (62) [2025-03-03 21:33:59,179 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 660 transitions. [2025-03-03 21:33:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-03 21:33:59,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:33:59,180 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:33:59,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 21:33:59,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 21:33:59,384 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:33:59,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:33:59,385 INFO L85 PathProgramCache]: Analyzing trace with hash 531640083, now seen corresponding path program 1 times [2025-03-03 21:33:59,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:33:59,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315331395] [2025-03-03 21:33:59,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:33:59,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:33:59,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 21:33:59,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 21:33:59,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:33:59,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:33:59,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 21:33:59,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:33:59,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315331395] [2025-03-03 21:33:59,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315331395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:33:59,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:33:59,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:33:59,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992010265] [2025-03-03 21:33:59,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:33:59,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:33:59,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:33:59,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:33:59,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:33:59,441 INFO L87 Difference]: Start difference. First operand 450 states and 660 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:33:59,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:33:59,536 INFO L93 Difference]: Finished difference Result 1048 states and 1516 transitions. [2025-03-03 21:33:59,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:33:59,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 217 [2025-03-03 21:33:59,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:33:59,539 INFO L225 Difference]: With dead ends: 1048 [2025-03-03 21:33:59,540 INFO L226 Difference]: Without dead ends: 601 [2025-03-03 21:33:59,540 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-03 21:33:59,541 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 148 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:33:59,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 309 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:33:59,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-03 21:33:59,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 583. [2025-03-03 21:33:59,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 424 states have (on average 1.320754716981132) internal successors, (560), 428 states have internal predecessors, (560), 136 states have call successors, (136), 22 states have call predecessors, (136), 22 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-03 21:33:59,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 832 transitions. [2025-03-03 21:33:59,585 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 832 transitions. Word has length 217 [2025-03-03 21:33:59,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:33:59,586 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 832 transitions. [2025-03-03 21:33:59,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:33:59,586 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 832 transitions. [2025-03-03 21:33:59,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-03 21:33:59,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:33:59,587 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:33:59,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 21:33:59,587 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:33:59,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:33:59,588 INFO L85 PathProgramCache]: Analyzing trace with hash 754666069, now seen corresponding path program 1 times [2025-03-03 21:33:59,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:33:59,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835097517] [2025-03-03 21:33:59,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:33:59,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:33:59,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 21:33:59,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 21:33:59,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:33:59,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:00,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 21:34:00,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:34:00,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835097517] [2025-03-03 21:34:00,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835097517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:34:00,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:34:00,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 21:34:00,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127689409] [2025-03-03 21:34:00,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:34:00,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:34:00,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:34:00,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:34:00,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:34:00,300 INFO L87 Difference]: Start difference. First operand 583 states and 832 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:34:00,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:34:00,889 INFO L93 Difference]: Finished difference Result 1931 states and 2680 transitions. [2025-03-03 21:34:00,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 21:34:00,889 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 217 [2025-03-03 21:34:00,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:34:00,895 INFO L225 Difference]: With dead ends: 1931 [2025-03-03 21:34:00,895 INFO L226 Difference]: Without dead ends: 1363 [2025-03-03 21:34:00,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:34:00,897 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 226 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:34:00,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1081 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:34:00,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2025-03-03 21:34:01,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 935. [2025-03-03 21:34:01,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 725 states have (on average 1.3572413793103448) internal successors, (984), 733 states have internal predecessors, (984), 171 states have call successors, (171), 38 states have call predecessors, (171), 38 states have return successors, (171), 163 states have call predecessors, (171), 171 states have call successors, (171) [2025-03-03 21:34:01,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1326 transitions. [2025-03-03 21:34:01,020 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1326 transitions. Word has length 217 [2025-03-03 21:34:01,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:34:01,020 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1326 transitions. [2025-03-03 21:34:01,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:34:01,020 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1326 transitions. [2025-03-03 21:34:01,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 21:34:01,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:01,022 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:34:01,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 21:34:01,022 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:01,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:01,022 INFO L85 PathProgramCache]: Analyzing trace with hash -28876613, now seen corresponding path program 1 times [2025-03-03 21:34:01,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:34:01,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353813549] [2025-03-03 21:34:01,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:01,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:34:01,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 21:34:01,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 21:34:01,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:01,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:02,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 21:34:02,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:34:02,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353813549] [2025-03-03 21:34:02,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353813549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:34:02,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:34:02,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 21:34:02,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138196266] [2025-03-03 21:34:02,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:34:02,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 21:34:02,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:34:02,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 21:34:02,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:34:02,316 INFO L87 Difference]: Start difference. First operand 935 states and 1326 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:34:04,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:34:04,116 INFO L93 Difference]: Finished difference Result 2040 states and 2901 transitions. [2025-03-03 21:34:04,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 21:34:04,117 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 218 [2025-03-03 21:34:04,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:34:04,122 INFO L225 Difference]: With dead ends: 2040 [2025-03-03 21:34:04,122 INFO L226 Difference]: Without dead ends: 1146 [2025-03-03 21:34:04,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-03-03 21:34:04,124 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 369 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:34:04,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1577 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 21:34:04,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2025-03-03 21:34:04,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1055. [2025-03-03 21:34:04,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 845 states have (on average 1.3810650887573965) internal successors, (1167), 853 states have internal predecessors, (1167), 171 states have call successors, (171), 38 states have call predecessors, (171), 38 states have return successors, (171), 163 states have call predecessors, (171), 171 states have call successors, (171) [2025-03-03 21:34:04,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1509 transitions. [2025-03-03 21:34:04,200 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1509 transitions. Word has length 218 [2025-03-03 21:34:04,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:34:04,200 INFO L471 AbstractCegarLoop]: Abstraction has 1055 states and 1509 transitions. [2025-03-03 21:34:04,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:34:04,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1509 transitions. [2025-03-03 21:34:04,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 21:34:04,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:04,202 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:34:04,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 21:34:04,202 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:04,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:04,203 INFO L85 PathProgramCache]: Analyzing trace with hash 194149373, now seen corresponding path program 1 times [2025-03-03 21:34:04,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:34:04,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319809611] [2025-03-03 21:34:04,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:04,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:34:04,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 21:34:04,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 21:34:04,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:04,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:04,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 21:34:04,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:34:04,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319809611] [2025-03-03 21:34:04,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319809611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:34:04,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:34:04,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 21:34:04,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374015421] [2025-03-03 21:34:04,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:34:04,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:34:04,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:34:04,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:34:04,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:34:04,463 INFO L87 Difference]: Start difference. First operand 1055 states and 1509 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:34:04,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:34:04,843 INFO L93 Difference]: Finished difference Result 2531 states and 3573 transitions. [2025-03-03 21:34:04,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 21:34:04,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 218 [2025-03-03 21:34:04,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:34:04,849 INFO L225 Difference]: With dead ends: 2531 [2025-03-03 21:34:04,849 INFO L226 Difference]: Without dead ends: 1517 [2025-03-03 21:34:04,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:34:04,851 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 100 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:34:04,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 968 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:34:04,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2025-03-03 21:34:04,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1125. [2025-03-03 21:34:04,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 915 states have (on average 1.4) internal successors, (1281), 923 states have internal predecessors, (1281), 171 states have call successors, (171), 38 states have call predecessors, (171), 38 states have return successors, (171), 163 states have call predecessors, (171), 171 states have call successors, (171) [2025-03-03 21:34:04,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1623 transitions. [2025-03-03 21:34:04,952 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1623 transitions. Word has length 218 [2025-03-03 21:34:04,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:34:04,953 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1623 transitions. [2025-03-03 21:34:04,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:34:04,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1623 transitions. [2025-03-03 21:34:04,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 21:34:04,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:04,955 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:34:04,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 21:34:04,956 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:04,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:04,956 INFO L85 PathProgramCache]: Analyzing trace with hash -355651238, now seen corresponding path program 1 times [2025-03-03 21:34:04,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:34:04,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079468989] [2025-03-03 21:34:04,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:04,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:34:04,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 21:34:05,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 21:34:05,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:05,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:34:05,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [694619170] [2025-03-03 21:34:05,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:05,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:34:05,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:34:05,014 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:34:05,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 21:34:05,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 21:34:05,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 21:34:05,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:05,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:34:05,159 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 21:34:05,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 21:34:05,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 21:34:05,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:05,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:34:05,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 21:34:05,319 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 21:34:05,320 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 21:34:05,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 21:34:05,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 21:34:05,526 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:34:05,635 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 21:34:05,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:34:05 BoogieIcfgContainer [2025-03-03 21:34:05,637 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 21:34:05,638 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 21:34:05,638 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 21:34:05,638 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 21:34:05,639 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:33:04" (3/4) ... [2025-03-03 21:34:05,640 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 21:34:05,641 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 21:34:05,641 INFO L158 Benchmark]: Toolchain (without parser) took 61502.30ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 123.9MB in the beginning and 190.2MB in the end (delta: -66.2MB). Peak memory consumption was 209.9MB. Max. memory is 16.1GB. [2025-03-03 21:34:05,641 INFO L158 Benchmark]: CDTParser took 0.69ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:34:05,641 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.39ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 107.8MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 21:34:05,642 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.87ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 104.8MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:34:05,642 INFO L158 Benchmark]: Boogie Preprocessor took 42.13ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 101.4MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 21:34:05,642 INFO L158 Benchmark]: IcfgBuilder took 466.44ms. Allocated memory is still 167.8MB. Free memory was 101.4MB in the beginning and 70.3MB in the end (delta: 31.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 21:34:05,642 INFO L158 Benchmark]: TraceAbstraction took 60673.18ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 69.3MB in the beginning and 190.3MB in the end (delta: -120.9MB). Peak memory consumption was 159.6MB. Max. memory is 16.1GB. [2025-03-03 21:34:05,642 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 444.6MB. Free memory was 190.3MB in the beginning and 190.2MB in the end (delta: 90.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:34:05,643 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.69ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.39ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 107.8MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.87ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 104.8MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.13ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 101.4MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 466.44ms. Allocated memory is still 167.8MB. Free memory was 101.4MB in the beginning and 70.3MB in the end (delta: 31.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 60673.18ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 69.3MB in the beginning and 190.3MB in the end (delta: -120.9MB). Peak memory consumption was 159.6MB. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 444.6MB. Free memory was 190.3MB in the beginning and 190.2MB in the end (delta: 90.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 shiftLeft at line 197, overapproximation of shiftLeft at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 180, overapproximation of someBinaryFLOATComparisonOperation at line 183, overapproximation of someBinaryFLOATComparisonOperation at line 186, overapproximation of someBinaryFLOATComparisonOperation at line 181, overapproximation of someBinaryFLOATComparisonOperation at line 184, overapproximation of someUnaryDOUBLEoperation at line 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 154, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 197, overapproximation of someBinaryDOUBLEComparisonOperation at line 156. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned long int var_1_19 = 50; [L37] unsigned char var_1_20 = 0; [L38] unsigned char var_1_21 = 0; [L39] unsigned char var_1_23 = 64; [L40] unsigned char var_1_24 = 64; [L41] unsigned char var_1_25 = 2; [L42] unsigned short int var_1_26 = 32; [L43] unsigned long int var_1_27 = 100; [L44] unsigned short int var_1_28 = 64; [L45] float var_1_30 = -0.2; [L46] float var_1_32 = -0.375; [L47] float var_1_33 = 1.4; [L48] float var_1_34 = 200.4; [L49] float var_1_35 = 1.5; [L50] unsigned char var_1_36 = 0; [L51] unsigned char last_1_var_1_10 = 32; [L52] unsigned short int last_1_var_1_12 = 16; [L53] unsigned long int last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L201] isInitial = 1 [L202] FCALL initially() [L203] COND TRUE 1 [L204] CALL updateLastVariables() [L192] last_1_var_1_10 = var_1_10 [L193] last_1_var_1_12 = var_1_12 [L194] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L204] RET updateLastVariables() [L205] CALL updateVariables() [L140] var_1_3 = __VERIFIER_nondet_short() [L141] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L141] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L142] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L142] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L143] var_1_5 = __VERIFIER_nondet_long() [L144] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L144] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L145] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L145] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L146] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L146] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L147] var_1_6 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L148] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L149] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L149] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L150] var_1_7 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L151] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L152] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L152] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L153] var_1_8 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_9=9/5] [L154] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_9=9/5] [L155] var_1_9 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L156] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L157] var_1_11 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L158] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L159] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L159] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L160] var_1_15 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L161] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L162] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L162] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L163] var_1_20 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L164] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L165] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L165] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L166] var_1_21 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L167] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L168] CALL assume_abort_if_not(var_1_21 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L168] RET assume_abort_if_not(var_1_21 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L169] var_1_24 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L170] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L171] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L171] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L172] var_1_25 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L173] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L174] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L174] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L175] var_1_27 = __VERIFIER_nondet_ulong() [L176] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L176] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L177] CALL assume_abort_if_not(var_1_27 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L177] RET assume_abort_if_not(var_1_27 <= 4294967295) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L178] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L178] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L179] var_1_30 = __VERIFIER_nondet_float() [L180] CALL assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L180] RET assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L181] CALL assume_abort_if_not(var_1_30 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L181] RET assume_abort_if_not(var_1_30 != 0.0F) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L182] var_1_32 = __VERIFIER_nondet_float() [L183] CALL assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L183] RET assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L184] CALL assume_abort_if_not(var_1_32 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L184] RET assume_abort_if_not(var_1_32 != 0.0F) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L185] var_1_34 = __VERIFIER_nondet_float() [L186] CALL assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L186] RET assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L187] var_1_36 = __VERIFIER_nondet_uchar() [L188] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L188] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L189] CALL assume_abort_if_not(var_1_36 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L189] RET assume_abort_if_not(var_1_36 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L205] RET updateVariables() [L206] CALL step() [L57] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L58] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L60] COND FALSE !(((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12))) == (~ 16u)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=262, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L65] var_1_33 = var_1_34 [L66] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=262, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L67] COND TRUE var_1_6 <= stepLocal_2 [L68] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=262, var_1_11=262, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L72] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=262, var_1_11=262, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L72] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L79] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=262, var_1_11=262, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L81] var_1_18 = var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=262, var_1_11=262, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L82] COND TRUE var_1_10 <= var_1_16 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=262, var_1_11=262, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=32, var_1_27=-4294967295, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L83] COND TRUE var_1_10 <= (((((var_1_25) < (var_1_24)) ? (var_1_25) : (var_1_24))) / var_1_27) [L84] var_1_26 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=262, var_1_11=262, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=256, var_1_27=-4294967295, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L97] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L98] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=262, stepLocal_4=6, var_1_10=262, var_1_11=262, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=256, var_1_27=-4294967295, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L99] COND FALSE !((- var_1_9) <= var_1_8) [L112] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=262, stepLocal_4=6, var_1_10=262, var_1_11=262, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=256, var_1_27=-4294967295, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L114] COND FALSE !((var_1_1 / var_1_30) > ((((var_1_1 / var_1_32) < 0 ) ? -(var_1_1 / var_1_32) : (var_1_1 / var_1_32)))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=262, stepLocal_4=6, var_1_10=262, var_1_11=262, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=256, var_1_27=-4294967295, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L119] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=262, stepLocal_4=6, var_1_10=262, var_1_11=262, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=256, var_1_27=-4294967295, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L120] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=262, stepLocal_4=6, var_1_10=262, var_1_11=262, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=256, var_1_27=-4294967295, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L120] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L121] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=262, stepLocal_4=6, var_1_10=262, var_1_11=262, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=256, var_1_27=-4294967295, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L128] COND TRUE var_1_20 || var_1_21 [L129] var_1_19 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=262, stepLocal_4=6, var_1_10=262, var_1_11=262, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=6, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=256, var_1_27=-4294967295, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L131] COND FALSE !(((256 - var_1_25) <= (var_1_16 + var_1_13)) || var_1_20) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=262, stepLocal_4=6, var_1_10=262, var_1_11=262, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=6, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=256, var_1_27=-4294967295, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L206] RET step() [L207] CALL, EXPR property() [L197] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=262, var_1_11=262, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=6, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=256, var_1_27=-4294967295, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L197] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=262, var_1_11=262, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=6, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=256, var_1_27=-4294967295, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L197] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=262, var_1_11=262, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=6, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=256, var_1_27=-4294967295, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L197] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=262, var_1_11=262, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=6, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=256, var_1_27=-4294967295, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L197] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=262, var_1_11=262, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=6, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=256, var_1_27=-4294967295, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L197-L198] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L207] RET, EXPR property() [L207] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=262, var_1_11=262, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=6, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=256, var_1_27=-4294967295, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=262, var_1_11=262, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=6, var_1_1=11/2, var_1_20=0, var_1_21=-255, var_1_23=64, var_1_24=7, var_1_25=-505, var_1_26=256, var_1_27=-4294967295, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 117 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 60.5s, OverallIterations: 15, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 27.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 6227 SdHoareTripleChecker+Valid, 21.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6216 mSDsluCounter, 13279 SdHoareTripleChecker+Invalid, 20.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10721 mSDsCounter, 489 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9642 IncrementalHoareTripleChecker+Invalid, 10132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 489 mSolverCounterUnsat, 2558 mSDtfsCounter, 9642 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3900 GetRequests, 3596 SyntacticMatches, 4 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2233 ImplicationChecksByTransitivity, 14.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1125occurred in iteration=14, InterpolantAutomatonStates: 162, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 3082 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 27.4s InterpolantComputationTime, 5394 NumberOfCodeBlocks, 5394 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 6434 ConstructedInterpolants, 71 QuantifiedInterpolants, 33811 SizeOfPredicates, 78 NumberOfNonLiveVariables, 4315 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 30 InterpolantComputations, 11 PerfectInterpolantSequences, 61721/63360 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-03 21:34:05,830 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_fillercodestructure_filler-pr-co_file-9.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 6dd6d776f9e66c8cc025ab32529fca2ff2ccbfe84cc1f436072541a4cb2f09b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:34:07,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:34:07,578 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 21:34:07,585 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:34:07,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:34:07,605 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:34:07,606 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:34:07,606 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:34:07,606 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:34:07,606 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:34:07,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:34:07,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:34:07,606 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:34:07,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:34:07,606 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:34:07,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:34:07,607 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:34:07,607 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:34:07,607 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:34:07,607 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:34:07,607 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:34:07,607 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:34:07,607 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:34:07,607 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 21:34:07,607 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 21:34:07,607 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 21:34:07,607 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:34:07,607 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:34:07,607 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:34:07,607 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:34:07,607 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:34:07,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:34:07,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:34:07,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:34:07,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:34:07,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:34:07,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:34:07,608 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:34:07,608 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:34:07,608 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 21:34:07,608 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 21:34:07,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:34:07,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:34:07,608 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:34:07,608 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:34:07,608 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 -> 6dd6d776f9e66c8cc025ab32529fca2ff2ccbfe84cc1f436072541a4cb2f09b4 [2025-03-03 21:34:07,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:34:07,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:34:07,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:34:07,857 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:34:07,857 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:34:07,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-9.i [2025-03-03 21:34:09,034 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7de5a5f9a/43c97d04f7184831bc36482b4a0a3712/FLAGb8bd5db4c [2025-03-03 21:34:09,245 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:34:09,246 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-9.i [2025-03-03 21:34:09,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7de5a5f9a/43c97d04f7184831bc36482b4a0a3712/FLAGb8bd5db4c [2025-03-03 21:34:09,270 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7de5a5f9a/43c97d04f7184831bc36482b4a0a3712 [2025-03-03 21:34:09,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:34:09,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:34:09,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:34:09,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:34:09,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:34:09,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:34:09" (1/1) ... [2025-03-03 21:34:09,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72f10641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:09, skipping insertion in model container [2025-03-03 21:34:09,282 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:34:09" (1/1) ... [2025-03-03 21:34:09,301 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:34:09,411 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-9.i[918,931] [2025-03-03 21:34:09,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:34:09,500 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:34:09,510 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-9.i[918,931] [2025-03-03 21:34:09,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:34:09,548 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:34:09,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:09 WrapperNode [2025-03-03 21:34:09,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:34:09,549 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:34:09,549 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:34:09,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:34:09,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:09" (1/1) ... [2025-03-03 21:34:09,562 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:09" (1/1) ... [2025-03-03 21:34:09,584 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2025-03-03 21:34:09,585 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:34:09,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:34:09,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:34:09,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:34:09,591 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:09" (1/1) ... [2025-03-03 21:34:09,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:09" (1/1) ... [2025-03-03 21:34:09,594 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:09" (1/1) ... [2025-03-03 21:34:09,603 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-03 21:34:09,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:09" (1/1) ... [2025-03-03 21:34:09,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:09" (1/1) ... [2025-03-03 21:34:09,613 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:09" (1/1) ... [2025-03-03 21:34:09,616 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:09" (1/1) ... [2025-03-03 21:34:09,618 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:09" (1/1) ... [2025-03-03 21:34:09,619 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:09" (1/1) ... [2025-03-03 21:34:09,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:34:09,624 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:34:09,624 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:34:09,625 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:34:09,625 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:09" (1/1) ... [2025-03-03 21:34:09,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:34:09,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:34:09,651 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-03 21:34:09,655 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-03 21:34:09,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:34:09,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 21:34:09,672 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:34:09,672 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:34:09,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:34:09,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:34:09,749 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:34:09,751 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:34:19,981 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 21:34:19,981 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:34:19,989 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:34:19,989 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:34:19,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:34:19 BoogieIcfgContainer [2025-03-03 21:34:19,989 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:34:19,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:34:19,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:34:19,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:34:19,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:34:09" (1/3) ... [2025-03-03 21:34:19,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a038977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:34:19, skipping insertion in model container [2025-03-03 21:34:19,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:09" (2/3) ... [2025-03-03 21:34:19,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a038977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:34:19, skipping insertion in model container [2025-03-03 21:34:19,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:34:19" (3/3) ... [2025-03-03 21:34:19,999 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-9.i [2025-03-03 21:34:20,008 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:34:20,010 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-9.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:34:20,056 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:34:20,062 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;@2c891a94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:34:20,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:34:20,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 59 states have internal predecessors, (84), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 21:34:20,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 21:34:20,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:20,075 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:34:20,076 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:20,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:20,079 INFO L85 PathProgramCache]: Analyzing trace with hash -702520873, now seen corresponding path program 1 times [2025-03-03 21:34:20,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:34:20,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838382524] [2025-03-03 21:34:20,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:20,090 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-03 21:34:20,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:34:20,092 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-03 21:34:20,094 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-03 21:34:20,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 21:34:21,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 21:34:21,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:21,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:21,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:34:21,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:34:21,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 764 proven. 0 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2025-03-03 21:34:21,500 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:34:21,500 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:34:21,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838382524] [2025-03-03 21:34:21,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1838382524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:34:21,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:34:21,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:34:21,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247788383] [2025-03-03 21:34:21,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:34:21,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:34:21,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:34:21,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:34:21,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:34:21,524 INFO L87 Difference]: Start difference. First operand has 94 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 59 states have internal predecessors, (84), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-03 21:34:21,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:34:21,552 INFO L93 Difference]: Finished difference Result 181 states and 326 transitions. [2025-03-03 21:34:21,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:34:21,554 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 206 [2025-03-03 21:34:21,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:34:21,560 INFO L225 Difference]: With dead ends: 181 [2025-03-03 21:34:21,560 INFO L226 Difference]: Without dead ends: 90 [2025-03-03 21:34:21,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 205 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-03 21:34:21,566 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:34:21,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:34:21,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-03 21:34:21,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-03 21:34:21,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 21:34:21,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 141 transitions. [2025-03-03 21:34:21,605 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 141 transitions. Word has length 206 [2025-03-03 21:34:21,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:34:21,605 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 141 transitions. [2025-03-03 21:34:21,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-03 21:34:21,605 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 141 transitions. [2025-03-03 21:34:21,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-03 21:34:21,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:21,610 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:34:21,649 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-03 21:34:21,811 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-03 21:34:21,811 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:21,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:21,812 INFO L85 PathProgramCache]: Analyzing trace with hash -968573089, now seen corresponding path program 1 times [2025-03-03 21:34:21,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:34:21,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158975583] [2025-03-03 21:34:21,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:21,813 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-03 21:34:21,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:34:21,815 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-03 21:34:21,816 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-03 21:34:21,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 21:34:23,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 21:34:23,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:23,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:23,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 21:34:23,342 INFO L279 TraceCheckSpWp]: Computing forward predicates...