./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-42.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_fillercodesize_ps-cn-10_file-42.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d9e59086f90a4b77881e2a736ae7adfe917141d6ec019c4e22eac9e57a2e90b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:35:51,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:35:51,293 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:35:51,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:35:51,301 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:35:51,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:35:51,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:35:51,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:35:51,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:35:51,322 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:35:51,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:35:51,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:35:51,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:35:51,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:35:51,323 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:35:51,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:35:51,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:35:51,324 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:35:51,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:35:51,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:35:51,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:35:51,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:35:51,324 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:35:51,324 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:35:51,324 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:35:51,324 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:35:51,324 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:35:51,324 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:35:51,324 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:35:51,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:35:51,324 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:35:51,324 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:35:51,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:35:51,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:35:51,325 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:35:51,325 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:35:51,325 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:35:51,325 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:35:51,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:35:51,325 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:35:51,325 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:35:51,325 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:35:51,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:35:51,325 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 -> d9e59086f90a4b77881e2a736ae7adfe917141d6ec019c4e22eac9e57a2e90b4 [2025-03-03 19:35:51,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:35:51,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:35:51,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:35:51,564 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:35:51,564 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:35:51,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-42.i [2025-03-03 19:35:52,721 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1c154a6e/aab5c494039f4e5b8a528c22106b7a9c/FLAGd4eb69edf [2025-03-03 19:35:52,991 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:35:52,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-42.i [2025-03-03 19:35:53,001 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1c154a6e/aab5c494039f4e5b8a528c22106b7a9c/FLAGd4eb69edf [2025-03-03 19:35:53,300 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1c154a6e/aab5c494039f4e5b8a528c22106b7a9c [2025-03-03 19:35:53,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:35:53,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:35:53,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:35:53,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:35:53,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:35:53,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:35:53" (1/1) ... [2025-03-03 19:35:53,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@237cd493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:53, skipping insertion in model container [2025-03-03 19:35:53,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:35:53" (1/1) ... [2025-03-03 19:35:53,333 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:35:53,441 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-42.i[915,928] [2025-03-03 19:35:53,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:35:53,518 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:35:53,525 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-42.i[915,928] [2025-03-03 19:35:53,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:35:53,567 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:35:53,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:53 WrapperNode [2025-03-03 19:35:53,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:35:53,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:35:53,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:35:53,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:35:53,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:53" (1/1) ... [2025-03-03 19:35:53,587 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:53" (1/1) ... [2025-03-03 19:35:53,612 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2025-03-03 19:35:53,613 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:35:53,614 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:35:53,614 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:35:53,614 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:35:53,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:53" (1/1) ... [2025-03-03 19:35:53,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:53" (1/1) ... [2025-03-03 19:35:53,624 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:53" (1/1) ... [2025-03-03 19:35:53,645 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 19:35:53,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:53" (1/1) ... [2025-03-03 19:35:53,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:53" (1/1) ... [2025-03-03 19:35:53,649 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:53" (1/1) ... [2025-03-03 19:35:53,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:53" (1/1) ... [2025-03-03 19:35:53,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:53" (1/1) ... [2025-03-03 19:35:53,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:53" (1/1) ... [2025-03-03 19:35:53,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:35:53,655 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:35:53,655 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:35:53,655 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:35:53,656 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:53" (1/1) ... [2025-03-03 19:35:53,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:35:53,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:35:53,684 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 19:35:53,686 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 19:35:53,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:35:53,703 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:35:53,703 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:35:53,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:35:53,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:35:53,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:35:53,767 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:35:53,769 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:35:54,022 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-03 19:35:54,023 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:35:54,034 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:35:54,035 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:35:54,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:35:54 BoogieIcfgContainer [2025-03-03 19:35:54,036 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:35:54,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:35:54,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:35:54,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:35:54,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:35:53" (1/3) ... [2025-03-03 19:35:54,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40dc9ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:35:54, skipping insertion in model container [2025-03-03 19:35:54,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:53" (2/3) ... [2025-03-03 19:35:54,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40dc9ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:35:54, skipping insertion in model container [2025-03-03 19:35:54,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:35:54" (3/3) ... [2025-03-03 19:35:54,045 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-42.i [2025-03-03 19:35:54,055 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:35:54,057 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-42.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:35:54,090 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:35:54,098 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;@1812032b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:35:54,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:35:54,101 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 49 states have internal predecessors, (67), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 19:35:54,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 19:35:54,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:35:54,111 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:35:54,111 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:35:54,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:35:54,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1559434777, now seen corresponding path program 1 times [2025-03-03 19:35:54,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:35:54,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444251736] [2025-03-03 19:35:54,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:35:54,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:35:54,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 19:35:54,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 19:35:54,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:35:54,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:35:54,385 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-03 19:35:54,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:35:54,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444251736] [2025-03-03 19:35:54,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444251736] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:35:54,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147881117] [2025-03-03 19:35:54,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:35:54,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:35:54,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:35:54,389 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 19:35:54,390 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 19:35:54,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 19:35:54,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 19:35:54,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:35:54,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:35:54,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:35:54,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:35:54,555 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-03 19:35:54,557 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:35:54,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147881117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:35:54,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:35:54,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:35:54,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91323863] [2025-03-03 19:35:54,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:35:54,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:35:54,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:35:54,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:35:54,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:35:54,581 INFO L87 Difference]: Start difference. First operand has 70 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 49 states have internal predecessors, (67), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 19:35:54,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:35:54,601 INFO L93 Difference]: Finished difference Result 134 states and 224 transitions. [2025-03-03 19:35:54,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:35:54,604 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 130 [2025-03-03 19:35:54,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:35:54,609 INFO L225 Difference]: With dead ends: 134 [2025-03-03 19:35:54,609 INFO L226 Difference]: Without dead ends: 67 [2025-03-03 19:35:54,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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 19:35:54,613 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:35:54,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:35:54,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-03 19:35:54,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-03 19:35:54,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 19:35:54,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2025-03-03 19:35:54,639 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 130 [2025-03-03 19:35:54,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:35:54,639 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2025-03-03 19:35:54,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 19:35:54,639 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2025-03-03 19:35:54,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 19:35:54,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:35:54,641 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:35:54,647 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 19:35:54,843 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 19:35:54,843 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:35:54,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:35:54,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1783357256, now seen corresponding path program 1 times [2025-03-03 19:35:54,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:35:54,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086980471] [2025-03-03 19:35:54,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:35:54,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:35:54,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 19:35:54,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 19:35:54,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:35:54,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:35:55,263 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 19:35:55,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:35:55,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086980471] [2025-03-03 19:35:55,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086980471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:35:55,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:35:55,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:35:55,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166232221] [2025-03-03 19:35:55,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:35:55,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:35:55,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:35:55,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:35:55,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:35:55,268 INFO L87 Difference]: Start difference. First operand 67 states and 100 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 19:35:55,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:35:55,392 INFO L93 Difference]: Finished difference Result 196 states and 295 transitions. [2025-03-03 19:35:55,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:35:55,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 130 [2025-03-03 19:35:55,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:35:55,394 INFO L225 Difference]: With dead ends: 196 [2025-03-03 19:35:55,394 INFO L226 Difference]: Without dead ends: 132 [2025-03-03 19:35:55,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:35:55,397 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 92 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:35:55,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 276 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:35:55,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-03 19:35:55,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 111. [2025-03-03 19:35:55,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 70 states have internal predecessors, (90), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 19:35:55,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 166 transitions. [2025-03-03 19:35:55,418 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 166 transitions. Word has length 130 [2025-03-03 19:35:55,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:35:55,418 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 166 transitions. [2025-03-03 19:35:55,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 19:35:55,418 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 166 transitions. [2025-03-03 19:35:55,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 19:35:55,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:35:55,419 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:35:55,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:35:55,420 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:35:55,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:35:55,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1235214587, now seen corresponding path program 1 times [2025-03-03 19:35:55,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:35:55,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320802612] [2025-03-03 19:35:55,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:35:55,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:35:55,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 19:35:55,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 19:35:55,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:35:55,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:35:55,742 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 19:35:55,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:35:55,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320802612] [2025-03-03 19:35:55,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320802612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:35:55,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:35:55,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:35:55,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107546051] [2025-03-03 19:35:55,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:35:55,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:35:55,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:35:55,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:35:55,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:35:55,744 INFO L87 Difference]: Start difference. First operand 111 states and 166 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 19:35:56,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:35:56,002 INFO L93 Difference]: Finished difference Result 283 states and 427 transitions. [2025-03-03 19:35:56,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:35:56,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 131 [2025-03-03 19:35:56,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:35:56,005 INFO L225 Difference]: With dead ends: 283 [2025-03-03 19:35:56,005 INFO L226 Difference]: Without dead ends: 219 [2025-03-03 19:35:56,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:35:56,006 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 122 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:35:56,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 387 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:35:56,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-03 19:35:56,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 173. [2025-03-03 19:35:56,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 112 states have (on average 1.3125) internal successors, (147), 112 states have internal predecessors, (147), 57 states have call successors, (57), 3 states have call predecessors, (57), 3 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-03 19:35:56,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 261 transitions. [2025-03-03 19:35:56,039 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 261 transitions. Word has length 131 [2025-03-03 19:35:56,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:35:56,040 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 261 transitions. [2025-03-03 19:35:56,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 19:35:56,040 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 261 transitions. [2025-03-03 19:35:56,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 19:35:56,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:35:56,041 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:35:56,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:35:56,042 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:35:56,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:35:56,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1552200900, now seen corresponding path program 1 times [2025-03-03 19:35:56,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:35:56,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569401461] [2025-03-03 19:35:56,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:35:56,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:35:56,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 19:35:56,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 19:35:56,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:35:56,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:35:56,208 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 19:35:56,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:35:56,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569401461] [2025-03-03 19:35:56,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569401461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:35:56,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:35:56,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:35:56,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307358843] [2025-03-03 19:35:56,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:35:56,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:35:56,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:35:56,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:35:56,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:35:56,209 INFO L87 Difference]: Start difference. First operand 173 states and 261 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 19:35:56,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:35:56,243 INFO L93 Difference]: Finished difference Result 299 states and 453 transitions. [2025-03-03 19:35:56,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:35:56,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 131 [2025-03-03 19:35:56,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:35:56,245 INFO L225 Difference]: With dead ends: 299 [2025-03-03 19:35:56,245 INFO L226 Difference]: Without dead ends: 173 [2025-03-03 19:35:56,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:35:56,247 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:35:56,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:35:56,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-03 19:35:56,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-03-03 19:35:56,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 112 states have internal predecessors, (145), 57 states have call successors, (57), 3 states have call predecessors, (57), 3 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-03 19:35:56,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 259 transitions. [2025-03-03 19:35:56,263 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 259 transitions. Word has length 131 [2025-03-03 19:35:56,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:35:56,264 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 259 transitions. [2025-03-03 19:35:56,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 19:35:56,264 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 259 transitions. [2025-03-03 19:35:56,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 19:35:56,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:35:56,266 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:35:56,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:35:56,266 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:35:56,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:35:56,266 INFO L85 PathProgramCache]: Analyzing trace with hash 935311933, now seen corresponding path program 1 times [2025-03-03 19:35:56,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:35:56,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271451812] [2025-03-03 19:35:56,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:35:56,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:35:56,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 19:35:56,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 19:35:56,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:35:56,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:35:56,775 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 51 proven. 51 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2025-03-03 19:35:56,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:35:56,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271451812] [2025-03-03 19:35:56,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271451812] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:35:56,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675668972] [2025-03-03 19:35:56,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:35:56,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:35:56,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:35:56,778 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 19:35:56,779 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 19:35:56,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 19:35:56,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 19:35:56,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:35:56,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:35:56,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 19:35:56,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:35:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 443 proven. 51 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-03 19:35:57,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:35:57,588 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 51 proven. 54 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2025-03-03 19:35:57,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675668972] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:35:57,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:35:57,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2025-03-03 19:35:57,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612467520] [2025-03-03 19:35:57,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:35:57,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 19:35:57,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:35:57,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 19:35:57,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-03 19:35:57,590 INFO L87 Difference]: Start difference. First operand 173 states and 259 transitions. Second operand has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 3 states have call successors, (30), 3 states have call predecessors, (30), 7 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2025-03-03 19:35:58,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:35:58,370 INFO L93 Difference]: Finished difference Result 520 states and 726 transitions. [2025-03-03 19:35:58,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-03 19:35:58,370 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 3 states have call successors, (30), 3 states have call predecessors, (30), 7 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 131 [2025-03-03 19:35:58,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:35:58,373 INFO L225 Difference]: With dead ends: 520 [2025-03-03 19:35:58,373 INFO L226 Difference]: Without dead ends: 456 [2025-03-03 19:35:58,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 258 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2025-03-03 19:35:58,375 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 262 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:35:58,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 660 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:35:58,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-03-03 19:35:58,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 276. [2025-03-03 19:35:58,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 187 states have (on average 1.267379679144385) internal successors, (237), 187 states have internal predecessors, (237), 76 states have call successors, (76), 12 states have call predecessors, (76), 12 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-03 19:35:58,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 389 transitions. [2025-03-03 19:35:58,426 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 389 transitions. Word has length 131 [2025-03-03 19:35:58,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:35:58,426 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 389 transitions. [2025-03-03 19:35:58,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 3 states have call successors, (30), 3 states have call predecessors, (30), 7 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2025-03-03 19:35:58,426 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 389 transitions. [2025-03-03 19:35:58,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 19:35:58,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:35:58,427 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:35:58,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 19:35:58,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:35:58,628 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:35:58,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:35:58,629 INFO L85 PathProgramCache]: Analyzing trace with hash 429753308, now seen corresponding path program 1 times [2025-03-03 19:35:58,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:35:58,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714088975] [2025-03-03 19:35:58,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:35:58,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:35:58,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 19:35:58,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 19:35:58,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:35:58,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:35:58,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1517143385] [2025-03-03 19:35:58,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:35:58,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:35:58,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:35:58,702 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 19:35:58,704 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 19:35:58,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 19:35:58,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 19:35:58,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:35:58,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:35:58,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 19:35:58,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:35:59,229 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 150 proven. 48 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2025-03-03 19:35:59,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:35:59,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:35:59,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714088975] [2025-03-03 19:35:59,614 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 19:35:59,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517143385] [2025-03-03 19:35:59,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517143385] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:35:59,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:35:59,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-03 19:35:59,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079467989] [2025-03-03 19:35:59,615 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 19:35:59,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 19:35:59,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:35:59,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 19:35:59,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-03 19:35:59,617 INFO L87 Difference]: Start difference. First operand 276 states and 389 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 19:36:00,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:36:00,137 INFO L93 Difference]: Finished difference Result 788 states and 1076 transitions. [2025-03-03 19:36:00,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 19:36:00,138 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 131 [2025-03-03 19:36:00,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:36:00,140 INFO L225 Difference]: With dead ends: 788 [2025-03-03 19:36:00,141 INFO L226 Difference]: Without dead ends: 647 [2025-03-03 19:36:00,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2025-03-03 19:36:00,142 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 146 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:36:00,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 631 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:36:00,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2025-03-03 19:36:00,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 550. [2025-03-03 19:36:00,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 385 states have (on average 1.264935064935065) internal successors, (487), 387 states have internal predecessors, (487), 137 states have call successors, (137), 27 states have call predecessors, (137), 27 states have return successors, (137), 135 states have call predecessors, (137), 137 states have call successors, (137) [2025-03-03 19:36:00,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 761 transitions. [2025-03-03 19:36:00,190 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 761 transitions. Word has length 131 [2025-03-03 19:36:00,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:36:00,190 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 761 transitions. [2025-03-03 19:36:00,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 19:36:00,190 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 761 transitions. [2025-03-03 19:36:00,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 19:36:00,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:36:00,191 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:36:00,199 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 19:36:00,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:36:00,396 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:36:00,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:36:00,397 INFO L85 PathProgramCache]: Analyzing trace with hash 136350301, now seen corresponding path program 1 times [2025-03-03 19:36:00,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:36:00,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279596153] [2025-03-03 19:36:00,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:36:00,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:36:00,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 19:36:00,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 19:36:00,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:36:00,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:36:00,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1827841898] [2025-03-03 19:36:00,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:36:00,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:36:00,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:36:00,471 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 19:36:00,473 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 19:36:00,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 19:36:00,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 19:36:00,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:36:00,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:36:00,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 19:36:00,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:36:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 150 proven. 48 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2025-03-03 19:36:01,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:36:01,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:36:01,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279596153] [2025-03-03 19:36:01,753 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 19:36:01,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827841898] [2025-03-03 19:36:01,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827841898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:36:01,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:36:01,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-03 19:36:01,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934013888] [2025-03-03 19:36:01,753 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 19:36:01,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 19:36:01,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:36:01,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 19:36:01,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-03 19:36:01,754 INFO L87 Difference]: Start difference. First operand 550 states and 761 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 19:36:02,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:36:02,388 INFO L93 Difference]: Finished difference Result 1057 states and 1460 transitions. [2025-03-03 19:36:02,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 19:36:02,389 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 131 [2025-03-03 19:36:02,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:36:02,394 INFO L225 Difference]: With dead ends: 1057 [2025-03-03 19:36:02,397 INFO L226 Difference]: Without dead ends: 842 [2025-03-03 19:36:02,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-03-03 19:36:02,399 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 190 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:36:02,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 616 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:36:02,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2025-03-03 19:36:02,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 697. [2025-03-03 19:36:02,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 486 states have (on average 1.2592592592592593) internal successors, (612), 488 states have internal predecessors, (612), 175 states have call successors, (175), 35 states have call predecessors, (175), 35 states have return successors, (175), 173 states have call predecessors, (175), 175 states have call successors, (175) [2025-03-03 19:36:02,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 962 transitions. [2025-03-03 19:36:02,454 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 962 transitions. Word has length 131 [2025-03-03 19:36:02,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:36:02,454 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 962 transitions. [2025-03-03 19:36:02,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 19:36:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 962 transitions. [2025-03-03 19:36:02,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 19:36:02,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:36:02,455 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:36:02,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 19:36:02,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:36:02,659 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:36:02,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:36:02,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1417972280, now seen corresponding path program 1 times [2025-03-03 19:36:02,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:36:02,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167918340] [2025-03-03 19:36:02,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:36:02,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:36:02,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 19:36:02,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 19:36:02,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:36:02,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:36:02,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1747261294] [2025-03-03 19:36:02,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:36:02,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:36:02,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:36:02,708 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 19:36:02,709 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 19:36:02,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 19:36:02,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 19:36:02,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:36:02,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:36:02,811 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 19:36:02,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 19:36:02,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 19:36:02,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:36:02,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:36:02,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 19:36:02,919 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 19:36:02,919 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 19:36:02,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 19:36:03,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:36:03,125 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:36:03,211 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 19:36:03,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 07:36:03 BoogieIcfgContainer [2025-03-03 19:36:03,213 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 19:36:03,214 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 19:36:03,214 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 19:36:03,214 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 19:36:03,215 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:35:54" (3/4) ... [2025-03-03 19:36:03,216 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 19:36:03,217 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 19:36:03,217 INFO L158 Benchmark]: Toolchain (without parser) took 9913.89ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 106.1MB in the beginning and 297.1MB in the end (delta: -191.0MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2025-03-03 19:36:03,217 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:36:03,217 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.15ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 92.1MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:36:03,217 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.90ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 88.8MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:36:03,218 INFO L158 Benchmark]: Boogie Preprocessor took 40.69ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 83.7MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 19:36:03,218 INFO L158 Benchmark]: IcfgBuilder took 381.40ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 60.5MB in the end (delta: 23.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:36:03,218 INFO L158 Benchmark]: TraceAbstraction took 9175.47ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 59.6MB in the beginning and 297.2MB in the end (delta: -237.6MB). Peak memory consumption was 112.9MB. Max. memory is 16.1GB. [2025-03-03 19:36:03,218 INFO L158 Benchmark]: Witness Printer took 2.65ms. Allocated memory is still 343.9MB. Free memory was 297.2MB in the beginning and 297.1MB in the end (delta: 87.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:36:03,219 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.15ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 92.1MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.90ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 88.8MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.69ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 83.7MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 381.40ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 60.5MB in the end (delta: 23.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9175.47ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 59.6MB in the beginning and 297.2MB in the end (delta: -237.6MB). Peak memory consumption was 112.9MB. Max. memory is 16.1GB. * Witness Printer took 2.65ms. Allocated memory is still 343.9MB. Free memory was 297.2MB in the beginning and 297.1MB in the end (delta: 87.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 125, overapproximation of someBinaryFLOATComparisonOperation at line 138, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 150, overapproximation of someBinaryFLOATComparisonOperation at line 127, overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someUnaryDOUBLEoperation at line 30. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] unsigned char var_1_21 = 0; [L37] unsigned char var_1_22 = 0; [L38] signed long int var_1_23 = -10; [L39] signed long int var_1_24 = 32; [L40] float var_1_25 = 1000000.8; [L41] float var_1_26 = 7.4; [L42] signed long int var_1_27 = 128; [L43] float var_1_28 = 9.75; [L44] signed long int var_1_29 = 10; [L45] signed short int last_1_var_1_1 = 16; [L46] unsigned char last_1_var_1_6 = 10; [L47] unsigned char last_1_var_1_8 = 1; [L48] signed short int last_1_var_1_13 = 200; VAL [isInitial=0, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L154] isInitial = 1 [L155] FCALL initially() [L156] COND TRUE 1 [L157] CALL updateLastVariables() [L144] last_1_var_1_1 = var_1_1 [L145] last_1_var_1_6 = var_1_6 [L146] last_1_var_1_8 = var_1_8 [L147] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L157] RET updateLastVariables() [L158] CALL updateVariables() [L112] var_1_5 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L113] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L114] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L114] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L115] var_1_7 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L116] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L117] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L117] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L118] var_1_11 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L119] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L120] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L120] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L121] var_1_12 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L122] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L123] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L123] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L124] var_1_15 = __VERIFIER_nondet_float() [L125] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L125] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L126] var_1_16 = __VERIFIER_nondet_float() [L127] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L127] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L128] var_1_20 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L129] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L130] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L130] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L131] var_1_22 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L132] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L133] CALL assume_abort_if_not(var_1_22 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L133] RET assume_abort_if_not(var_1_22 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L134] var_1_24 = __VERIFIER_nondet_long() [L135] CALL assume_abort_if_not(var_1_24 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L135] RET assume_abort_if_not(var_1_24 >= -2147483647) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L136] CALL assume_abort_if_not(var_1_24 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L136] RET assume_abort_if_not(var_1_24 <= 2147483646) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L137] var_1_26 = __VERIFIER_nondet_float() [L138] CALL assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L138] RET assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L139] var_1_29 = __VERIFIER_nondet_long() [L140] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_27=128, var_1_28=39/4, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_27=128, var_1_28=39/4, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L140] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_27=128, var_1_28=39/4, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L141] CALL assume_abort_if_not(var_1_29 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_27=128, var_1_28=39/4, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_27=128, var_1_28=39/4, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L141] RET assume_abort_if_not(var_1_29 <= 32) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_27=128, var_1_28=39/4, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L158] RET updateVariables() [L159] CALL step() [L52] var_1_21 = var_1_22 [L53] var_1_23 = var_1_24 [L54] var_1_25 = var_1_26 [L55] var_1_27 = -32 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=39/4, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L56] EXPR var_1_24 & 100 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=39/4, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L56] EXPR var_1_23 >> ((((var_1_29) > (5)) ? (var_1_29) : (5))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=39/4, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L56] COND TRUE (var_1_24 & 100) <= (var_1_23 >> ((((var_1_29) > (5)) ? (var_1_29) : (5)))) [L57] var_1_28 = var_1_26 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L59] signed long int stepLocal_6 = last_1_var_1_1; [L60] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L61] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L62] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L65] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L70] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L73] COND TRUE var_1_5 >= -2 [L74] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L76] unsigned char stepLocal_4 = var_1_6; [L77] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=154, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L78] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=154, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L79] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L80] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L87] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L88] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L91] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L92] COND TRUE \read(var_1_19) [L93] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L99] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L100] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=-2, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L101] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L108] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=-2, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=0] [L159] RET step() [L160] CALL, EXPR property() [L150-L151] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=0] [L160] RET, EXPR property() [L160] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 8, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 833 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 812 mSDsluCounter, 2848 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2086 mSDsCounter, 319 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1611 IncrementalHoareTripleChecker+Invalid, 1930 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 319 mSolverCounterUnsat, 762 mSDtfsCounter, 1611 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 961 GetRequests, 858 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=697occurred in iteration=7, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 489 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1702 NumberOfCodeBlocks, 1702 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1297 ConstructedInterpolants, 2 QuantifiedInterpolants, 5838 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1350 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 6552/6840 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 19:36:03,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-42.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d9e59086f90a4b77881e2a736ae7adfe917141d6ec019c4e22eac9e57a2e90b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:36:05,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:36:05,109 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 19:36:05,113 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:36:05,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:36:05,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:36:05,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:36:05,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:36:05,129 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:36:05,129 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:36:05,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:36:05,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:36:05,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:36:05,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:36:05,130 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:36:05,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:36:05,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:36:05,130 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:36:05,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:36:05,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:36:05,130 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:36:05,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:36:05,130 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:36:05,130 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 19:36:05,130 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 19:36:05,131 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 19:36:05,131 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:36:05,131 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:36:05,131 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:36:05,131 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:36:05,131 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:36:05,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:36:05,131 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:36:05,131 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:36:05,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:36:05,131 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:36:05,131 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:36:05,131 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:36:05,131 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:36:05,131 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 19:36:05,132 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 19:36:05,132 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:36:05,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:36:05,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:36:05,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:36:05,132 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 -> d9e59086f90a4b77881e2a736ae7adfe917141d6ec019c4e22eac9e57a2e90b4 [2025-03-03 19:36:05,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:36:05,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:36:05,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:36:05,379 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:36:05,379 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:36:05,380 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-42.i [2025-03-03 19:36:06,518 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55b77c73d/1cc1e29e020649eb844e8d8a7804111b/FLAGd83e38e48 [2025-03-03 19:36:06,687 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:36:06,688 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-42.i [2025-03-03 19:36:06,696 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55b77c73d/1cc1e29e020649eb844e8d8a7804111b/FLAGd83e38e48 [2025-03-03 19:36:07,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55b77c73d/1cc1e29e020649eb844e8d8a7804111b [2025-03-03 19:36:07,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:36:07,088 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:36:07,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:36:07,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:36:07,093 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:36:07,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:36:07" (1/1) ... [2025-03-03 19:36:07,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@345ea35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:07, skipping insertion in model container [2025-03-03 19:36:07,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:36:07" (1/1) ... [2025-03-03 19:36:07,112 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:36:07,204 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-42.i[915,928] [2025-03-03 19:36:07,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:36:07,258 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:36:07,266 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-42.i[915,928] [2025-03-03 19:36:07,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:36:07,298 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:36:07,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:07 WrapperNode [2025-03-03 19:36:07,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:36:07,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:36:07,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:36:07,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:36:07,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:07" (1/1) ... [2025-03-03 19:36:07,313 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:07" (1/1) ... [2025-03-03 19:36:07,328 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2025-03-03 19:36:07,328 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:36:07,329 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:36:07,329 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:36:07,329 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:36:07,337 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:07" (1/1) ... [2025-03-03 19:36:07,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:07" (1/1) ... [2025-03-03 19:36:07,340 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:07" (1/1) ... [2025-03-03 19:36:07,353 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 19:36:07,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:07" (1/1) ... [2025-03-03 19:36:07,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:07" (1/1) ... [2025-03-03 19:36:07,362 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:07" (1/1) ... [2025-03-03 19:36:07,364 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:07" (1/1) ... [2025-03-03 19:36:07,365 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:07" (1/1) ... [2025-03-03 19:36:07,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:07" (1/1) ... [2025-03-03 19:36:07,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:36:07,368 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:36:07,368 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:36:07,369 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:36:07,369 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:07" (1/1) ... [2025-03-03 19:36:07,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:36:07,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:36:07,396 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 19:36:07,400 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 19:36:07,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:36:07,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 19:36:07,418 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:36:07,418 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:36:07,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:36:07,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:36:07,498 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:36:07,500 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:36:07,893 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-03 19:36:07,894 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:36:07,901 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:36:07,901 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:36:07,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:36:07 BoogieIcfgContainer [2025-03-03 19:36:07,902 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:36:07,906 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:36:07,906 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:36:07,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:36:07,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:36:07" (1/3) ... [2025-03-03 19:36:07,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e5940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:36:07, skipping insertion in model container [2025-03-03 19:36:07,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:07" (2/3) ... [2025-03-03 19:36:07,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e5940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:36:07, skipping insertion in model container [2025-03-03 19:36:07,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:36:07" (3/3) ... [2025-03-03 19:36:07,912 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-42.i [2025-03-03 19:36:07,922 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:36:07,923 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-42.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:36:07,966 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:36:07,974 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;@3d953b39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:36:07,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:36:07,977 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 43 states have (on average 1.372093023255814) internal successors, (59), 44 states have internal predecessors, (59), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 19:36:07,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 19:36:07,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:36:07,988 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:36:07,988 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:36:07,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:36:07,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1183362739, now seen corresponding path program 1 times [2025-03-03 19:36:08,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:36:08,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099835142] [2025-03-03 19:36:08,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:36:08,005 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 19:36:08,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:36:08,007 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 19:36:08,008 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 19:36:08,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 19:36:08,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 19:36:08,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:36:08,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:36:08,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:36:08,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:36:08,306 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-03 19:36:08,306 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:36:08,307 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:36:08,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099835142] [2025-03-03 19:36:08,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099835142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:36:08,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:36:08,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:36:08,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760589377] [2025-03-03 19:36:08,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:36:08,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:36:08,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:36:08,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:36:08,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:36:08,332 INFO L87 Difference]: Start difference. First operand has 65 states, 43 states have (on average 1.372093023255814) internal successors, (59), 44 states have internal predecessors, (59), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 19:36:08,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:36:08,349 INFO L93 Difference]: Finished difference Result 124 states and 208 transitions. [2025-03-03 19:36:08,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:36:08,351 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 128 [2025-03-03 19:36:08,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:36:08,354 INFO L225 Difference]: With dead ends: 124 [2025-03-03 19:36:08,355 INFO L226 Difference]: Without dead ends: 62 [2025-03-03 19:36:08,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 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 19:36:08,360 INFO L435 NwaCegarLoop]: 92 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, 92 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 19:36:08,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:36:08,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-03 19:36:08,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-03 19:36:08,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 19:36:08,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 92 transitions. [2025-03-03 19:36:08,388 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 92 transitions. Word has length 128 [2025-03-03 19:36:08,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:36:08,388 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 92 transitions. [2025-03-03 19:36:08,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 19:36:08,388 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 92 transitions. [2025-03-03 19:36:08,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 19:36:08,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:36:08,391 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:36:08,399 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 19:36:08,591 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 19:36:08,592 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:36:08,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:36:08,592 INFO L85 PathProgramCache]: Analyzing trace with hash 688270062, now seen corresponding path program 1 times [2025-03-03 19:36:08,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:36:08,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1640139282] [2025-03-03 19:36:08,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:36:08,593 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 19:36:08,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:36:08,595 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 19:36:08,596 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 19:36:08,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 19:36:08,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 19:36:08,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:36:08,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:36:08,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 19:36:08,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:36:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 19:36:09,066 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:36:09,066 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:36:09,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1640139282] [2025-03-03 19:36:09,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1640139282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:36:09,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:36:09,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:36:09,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665674390] [2025-03-03 19:36:09,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:36:09,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:36:09,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:36:09,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:36:09,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:36:09,070 INFO L87 Difference]: Start difference. First operand 62 states and 92 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 19:36:09,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:36:09,364 INFO L93 Difference]: Finished difference Result 181 states and 271 transitions. [2025-03-03 19:36:09,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:36:09,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 128 [2025-03-03 19:36:09,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:36:09,369 INFO L225 Difference]: With dead ends: 181 [2025-03-03 19:36:09,369 INFO L226 Difference]: Without dead ends: 122 [2025-03-03 19:36:09,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:36:09,370 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 75 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:36:09,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 258 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:36:09,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-03 19:36:09,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2025-03-03 19:36:09,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 60 states have internal predecessors, (74), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 19:36:09,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2025-03-03 19:36:09,384 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 128 [2025-03-03 19:36:09,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:36:09,385 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2025-03-03 19:36:09,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 19:36:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2025-03-03 19:36:09,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 19:36:09,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:36:09,386 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:36:09,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 19:36:09,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:36:09,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:36:09,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:36:09,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1647249941, now seen corresponding path program 1 times [2025-03-03 19:36:09,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:36:09,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128888102] [2025-03-03 19:36:09,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:36:09,591 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 19:36:09,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:36:09,594 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:36:09,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 19:36:09,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 19:36:09,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 19:36:09,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:36:09,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:36:09,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 19:36:09,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:36:10,272 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 19:36:10,273 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:36:10,273 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:36:10,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2128888102] [2025-03-03 19:36:10,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2128888102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:36:10,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:36:10,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:36:10,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625984092] [2025-03-03 19:36:10,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:36:10,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:36:10,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:36:10,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:36:10,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:36:10,275 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 19:36:10,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:36:10,901 INFO L93 Difference]: Finished difference Result 263 states and 395 transitions. [2025-03-03 19:36:10,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:36:10,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 129 [2025-03-03 19:36:10,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:36:10,907 INFO L225 Difference]: With dead ends: 263 [2025-03-03 19:36:10,907 INFO L226 Difference]: Without dead ends: 204 [2025-03-03 19:36:10,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:36:10,908 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 105 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:36:10,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 363 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:36:10,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-03 19:36:10,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 158. [2025-03-03 19:36:10,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 97 states have (on average 1.268041237113402) internal successors, (123), 97 states have internal predecessors, (123), 57 states have call successors, (57), 3 states have call predecessors, (57), 3 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-03 19:36:10,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 237 transitions. [2025-03-03 19:36:10,944 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 237 transitions. Word has length 129 [2025-03-03 19:36:10,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:36:10,944 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 237 transitions. [2025-03-03 19:36:10,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 19:36:10,944 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 237 transitions. [2025-03-03 19:36:10,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 19:36:10,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:36:10,945 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:36:10,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-03 19:36:11,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:36:11,146 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:36:11,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:36:11,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1140165546, now seen corresponding path program 1 times [2025-03-03 19:36:11,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:36:11,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438427195] [2025-03-03 19:36:11,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:36:11,147 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 19:36:11,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:36:11,149 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:36:11,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 19:36:11,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 19:36:11,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 19:36:11,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:36:11,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:36:11,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 19:36:11,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:36:11,353 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 19:36:11,353 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:36:11,353 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:36:11,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438427195] [2025-03-03 19:36:11,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438427195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:36:11,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:36:11,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:36:11,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694261788] [2025-03-03 19:36:11,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:36:11,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:36:11,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:36:11,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:36:11,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:36:11,355 INFO L87 Difference]: Start difference. First operand 158 states and 237 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 19:36:11,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:36:11,478 INFO L93 Difference]: Finished difference Result 274 states and 413 transitions. [2025-03-03 19:36:11,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:36:11,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 129 [2025-03-03 19:36:11,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:36:11,486 INFO L225 Difference]: With dead ends: 274 [2025-03-03 19:36:11,486 INFO L226 Difference]: Without dead ends: 158 [2025-03-03 19:36:11,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 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 19:36:11,487 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:36:11,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:36:11,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-03 19:36:11,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-03-03 19:36:11,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 97 states have (on average 1.2474226804123711) internal successors, (121), 97 states have internal predecessors, (121), 57 states have call successors, (57), 3 states have call predecessors, (57), 3 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-03 19:36:11,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 235 transitions. [2025-03-03 19:36:11,514 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 235 transitions. Word has length 129 [2025-03-03 19:36:11,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:36:11,514 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 235 transitions. [2025-03-03 19:36:11,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 19:36:11,514 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 235 transitions. [2025-03-03 19:36:11,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 19:36:11,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:36:11,515 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:36:11,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-03 19:36:11,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:36:11,716 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:36:11,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:36:11,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1347347287, now seen corresponding path program 1 times [2025-03-03 19:36:11,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:36:11,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029157696] [2025-03-03 19:36:11,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:36:11,717 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 19:36:11,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:36:11,721 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:36:11,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-03 19:36:11,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 19:36:11,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 19:36:11,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:36:11,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:36:11,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 19:36:11,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:36:12,153 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 443 proven. 51 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-03 19:36:12,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:36:12,401 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 51 proven. 54 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2025-03-03 19:36:12,401 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:36:12,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029157696] [2025-03-03 19:36:12,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029157696] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:36:12,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 19:36:12,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2025-03-03 19:36:12,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577746647] [2025-03-03 19:36:12,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 19:36:12,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 19:36:12,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:36:12,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 19:36:12,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-03 19:36:12,403 INFO L87 Difference]: Start difference. First operand 158 states and 235 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 3 states have call successors, (30), 3 states have call predecessors, (30), 7 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-03 19:36:13,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:36:13,253 INFO L93 Difference]: Finished difference Result 341 states and 472 transitions. [2025-03-03 19:36:13,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 19:36:13,253 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 3 states have call successors, (30), 3 states have call predecessors, (30), 7 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 129 [2025-03-03 19:36:13,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:36:13,258 INFO L225 Difference]: With dead ends: 341 [2025-03-03 19:36:13,258 INFO L226 Difference]: Without dead ends: 282 [2025-03-03 19:36:13,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 19:36:13,259 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 158 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:36:13,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 471 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:36:13,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-03 19:36:13,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 256. [2025-03-03 19:36:13,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 167 states have (on average 1.2275449101796407) internal successors, (205), 167 states have internal predecessors, (205), 76 states have call successors, (76), 12 states have call predecessors, (76), 12 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-03 19:36:13,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 357 transitions. [2025-03-03 19:36:13,294 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 357 transitions. Word has length 129 [2025-03-03 19:36:13,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:36:13,295 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 357 transitions. [2025-03-03 19:36:13,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 3 states have call successors, (30), 3 states have call predecessors, (30), 7 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-03 19:36:13,296 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 357 transitions. [2025-03-03 19:36:13,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 19:36:13,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:36:13,297 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:36:13,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-03 19:36:13,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:36:13,498 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:36:13,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:36:13,499 INFO L85 PathProgramCache]: Analyzing trace with hash 841788662, now seen corresponding path program 1 times [2025-03-03 19:36:13,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:36:13,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218194901] [2025-03-03 19:36:13,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:36:13,499 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 19:36:13,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:36:13,502 INFO L229 MonitoredProcess]: Starting monitored process 7 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 19:36:13,506 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 (7)] Waiting until timeout for monitored process [2025-03-03 19:36:13,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 19:36:13,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 19:36:13,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:36:13,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:36:13,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 19:36:13,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:36:14,157 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 150 proven. 48 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2025-03-03 19:36:14,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:36:14,449 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:36:14,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218194901] [2025-03-03 19:36:14,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218194901] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:36:14,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [863613276] [2025-03-03 19:36:14,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:36:14,450 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 19:36:14,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 19:36:14,452 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 19:36:14,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-03-03 19:36:14,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 19:36:14,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 19:36:14,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:36:14,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:36:14,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 19:36:14,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:36:15,305 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 19:36:15,306 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:36:15,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [863613276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:36:15,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:36:15,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-03 19:36:15,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492920032] [2025-03-03 19:36:15,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:36:15,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 19:36:15,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:36:15,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 19:36:15,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-03 19:36:15,307 INFO L87 Difference]: Start difference. First operand 256 states and 357 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 19:36:16,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:36:16,798 INFO L93 Difference]: Finished difference Result 703 states and 968 transitions. [2025-03-03 19:36:16,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 19:36:16,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 129 [2025-03-03 19:36:16,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:36:16,806 INFO L225 Difference]: With dead ends: 703 [2025-03-03 19:36:16,806 INFO L226 Difference]: Without dead ends: 572 [2025-03-03 19:36:16,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-03 19:36:16,809 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 123 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:36:16,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 411 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 19:36:16,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-03 19:36:16,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 499. [2025-03-03 19:36:16,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 338 states have (on average 1.2396449704142012) internal successors, (419), 340 states have internal predecessors, (419), 137 states have call successors, (137), 23 states have call predecessors, (137), 23 states have return successors, (137), 135 states have call predecessors, (137), 137 states have call successors, (137) [2025-03-03 19:36:16,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 693 transitions. [2025-03-03 19:36:16,855 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 693 transitions. Word has length 129 [2025-03-03 19:36:16,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:36:16,856 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 693 transitions. [2025-03-03 19:36:16,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 19:36:16,856 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 693 transitions. [2025-03-03 19:36:16,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 19:36:16,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:36:16,857 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:36:16,866 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 (7)] Ended with exit code 0 [2025-03-03 19:36:17,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2025-03-03 19:36:17,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 19:36:17,258 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:36:17,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:36:17,259 INFO L85 PathProgramCache]: Analyzing trace with hash 548385655, now seen corresponding path program 1 times [2025-03-03 19:36:17,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:36:17,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103982718] [2025-03-03 19:36:17,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:36:17,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:36:17,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:36:17,261 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:36:17,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-03 19:36:17,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 19:36:17,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 19:36:17,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:36:17,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:36:17,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 19:36:17,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:36:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 150 proven. 48 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2025-03-03 19:36:17,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:36:18,127 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:36:18,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103982718] [2025-03-03 19:36:18,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103982718] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:36:18,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2007513879] [2025-03-03 19:36:18,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:36:18,128 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 19:36:18,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 19:36:18,130 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 19:36:18,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-03-03 19:36:18,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 19:36:18,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 19:36:18,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:36:18,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:36:18,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 19:36:18,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:36:19,108 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 19:36:19,109 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:36:19,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2007513879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:36:19,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:36:19,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-03-03 19:36:19,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147011241] [2025-03-03 19:36:19,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:36:19,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:36:19,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:36:19,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:36:19,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-03 19:36:19,110 INFO L87 Difference]: Start difference. First operand 499 states and 693 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 19:36:20,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:36:20,224 INFO L93 Difference]: Finished difference Result 870 states and 1208 transitions. [2025-03-03 19:36:20,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:36:20,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 129 [2025-03-03 19:36:20,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:36:20,232 INFO L225 Difference]: With dead ends: 870 [2025-03-03 19:36:20,232 INFO L226 Difference]: Without dead ends: 670 [2025-03-03 19:36:20,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-03 19:36:20,234 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 74 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 19:36:20,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 348 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 19:36:20,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2025-03-03 19:36:20,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 628. [2025-03-03 19:36:20,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 423 states have (on average 1.2340425531914894) internal successors, (522), 425 states have internal predecessors, (522), 175 states have call successors, (175), 29 states have call predecessors, (175), 29 states have return successors, (175), 173 states have call predecessors, (175), 175 states have call successors, (175) [2025-03-03 19:36:20,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 872 transitions. [2025-03-03 19:36:20,291 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 872 transitions. Word has length 129 [2025-03-03 19:36:20,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:36:20,291 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 872 transitions. [2025-03-03 19:36:20,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 19:36:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 872 transitions. [2025-03-03 19:36:20,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 19:36:20,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:36:20,293 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:36:20,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2025-03-03 19:36:20,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2025-03-03 19:36:20,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 19:36:20,694 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:36:20,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:36:20,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1529778194, now seen corresponding path program 1 times [2025-03-03 19:36:20,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:36:20,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823491836] [2025-03-03 19:36:20,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:36:20,695 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 19:36:20,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:36:20,696 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:36:20,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-03 19:36:20,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 19:36:20,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 19:36:20,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:36:20,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:36:20,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 19:36:20,876 INFO L279 TraceCheckSpWp]: Computing forward predicates...