./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-31.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 0facbc53e01d120e629a50b5211a29fd2bc23d2bc5e324a9623e8d1b2c65da11 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:51:50,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:51:51,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:51:51,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:51:51,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:51:51,074 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:51:51,075 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:51:51,075 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:51:51,076 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:51:51,076 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:51:51,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:51:51,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:51:51,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:51:51,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:51:51,077 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:51:51,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:51:51,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:51:51,077 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:51:51,077 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:51:51,077 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:51:51,077 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:51:51,077 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:51:51,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:51:51,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:51:51,077 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:51:51,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:51:51,077 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:51:51,077 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:51:51,077 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:51:51,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:51:51,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:51:51,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:51:51,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:51:51,078 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:51:51,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:51:51,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:51:51,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:51:51,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:51:51,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:51:51,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:51:51,078 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:51:51,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:51:51,078 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:51:51,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:51:51,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:51:51,078 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:51:51,078 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:51:51,078 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:51:51,078 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-jdk21/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 -> 0facbc53e01d120e629a50b5211a29fd2bc23d2bc5e324a9623e8d1b2c65da11 [2025-01-09 12:51:51,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:51:51,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:51:51,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:51:51,297 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:51:51,297 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:51:51,298 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-31.i [2025-01-09 12:51:52,419 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25cddec62/1e2f9074ecfa449091c98672f40c8c1f/FLAGc0e6793bf [2025-01-09 12:51:52,702 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:51:52,706 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-31.i [2025-01-09 12:51:52,715 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25cddec62/1e2f9074ecfa449091c98672f40c8c1f/FLAGc0e6793bf [2025-01-09 12:51:52,729 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25cddec62/1e2f9074ecfa449091c98672f40c8c1f [2025-01-09 12:51:52,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:51:52,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:51:52,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:51:52,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:51:52,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:51:52,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:51:52" (1/1) ... [2025-01-09 12:51:52,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e7b30ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:52, skipping insertion in model container [2025-01-09 12:51:52,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:51:52" (1/1) ... [2025-01-09 12:51:52,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:51:52,852 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-31.i[916,929] [2025-01-09 12:51:52,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:51:52,918 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:51:52,925 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-31.i[916,929] [2025-01-09 12:51:52,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:51:52,962 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:51:52,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:52 WrapperNode [2025-01-09 12:51:52,963 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:51:52,963 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:51:52,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:51:52,964 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:51:52,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:52" (1/1) ... [2025-01-09 12:51:52,979 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:52" (1/1) ... [2025-01-09 12:51:53,002 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 261 [2025-01-09 12:51:53,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:51:53,003 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:51:53,003 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:51:53,003 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:51:53,014 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:52" (1/1) ... [2025-01-09 12:51:53,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:52" (1/1) ... [2025-01-09 12:51:53,018 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:52" (1/1) ... [2025-01-09 12:51:53,031 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-01-09 12:51:53,031 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:52" (1/1) ... [2025-01-09 12:51:53,031 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:52" (1/1) ... [2025-01-09 12:51:53,039 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:52" (1/1) ... [2025-01-09 12:51:53,041 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:52" (1/1) ... [2025-01-09 12:51:53,043 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:52" (1/1) ... [2025-01-09 12:51:53,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:52" (1/1) ... [2025-01-09 12:51:53,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:52" (1/1) ... [2025-01-09 12:51:53,050 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:51:53,051 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:51:53,051 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:51:53,051 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:51:53,052 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:52" (1/1) ... [2025-01-09 12:51:53,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:51:53,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:51:53,074 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:51:53,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:51:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:51:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:51:53,091 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:51:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:51:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:51:53,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:51:53,156 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:51:53,158 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:51:53,483 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2025-01-09 12:51:53,484 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:51:53,494 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:51:53,495 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 12:51:53,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:51:53 BoogieIcfgContainer [2025-01-09 12:51:53,496 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:51:53,498 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:51:53,498 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:51:53,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:51:53,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:51:52" (1/3) ... [2025-01-09 12:51:53,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44304d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:51:53, skipping insertion in model container [2025-01-09 12:51:53,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:52" (2/3) ... [2025-01-09 12:51:53,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44304d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:51:53, skipping insertion in model container [2025-01-09 12:51:53,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:51:53" (3/3) ... [2025-01-09 12:51:53,503 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-31.i [2025-01-09 12:51:53,513 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:51:53,514 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-31.i that has 2 procedures, 105 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:51:53,552 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:51:53,561 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;@3d16c9c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:51:53,562 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:51:53,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 77 states have internal predecessors, (111), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 12:51:53,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 12:51:53,573 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:53,573 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:51:53,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:53,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:53,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1390159157, now seen corresponding path program 1 times [2025-01-09 12:51:53,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:51:53,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916217102] [2025-01-09 12:51:53,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:53,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:51:53,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 12:51:53,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 12:51:53,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:53,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-01-09 12:51:53,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:51:53,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916217102] [2025-01-09 12:51:53,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916217102] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:51:53,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956108374] [2025-01-09 12:51:53,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:53,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:51:53,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:51:53,921 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:51:53,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 12:51:54,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 12:51:54,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 12:51:54,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:54,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:54,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:51:54,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:51:54,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-01-09 12:51:54,107 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:51:54,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956108374] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:51:54,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:51:54,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:51:54,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251980994] [2025-01-09 12:51:54,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:51:54,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:51:54,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:51:54,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:51:54,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:51:54,129 INFO L87 Difference]: Start difference. First operand has 105 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 77 states have internal predecessors, (111), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 12:51:54,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:54,153 INFO L93 Difference]: Finished difference Result 197 states and 334 transitions. [2025-01-09 12:51:54,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:51:54,155 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172 [2025-01-09 12:51:54,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:54,159 INFO L225 Difference]: With dead ends: 197 [2025-01-09 12:51:54,159 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 12:51:54,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 173 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-01-09 12:51:54,162 INFO L435 NwaCegarLoop]: 145 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, 145 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-01-09 12:51:54,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:51:54,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 12:51:54,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-01-09 12:51:54,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 12:51:54,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 142 transitions. [2025-01-09 12:51:54,194 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 142 transitions. Word has length 172 [2025-01-09 12:51:54,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:54,194 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 142 transitions. [2025-01-09 12:51:54,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 12:51:54,195 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 142 transitions. [2025-01-09 12:51:54,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 12:51:54,197 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:54,197 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:51:54,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 12:51:54,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 12:51:54,398 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:54,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:54,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1235784323, now seen corresponding path program 1 times [2025-01-09 12:51:54,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:51:54,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20807136] [2025-01-09 12:51:54,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:54,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:51:54,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 12:51:54,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 12:51:54,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:54,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:54,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:51:54,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:51:54,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20807136] [2025-01-09 12:51:54,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20807136] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:51:54,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:51:54,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:51:54,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449182960] [2025-01-09 12:51:54,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:51:54,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:51:54,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:51:54,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:51:54,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:51:54,859 INFO L87 Difference]: Start difference. First operand 92 states and 142 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:51:55,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:55,053 INFO L93 Difference]: Finished difference Result 271 states and 421 transitions. [2025-01-09 12:51:55,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:51:55,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2025-01-09 12:51:55,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:55,056 INFO L225 Difference]: With dead ends: 271 [2025-01-09 12:51:55,056 INFO L226 Difference]: Without dead ends: 182 [2025-01-09 12:51:55,059 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-01-09 12:51:55,059 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 91 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:51:55,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 382 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:51:55,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-01-09 12:51:55,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 151. [2025-01-09 12:51:55,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 96 states have internal predecessors, (131), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 12:51:55,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 235 transitions. [2025-01-09 12:51:55,092 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 235 transitions. Word has length 172 [2025-01-09 12:51:55,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:55,092 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 235 transitions. [2025-01-09 12:51:55,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:51:55,093 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 235 transitions. [2025-01-09 12:51:55,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 12:51:55,094 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:55,094 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:51:55,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:51:55,095 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:55,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:55,095 INFO L85 PathProgramCache]: Analyzing trace with hash 918229040, now seen corresponding path program 1 times [2025-01-09 12:51:55,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:51:55,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105282813] [2025-01-09 12:51:55,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:55,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:51:55,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 12:51:55,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 12:51:55,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:55,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:55,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:51:55,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:51:55,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105282813] [2025-01-09 12:51:55,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105282813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:51:55,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:51:55,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:51:55,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543727753] [2025-01-09 12:51:55,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:51:55,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:51:55,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:51:55,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:51:55,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:51:55,347 INFO L87 Difference]: Start difference. First operand 151 states and 235 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:51:55,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:55,508 INFO L93 Difference]: Finished difference Result 271 states and 420 transitions. [2025-01-09 12:51:55,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:51:55,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2025-01-09 12:51:55,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:55,511 INFO L225 Difference]: With dead ends: 271 [2025-01-09 12:51:55,512 INFO L226 Difference]: Without dead ends: 182 [2025-01-09 12:51:55,513 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-01-09 12:51:55,513 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 89 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:51:55,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 384 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:51:55,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-01-09 12:51:55,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 152. [2025-01-09 12:51:55,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 97 states have internal predecessors, (132), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 12:51:55,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 236 transitions. [2025-01-09 12:51:55,539 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 236 transitions. Word has length 173 [2025-01-09 12:51:55,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:55,540 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 236 transitions. [2025-01-09 12:51:55,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:51:55,541 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 236 transitions. [2025-01-09 12:51:55,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 12:51:55,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:55,545 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:51:55,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:51:55,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:55,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:55,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1736531322, now seen corresponding path program 1 times [2025-01-09 12:51:55,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:51:55,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833336526] [2025-01-09 12:51:55,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:55,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:51:55,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 12:51:55,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 12:51:55,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:55,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:56,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:51:56,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:51:56,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833336526] [2025-01-09 12:51:56,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833336526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:51:56,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:51:56,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 12:51:56,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256230664] [2025-01-09 12:51:56,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:51:56,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 12:51:56,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:51:56,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 12:51:56,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:51:56,123 INFO L87 Difference]: Start difference. First operand 152 states and 236 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 12:51:56,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:56,559 INFO L93 Difference]: Finished difference Result 323 states and 490 transitions. [2025-01-09 12:51:56,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:51:56,559 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 174 [2025-01-09 12:51:56,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:56,561 INFO L225 Difference]: With dead ends: 323 [2025-01-09 12:51:56,561 INFO L226 Difference]: Without dead ends: 234 [2025-01-09 12:51:56,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:51:56,563 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 412 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:51:56,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 833 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:51:56,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-01-09 12:51:56,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 201. [2025-01-09 12:51:56,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 141 states have (on average 1.375886524822695) internal successors, (194), 142 states have internal predecessors, (194), 55 states have call successors, (55), 4 states have call predecessors, (55), 4 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2025-01-09 12:51:56,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 304 transitions. [2025-01-09 12:51:56,601 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 304 transitions. Word has length 174 [2025-01-09 12:51:56,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:56,602 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 304 transitions. [2025-01-09 12:51:56,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 12:51:56,602 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 304 transitions. [2025-01-09 12:51:56,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 12:51:56,605 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:56,605 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:51:56,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:51:56,605 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:56,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:56,606 INFO L85 PathProgramCache]: Analyzing trace with hash 927184696, now seen corresponding path program 1 times [2025-01-09 12:51:56,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:51:56,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846166875] [2025-01-09 12:51:56,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:56,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:51:56,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 12:51:56,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 12:51:56,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:56,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:56,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:51:56,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:51:56,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846166875] [2025-01-09 12:51:56,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846166875] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:51:56,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:51:56,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:51:56,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726835783] [2025-01-09 12:51:56,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:51:56,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:51:56,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:51:56,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:51:56,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:51:56,911 INFO L87 Difference]: Start difference. First operand 201 states and 304 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:51:57,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:57,062 INFO L93 Difference]: Finished difference Result 375 states and 569 transitions. [2025-01-09 12:51:57,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:51:57,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2025-01-09 12:51:57,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:57,065 INFO L225 Difference]: With dead ends: 375 [2025-01-09 12:51:57,065 INFO L226 Difference]: Without dead ends: 230 [2025-01-09 12:51:57,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-01-09 12:51:57,066 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 96 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:51:57,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 397 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:51:57,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-01-09 12:51:57,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 194. [2025-01-09 12:51:57,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 134 states have (on average 1.335820895522388) internal successors, (179), 135 states have internal predecessors, (179), 55 states have call successors, (55), 4 states have call predecessors, (55), 4 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2025-01-09 12:51:57,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2025-01-09 12:51:57,096 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 174 [2025-01-09 12:51:57,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:57,096 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 289 transitions. [2025-01-09 12:51:57,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:51:57,097 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2025-01-09 12:51:57,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 12:51:57,098 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:57,098 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:51:57,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:51:57,098 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:57,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:57,100 INFO L85 PathProgramCache]: Analyzing trace with hash -116324319, now seen corresponding path program 1 times [2025-01-09 12:51:57,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:51:57,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951335710] [2025-01-09 12:51:57,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:57,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:51:57,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 12:51:57,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 12:51:57,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:57,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:57,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:51:57,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:51:57,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951335710] [2025-01-09 12:51:57,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951335710] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:51:57,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:51:57,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:51:57,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102436475] [2025-01-09 12:51:57,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:51:57,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:51:57,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:51:57,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:51:57,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:51:57,320 INFO L87 Difference]: Start difference. First operand 194 states and 289 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:51:57,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:57,496 INFO L93 Difference]: Finished difference Result 509 states and 763 transitions. [2025-01-09 12:51:57,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 12:51:57,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2025-01-09 12:51:57,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:57,499 INFO L225 Difference]: With dead ends: 509 [2025-01-09 12:51:57,499 INFO L226 Difference]: Without dead ends: 375 [2025-01-09 12:51:57,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-01-09 12:51:57,500 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 213 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:51:57,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 658 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:51:57,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-01-09 12:51:57,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 287. [2025-01-09 12:51:57,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 196 states have (on average 1.3010204081632653) internal successors, (255), 198 states have internal predecessors, (255), 84 states have call successors, (84), 6 states have call predecessors, (84), 6 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 12:51:57,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 423 transitions. [2025-01-09 12:51:57,525 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 423 transitions. Word has length 175 [2025-01-09 12:51:57,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:57,526 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 423 transitions. [2025-01-09 12:51:57,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:51:57,526 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 423 transitions. [2025-01-09 12:51:57,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 12:51:57,527 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:57,527 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:51:57,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:51:57,528 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:57,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:57,528 INFO L85 PathProgramCache]: Analyzing trace with hash 102530399, now seen corresponding path program 1 times [2025-01-09 12:51:57,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:51:57,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266602549] [2025-01-09 12:51:57,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:57,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:51:57,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 12:51:57,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 12:51:57,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:57,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:59,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:51:59,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:51:59,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266602549] [2025-01-09 12:51:59,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266602549] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:51:59,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:51:59,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:51:59,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425754957] [2025-01-09 12:51:59,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:51:59,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:51:59,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:51:59,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:51:59,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:51:59,768 INFO L87 Difference]: Start difference. First operand 287 states and 423 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:52:00,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:52:00,472 INFO L93 Difference]: Finished difference Result 644 states and 938 transitions. [2025-01-09 12:52:00,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:52:00,473 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2025-01-09 12:52:00,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:52:00,476 INFO L225 Difference]: With dead ends: 644 [2025-01-09 12:52:00,476 INFO L226 Difference]: Without dead ends: 462 [2025-01-09 12:52:00,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:52:00,477 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 146 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:52:00,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 698 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 12:52:00,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-01-09 12:52:00,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 394. [2025-01-09 12:52:00,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 282 states have (on average 1.3191489361702127) internal successors, (372), 286 states have internal predecessors, (372), 102 states have call successors, (102), 9 states have call predecessors, (102), 9 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 12:52:00,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 576 transitions. [2025-01-09 12:52:00,508 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 576 transitions. Word has length 175 [2025-01-09 12:52:00,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:52:00,508 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 576 transitions. [2025-01-09 12:52:00,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:52:00,509 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 576 transitions. [2025-01-09 12:52:00,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 12:52:00,510 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:52:00,510 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:52:00,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 12:52:00,510 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:52:00,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:52:00,511 INFO L85 PathProgramCache]: Analyzing trace with hash 782588769, now seen corresponding path program 1 times [2025-01-09 12:52:00,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:52:00,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921401605] [2025-01-09 12:52:00,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:52:00,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:52:00,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 12:52:00,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 12:52:00,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:52:00,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:52:00,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:52:00,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:52:00,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921401605] [2025-01-09 12:52:00,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921401605] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:52:00,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:52:00,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 12:52:00,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482386596] [2025-01-09 12:52:00,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:52:00,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 12:52:00,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:52:00,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 12:52:00,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:52:00,826 INFO L87 Difference]: Start difference. First operand 394 states and 576 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:52:01,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:52:01,225 INFO L93 Difference]: Finished difference Result 800 states and 1173 transitions. [2025-01-09 12:52:01,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:52:01,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2025-01-09 12:52:01,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:52:01,229 INFO L225 Difference]: With dead ends: 800 [2025-01-09 12:52:01,229 INFO L226 Difference]: Without dead ends: 504 [2025-01-09 12:52:01,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:52:01,230 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 304 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:52:01,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 661 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:52:01,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-01-09 12:52:01,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 482. [2025-01-09 12:52:01,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 320 states have (on average 1.271875) internal successors, (407), 324 states have internal predecessors, (407), 148 states have call successors, (148), 13 states have call predecessors, (148), 13 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2025-01-09 12:52:01,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 703 transitions. [2025-01-09 12:52:01,280 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 703 transitions. Word has length 175 [2025-01-09 12:52:01,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:52:01,280 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 703 transitions. [2025-01-09 12:52:01,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:52:01,281 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 703 transitions. [2025-01-09 12:52:01,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 12:52:01,282 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:52:01,282 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:52:01,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 12:52:01,282 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:52:01,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:52:01,283 INFO L85 PathProgramCache]: Analyzing trace with hash -365536671, now seen corresponding path program 1 times [2025-01-09 12:52:01,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:52:01,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912528686] [2025-01-09 12:52:01,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:52:01,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:52:01,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 12:52:01,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 12:52:01,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:52:01,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:52:02,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:52:02,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:52:02,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912528686] [2025-01-09 12:52:02,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912528686] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:52:02,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:52:02,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 12:52:02,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342592554] [2025-01-09 12:52:02,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:52:02,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 12:52:02,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:52:02,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 12:52:02,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:52:02,917 INFO L87 Difference]: Start difference. First operand 482 states and 703 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:52:03,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:52:03,490 INFO L93 Difference]: Finished difference Result 1018 states and 1487 transitions. [2025-01-09 12:52:03,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 12:52:03,490 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2025-01-09 12:52:03,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:52:03,495 INFO L225 Difference]: With dead ends: 1018 [2025-01-09 12:52:03,495 INFO L226 Difference]: Without dead ends: 706 [2025-01-09 12:52:03,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:52:03,498 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 92 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:52:03,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 466 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 12:52:03,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2025-01-09 12:52:03,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 567. [2025-01-09 12:52:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 379 states have (on average 1.2638522427440633) internal successors, (479), 386 states have internal predecessors, (479), 169 states have call successors, (169), 18 states have call predecessors, (169), 18 states have return successors, (169), 162 states have call predecessors, (169), 169 states have call successors, (169) [2025-01-09 12:52:03,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 817 transitions. [2025-01-09 12:52:03,557 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 817 transitions. Word has length 175 [2025-01-09 12:52:03,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:52:03,558 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 817 transitions. [2025-01-09 12:52:03,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:52:03,558 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 817 transitions. [2025-01-09 12:52:03,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 12:52:03,559 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:52:03,560 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:52:03,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 12:52:03,560 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:52:03,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:52:03,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1491556826, now seen corresponding path program 1 times [2025-01-09 12:52:03,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:52:03,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96989666] [2025-01-09 12:52:03,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:52:03,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:52:03,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 12:52:03,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 12:52:03,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:52:03,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:52:04,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:52:04,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:52:04,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96989666] [2025-01-09 12:52:04,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96989666] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:52:04,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:52:04,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 12:52:04,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717285174] [2025-01-09 12:52:04,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:52:04,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:52:04,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:52:04,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:52:04,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:52:04,913 INFO L87 Difference]: Start difference. First operand 567 states and 817 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:52:05,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:52:05,993 INFO L93 Difference]: Finished difference Result 968 states and 1403 transitions. [2025-01-09 12:52:05,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 12:52:05,994 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2025-01-09 12:52:05,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:52:05,997 INFO L225 Difference]: With dead ends: 968 [2025-01-09 12:52:05,997 INFO L226 Difference]: Without dead ends: 598 [2025-01-09 12:52:05,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2025-01-09 12:52:06,000 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 398 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:52:06,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 855 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 12:52:06,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-01-09 12:52:06,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 571. [2025-01-09 12:52:06,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 383 states have (on average 1.2610966057441253) internal successors, (483), 390 states have internal predecessors, (483), 169 states have call successors, (169), 18 states have call predecessors, (169), 18 states have return successors, (169), 162 states have call predecessors, (169), 169 states have call successors, (169) [2025-01-09 12:52:06,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 821 transitions. [2025-01-09 12:52:06,040 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 821 transitions. Word has length 176 [2025-01-09 12:52:06,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:52:06,040 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 821 transitions. [2025-01-09 12:52:06,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:52:06,041 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 821 transitions. [2025-01-09 12:52:06,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 12:52:06,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:52:06,042 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:52:06,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 12:52:06,042 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:52:06,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:52:06,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1959623896, now seen corresponding path program 1 times [2025-01-09 12:52:06,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:52:06,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925408121] [2025-01-09 12:52:06,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:52:06,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:52:06,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 12:52:06,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 12:52:06,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:52:06,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:52:09,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:52:09,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:52:09,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925408121] [2025-01-09 12:52:09,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925408121] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:52:09,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:52:09,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 12:52:09,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556201835] [2025-01-09 12:52:09,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:52:09,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 12:52:09,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:52:09,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 12:52:09,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-01-09 12:52:09,365 INFO L87 Difference]: Start difference. First operand 571 states and 821 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:52:11,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:52:11,364 INFO L93 Difference]: Finished difference Result 1125 states and 1607 transitions. [2025-01-09 12:52:11,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 12:52:11,365 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2025-01-09 12:52:11,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:52:11,369 INFO L225 Difference]: With dead ends: 1125 [2025-01-09 12:52:11,369 INFO L226 Difference]: Without dead ends: 698 [2025-01-09 12:52:11,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=221, Invalid=771, Unknown=0, NotChecked=0, Total=992 [2025-01-09 12:52:11,371 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 545 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:52:11,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1059 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 12:52:11,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-01-09 12:52:11,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 596. [2025-01-09 12:52:11,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 408 states have (on average 1.2745098039215685) internal successors, (520), 415 states have internal predecessors, (520), 169 states have call successors, (169), 18 states have call predecessors, (169), 18 states have return successors, (169), 162 states have call predecessors, (169), 169 states have call successors, (169) [2025-01-09 12:52:11,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 858 transitions. [2025-01-09 12:52:11,412 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 858 transitions. Word has length 176 [2025-01-09 12:52:11,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:52:11,412 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 858 transitions. [2025-01-09 12:52:11,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:52:11,413 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 858 transitions. [2025-01-09 12:52:11,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 12:52:11,414 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:52:11,414 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:52:11,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 12:52:11,414 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:52:11,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:52:11,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1749722264, now seen corresponding path program 1 times [2025-01-09 12:52:11,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:52:11,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472943185] [2025-01-09 12:52:11,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:52:11,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:52:11,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 12:52:11,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 12:52:11,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:52:11,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:52:13,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:52:13,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:52:13,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472943185] [2025-01-09 12:52:13,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472943185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:52:13,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:52:13,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 12:52:13,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381139631] [2025-01-09 12:52:13,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:52:13,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:52:13,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:52:13,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:52:13,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:52:13,237 INFO L87 Difference]: Start difference. First operand 596 states and 858 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:52:14,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:52:14,159 INFO L93 Difference]: Finished difference Result 1200 states and 1723 transitions. [2025-01-09 12:52:14,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 12:52:14,161 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2025-01-09 12:52:14,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:52:14,165 INFO L225 Difference]: With dead ends: 1200 [2025-01-09 12:52:14,165 INFO L226 Difference]: Without dead ends: 830 [2025-01-09 12:52:14,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-01-09 12:52:14,167 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 174 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:52:14,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 752 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 12:52:14,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2025-01-09 12:52:14,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 650. [2025-01-09 12:52:14,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 462 states have (on average 1.3073593073593073) internal successors, (604), 469 states have internal predecessors, (604), 169 states have call successors, (169), 18 states have call predecessors, (169), 18 states have return successors, (169), 162 states have call predecessors, (169), 169 states have call successors, (169) [2025-01-09 12:52:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 942 transitions. [2025-01-09 12:52:14,206 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 942 transitions. Word has length 176 [2025-01-09 12:52:14,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:52:14,206 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 942 transitions. [2025-01-09 12:52:14,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:52:14,206 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 942 transitions. [2025-01-09 12:52:14,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 12:52:14,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:52:14,207 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:52:14,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 12:52:14,208 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:52:14,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:52:14,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1366608604, now seen corresponding path program 1 times [2025-01-09 12:52:14,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:52:14,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040305773] [2025-01-09 12:52:14,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:52:14,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:52:14,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 12:52:14,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 12:52:14,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:52:14,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:52:16,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:52:16,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:52:16,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040305773] [2025-01-09 12:52:16,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040305773] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:52:16,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:52:16,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 12:52:16,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257197082] [2025-01-09 12:52:16,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:52:16,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 12:52:16,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:52:16,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 12:52:16,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:52:16,894 INFO L87 Difference]: Start difference. First operand 650 states and 942 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:52:20,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:52:20,149 INFO L93 Difference]: Finished difference Result 1171 states and 1687 transitions. [2025-01-09 12:52:20,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 12:52:20,150 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-01-09 12:52:20,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:52:20,155 INFO L225 Difference]: With dead ends: 1171 [2025-01-09 12:52:20,155 INFO L226 Difference]: Without dead ends: 751 [2025-01-09 12:52:20,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=277, Invalid=845, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 12:52:20,157 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 420 mSDsluCounter, 1815 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 2064 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:52:20,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 2064 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 12:52:20,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-01-09 12:52:20,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 643. [2025-01-09 12:52:20,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 455 states have (on average 1.3054945054945055) internal successors, (594), 462 states have internal predecessors, (594), 169 states have call successors, (169), 18 states have call predecessors, (169), 18 states have return successors, (169), 162 states have call predecessors, (169), 169 states have call successors, (169) [2025-01-09 12:52:20,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 932 transitions. [2025-01-09 12:52:20,196 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 932 transitions. Word has length 177 [2025-01-09 12:52:20,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:52:20,197 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 932 transitions. [2025-01-09 12:52:20,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:52:20,197 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 932 transitions. [2025-01-09 12:52:20,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 12:52:20,199 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:52:20,199 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:52:20,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 12:52:20,199 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:52:20,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:52:20,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1156706972, now seen corresponding path program 1 times [2025-01-09 12:52:20,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:52:20,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296918123] [2025-01-09 12:52:20,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:52:20,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:52:20,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 12:52:20,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 12:52:20,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:52:20,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:52:23,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:52:23,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:52:23,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296918123] [2025-01-09 12:52:23,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296918123] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:52:23,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:52:23,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:52:23,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002430239] [2025-01-09 12:52:23,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:52:23,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:52:23,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:52:23,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:52:23,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:52:23,448 INFO L87 Difference]: Start difference. First operand 643 states and 932 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:52:24,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:52:24,792 INFO L93 Difference]: Finished difference Result 1405 states and 2019 transitions. [2025-01-09 12:52:24,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:52:24,793 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-01-09 12:52:24,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:52:24,797 INFO L225 Difference]: With dead ends: 1405 [2025-01-09 12:52:24,798 INFO L226 Difference]: Without dead ends: 985 [2025-01-09 12:52:24,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-01-09 12:52:24,799 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 223 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:52:24,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 815 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 12:52:24,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2025-01-09 12:52:24,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 698. [2025-01-09 12:52:24,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 510 states have (on average 1.3352941176470587) internal successors, (681), 517 states have internal predecessors, (681), 169 states have call successors, (169), 18 states have call predecessors, (169), 18 states have return successors, (169), 162 states have call predecessors, (169), 169 states have call successors, (169) [2025-01-09 12:52:24,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1019 transitions. [2025-01-09 12:52:24,839 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1019 transitions. Word has length 177 [2025-01-09 12:52:24,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:52:24,840 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1019 transitions. [2025-01-09 12:52:24,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:52:24,840 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1019 transitions. [2025-01-09 12:52:24,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 12:52:24,841 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:52:24,841 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:52:24,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 12:52:24,841 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:52:24,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:52:24,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1990134884, now seen corresponding path program 1 times [2025-01-09 12:52:24,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:52:24,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291556280] [2025-01-09 12:52:24,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:52:24,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:52:24,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 12:52:24,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 12:52:24,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:52:24,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:52:27,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:52:27,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:52:27,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291556280] [2025-01-09 12:52:27,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291556280] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:52:27,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:52:27,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 12:52:27,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524408095] [2025-01-09 12:52:27,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:52:27,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 12:52:27,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:52:27,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 12:52:27,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:52:27,740 INFO L87 Difference]: Start difference. First operand 698 states and 1019 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:52:29,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:52:29,175 INFO L93 Difference]: Finished difference Result 1281 states and 1856 transitions. [2025-01-09 12:52:29,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 12:52:29,176 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-01-09 12:52:29,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:52:29,179 INFO L225 Difference]: With dead ends: 1281 [2025-01-09 12:52:29,179 INFO L226 Difference]: Without dead ends: 823 [2025-01-09 12:52:29,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=376, Invalid=1184, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 12:52:29,181 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 458 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 12:52:29,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 1996 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 12:52:29,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2025-01-09 12:52:29,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 699. [2025-01-09 12:52:29,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 511 states have (on average 1.3365949119373777) internal successors, (683), 518 states have internal predecessors, (683), 169 states have call successors, (169), 18 states have call predecessors, (169), 18 states have return successors, (169), 162 states have call predecessors, (169), 169 states have call successors, (169) [2025-01-09 12:52:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1021 transitions. [2025-01-09 12:52:29,216 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1021 transitions. Word has length 177 [2025-01-09 12:52:29,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:52:29,216 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 1021 transitions. [2025-01-09 12:52:29,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:52:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1021 transitions. [2025-01-09 12:52:29,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 12:52:29,217 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:52:29,217 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:52:29,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 12:52:29,217 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:52:29,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:52:29,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1624774042, now seen corresponding path program 1 times [2025-01-09 12:52:29,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:52:29,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730995595] [2025-01-09 12:52:29,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:52:29,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:52:29,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 12:52:29,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 12:52:29,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:52:29,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:52:29,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:52:29,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:52:29,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730995595] [2025-01-09 12:52:29,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730995595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:52:29,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:52:29,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 12:52:29,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881902952] [2025-01-09 12:52:29,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:52:29,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:52:29,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:52:29,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:52:29,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:52:29,507 INFO L87 Difference]: Start difference. First operand 699 states and 1021 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:52:29,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:52:29,970 INFO L93 Difference]: Finished difference Result 1262 states and 1836 transitions. [2025-01-09 12:52:29,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 12:52:29,971 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-01-09 12:52:29,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:52:29,975 INFO L225 Difference]: With dead ends: 1262 [2025-01-09 12:52:29,975 INFO L226 Difference]: Without dead ends: 797 [2025-01-09 12:52:29,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2025-01-09 12:52:29,977 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 450 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:52:29,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1510 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:52:29,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2025-01-09 12:52:30,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 699. [2025-01-09 12:52:30,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 511 states have (on average 1.3346379647749511) internal successors, (682), 518 states have internal predecessors, (682), 169 states have call successors, (169), 18 states have call predecessors, (169), 18 states have return successors, (169), 162 states have call predecessors, (169), 169 states have call successors, (169) [2025-01-09 12:52:30,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1020 transitions. [2025-01-09 12:52:30,029 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1020 transitions. Word has length 177 [2025-01-09 12:52:30,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:52:30,029 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 1020 transitions. [2025-01-09 12:52:30,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:52:30,029 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1020 transitions. [2025-01-09 12:52:30,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 12:52:30,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:52:30,030 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:52:30,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 12:52:30,030 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:52:30,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:52:30,031 INFO L85 PathProgramCache]: Analyzing trace with hash -734005146, now seen corresponding path program 1 times [2025-01-09 12:52:30,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:52:30,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549675746] [2025-01-09 12:52:30,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:52:30,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:52:30,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 12:52:30,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 12:52:30,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:52:30,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:52:30,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:52:30,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:52:30,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549675746] [2025-01-09 12:52:30,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549675746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:52:30,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:52:30,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:52:30,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016075904] [2025-01-09 12:52:30,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:52:30,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:52:30,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:52:30,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:52:30,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:52:30,070 INFO L87 Difference]: Start difference. First operand 699 states and 1020 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:52:30,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:52:30,128 INFO L93 Difference]: Finished difference Result 1415 states and 2065 transitions. [2025-01-09 12:52:30,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:52:30,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-01-09 12:52:30,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:52:30,136 INFO L225 Difference]: With dead ends: 1415 [2025-01-09 12:52:30,136 INFO L226 Difference]: Without dead ends: 878 [2025-01-09 12:52:30,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:52:30,137 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 122 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:52:30,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 306 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:52:30,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2025-01-09 12:52:30,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 833. [2025-01-09 12:52:30,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 594 states have (on average 1.2962962962962963) internal successors, (770), 604 states have internal predecessors, (770), 213 states have call successors, (213), 25 states have call predecessors, (213), 25 states have return successors, (213), 203 states have call predecessors, (213), 213 states have call successors, (213) [2025-01-09 12:52:30,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1196 transitions. [2025-01-09 12:52:30,185 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1196 transitions. Word has length 177 [2025-01-09 12:52:30,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:52:30,185 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1196 transitions. [2025-01-09 12:52:30,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:52:30,185 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1196 transitions. [2025-01-09 12:52:30,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 12:52:30,186 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:52:30,186 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:52:30,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 12:52:30,186 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:52:30,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:52:30,187 INFO L85 PathProgramCache]: Analyzing trace with hash 62051382, now seen corresponding path program 1 times [2025-01-09 12:52:30,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:52:30,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883160899] [2025-01-09 12:52:30,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:52:30,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:52:30,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 12:52:30,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 12:52:30,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:52:30,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:52:30,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 27 proven. 48 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-01-09 12:52:30,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:52:30,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883160899] [2025-01-09 12:52:30,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883160899] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:52:30,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58518337] [2025-01-09 12:52:30,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:52:30,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:52:30,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:52:30,495 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:52:30,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 12:52:30,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 12:52:30,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 12:52:30,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:52:30,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:52:30,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 12:52:30,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:52:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 637 proven. 90 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2025-01-09 12:52:30,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:52:31,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 27 proven. 48 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-01-09 12:52:31,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58518337] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:52:31,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 12:52:31,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 16 [2025-01-09 12:52:31,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539442039] [2025-01-09 12:52:31,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 12:52:31,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 12:52:31,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:52:31,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 12:52:31,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:52:31,047 INFO L87 Difference]: Start difference. First operand 833 states and 1196 transitions. Second operand has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-01-09 12:52:31,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:52:31,779 INFO L93 Difference]: Finished difference Result 1531 states and 2172 transitions. [2025-01-09 12:52:31,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-01-09 12:52:31,780 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 177 [2025-01-09 12:52:31,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:52:31,784 INFO L225 Difference]: With dead ends: 1531 [2025-01-09 12:52:31,784 INFO L226 Difference]: Without dead ends: 904 [2025-01-09 12:52:31,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 349 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=453, Invalid=1439, Unknown=0, NotChecked=0, Total=1892 [2025-01-09 12:52:31,786 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 705 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:52:31,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 971 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 12:52:31,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2025-01-09 12:52:31,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 672. [2025-01-09 12:52:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 469 states have (on average 1.279317697228145) internal successors, (600), 474 states have internal predecessors, (600), 174 states have call successors, (174), 28 states have call predecessors, (174), 28 states have return successors, (174), 169 states have call predecessors, (174), 174 states have call successors, (174) [2025-01-09 12:52:31,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 948 transitions. [2025-01-09 12:52:31,826 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 948 transitions. Word has length 177 [2025-01-09 12:52:31,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:52:31,826 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 948 transitions. [2025-01-09 12:52:31,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-01-09 12:52:31,826 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 948 transitions. [2025-01-09 12:52:31,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 12:52:31,827 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:52:31,827 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:52:31,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 12:52:32,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 12:52:32,028 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:52:32,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:52:32,028 INFO L85 PathProgramCache]: Analyzing trace with hash 362012167, now seen corresponding path program 1 times [2025-01-09 12:52:32,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:52:32,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736998764] [2025-01-09 12:52:32,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:52:32,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:52:32,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 12:52:32,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 12:52:32,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:52:32,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:52:32,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:52:32,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:52:32,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736998764] [2025-01-09 12:52:32,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736998764] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:52:32,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:52:32,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 12:52:32,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504476462] [2025-01-09 12:52:32,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:52:32,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 12:52:32,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:52:32,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 12:52:32,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:52:32,822 INFO L87 Difference]: Start difference. First operand 672 states and 948 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 12:52:34,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:52:34,722 INFO L93 Difference]: Finished difference Result 2353 states and 3301 transitions. [2025-01-09 12:52:34,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 12:52:34,722 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 177 [2025-01-09 12:52:34,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:52:34,729 INFO L225 Difference]: With dead ends: 2353 [2025-01-09 12:52:34,729 INFO L226 Difference]: Without dead ends: 1839 [2025-01-09 12:52:34,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2025-01-09 12:52:34,731 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 722 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:52:34,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1127 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 12:52:34,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2025-01-09 12:52:34,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1524. [2025-01-09 12:52:34,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 1084 states have (on average 1.2961254612546125) internal successors, (1405), 1097 states have internal predecessors, (1405), 380 states have call successors, (380), 59 states have call predecessors, (380), 59 states have return successors, (380), 367 states have call predecessors, (380), 380 states have call successors, (380) [2025-01-09 12:52:34,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 2165 transitions. [2025-01-09 12:52:34,835 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 2165 transitions. Word has length 177 [2025-01-09 12:52:34,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:52:34,836 INFO L471 AbstractCegarLoop]: Abstraction has 1524 states and 2165 transitions. [2025-01-09 12:52:34,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 12:52:34,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 2165 transitions. [2025-01-09 12:52:34,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 12:52:34,837 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:52:34,837 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:52:34,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 12:52:34,837 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:52:34,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:52:34,837 INFO L85 PathProgramCache]: Analyzing trace with hash 2137019529, now seen corresponding path program 1 times [2025-01-09 12:52:34,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:52:34,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262706818] [2025-01-09 12:52:34,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:52:34,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:52:34,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 12:52:34,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 12:52:34,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:52:34,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:52:35,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:52:35,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:52:35,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262706818] [2025-01-09 12:52:35,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262706818] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:52:35,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:52:35,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:52:35,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140884353] [2025-01-09 12:52:35,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:52:35,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:52:35,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:52:35,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:52:35,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:52:35,090 INFO L87 Difference]: Start difference. First operand 1524 states and 2165 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:52:35,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:52:35,292 INFO L93 Difference]: Finished difference Result 3071 states and 4365 transitions. [2025-01-09 12:52:35,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:52:35,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-01-09 12:52:35,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:52:35,301 INFO L225 Difference]: With dead ends: 3071 [2025-01-09 12:52:35,302 INFO L226 Difference]: Without dead ends: 1750 [2025-01-09 12:52:35,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:52:35,305 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 107 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:52:35,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 443 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:52:35,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2025-01-09 12:52:35,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1463. [2025-01-09 12:52:35,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1463 states, 1023 states have (on average 1.278592375366569) internal successors, (1308), 1036 states have internal predecessors, (1308), 380 states have call successors, (380), 59 states have call predecessors, (380), 59 states have return successors, (380), 367 states have call predecessors, (380), 380 states have call successors, (380) [2025-01-09 12:52:35,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 2068 transitions. [2025-01-09 12:52:35,405 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 2068 transitions. Word has length 177 [2025-01-09 12:52:35,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:52:35,407 INFO L471 AbstractCegarLoop]: Abstraction has 1463 states and 2068 transitions. [2025-01-09 12:52:35,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:52:35,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2068 transitions. [2025-01-09 12:52:35,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 12:52:35,408 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:52:35,408 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:52:35,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 12:52:35,408 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:52:35,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:52:35,409 INFO L85 PathProgramCache]: Analyzing trace with hash -31014843, now seen corresponding path program 1 times [2025-01-09 12:52:35,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:52:35,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280774571] [2025-01-09 12:52:35,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:52:35,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:52:35,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 12:52:35,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 12:52:35,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:52:35,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:52:35,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:52:35,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:52:35,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280774571] [2025-01-09 12:52:35,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280774571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:52:35,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:52:35,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:52:35,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527756434] [2025-01-09 12:52:35,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:52:35,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:52:35,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:52:35,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:52:35,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:52:35,542 INFO L87 Difference]: Start difference. First operand 1463 states and 2068 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 12:52:36,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:52:36,301 INFO L93 Difference]: Finished difference Result 5259 states and 7533 transitions. [2025-01-09 12:52:36,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:52:36,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 177 [2025-01-09 12:52:36,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:52:36,347 INFO L225 Difference]: With dead ends: 5259 [2025-01-09 12:52:36,347 INFO L226 Difference]: Without dead ends: 4747 [2025-01-09 12:52:36,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:52:36,353 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 711 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 12:52:36,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 787 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 12:52:36,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4747 states. [2025-01-09 12:52:36,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4747 to 3507. [2025-01-09 12:52:36,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3507 states, 2420 states have (on average 1.2739669421487603) internal successors, (3083), 2450 states have internal predecessors, (3083), 945 states have call successors, (945), 141 states have call predecessors, (945), 141 states have return successors, (945), 915 states have call predecessors, (945), 945 states have call successors, (945) [2025-01-09 12:52:36,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3507 states to 3507 states and 4973 transitions. [2025-01-09 12:52:36,732 INFO L78 Accepts]: Start accepts. Automaton has 3507 states and 4973 transitions. Word has length 177 [2025-01-09 12:52:36,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:52:36,732 INFO L471 AbstractCegarLoop]: Abstraction has 3507 states and 4973 transitions. [2025-01-09 12:52:36,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 12:52:36,732 INFO L276 IsEmpty]: Start isEmpty. Operand 3507 states and 4973 transitions. [2025-01-09 12:52:36,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 12:52:36,737 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:52:36,737 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:52:36,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 12:52:36,737 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:52:36,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:52:36,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1743992519, now seen corresponding path program 1 times [2025-01-09 12:52:36,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:52:36,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787057764] [2025-01-09 12:52:36,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:52:36,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:52:36,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 12:52:36,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 12:52:36,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:52:36,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:52:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:52:39,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:52:39,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787057764] [2025-01-09 12:52:39,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787057764] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:52:39,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:52:39,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:52:39,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51894948] [2025-01-09 12:52:39,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:52:39,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:52:39,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:52:39,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:52:39,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:52:39,148 INFO L87 Difference]: Start difference. First operand 3507 states and 4973 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:52:40,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:52:40,135 INFO L93 Difference]: Finished difference Result 6694 states and 9531 transitions. [2025-01-09 12:52:40,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:52:40,137 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-01-09 12:52:40,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:52:40,156 INFO L225 Difference]: With dead ends: 6694 [2025-01-09 12:52:40,156 INFO L226 Difference]: Without dead ends: 3567 [2025-01-09 12:52:40,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:52:40,166 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 63 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:52:40,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 716 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 12:52:40,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3567 states. [2025-01-09 12:52:40,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3567 to 3503. [2025-01-09 12:52:40,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3503 states, 2416 states have (on average 1.2682119205298013) internal successors, (3064), 2446 states have internal predecessors, (3064), 945 states have call successors, (945), 141 states have call predecessors, (945), 141 states have return successors, (945), 915 states have call predecessors, (945), 945 states have call successors, (945) [2025-01-09 12:52:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 4954 transitions. [2025-01-09 12:52:40,557 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 4954 transitions. Word has length 177 [2025-01-09 12:52:40,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:52:40,558 INFO L471 AbstractCegarLoop]: Abstraction has 3503 states and 4954 transitions. [2025-01-09 12:52:40,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:52:40,559 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 4954 transitions. [2025-01-09 12:52:40,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 12:52:40,560 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:52:40,560 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:52:40,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 12:52:40,560 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:52:40,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:52:40,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1447552829, now seen corresponding path program 1 times [2025-01-09 12:52:40,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:52:40,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281241468] [2025-01-09 12:52:40,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:52:40,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:52:40,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 12:52:40,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 12:52:40,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:52:40,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:52:40,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1202149637] [2025-01-09 12:52:40,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:52:40,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:52:40,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:52:40,632 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:52:40,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 12:52:40,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 12:52:40,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 12:52:40,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:52:40,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:52:40,900 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:52:40,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 12:52:40,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 12:52:40,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:52:40,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:52:41,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:52:41,029 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:52:41,031 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:52:41,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 12:52:41,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:52:41,235 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:52:41,345 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:52:41,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:52:41 BoogieIcfgContainer [2025-01-09 12:52:41,348 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:52:41,349 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:52:41,349 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:52:41,349 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:52:41,350 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:51:53" (3/4) ... [2025-01-09 12:52:41,352 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:52:41,352 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:52:41,354 INFO L158 Benchmark]: Toolchain (without parser) took 48620.50ms. Allocated memory was 167.8MB in the beginning and 704.6MB in the end (delta: 536.9MB). Free memory was 123.4MB in the beginning and 630.0MB in the end (delta: -506.6MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2025-01-09 12:52:41,354 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:52:41,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.46ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 107.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:52:41,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.34ms. Allocated memory is still 167.8MB. Free memory was 107.2MB in the beginning and 102.7MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:52:41,355 INFO L158 Benchmark]: Boogie Preprocessor took 47.29ms. Allocated memory is still 167.8MB. Free memory was 102.7MB in the beginning and 95.1MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:52:41,355 INFO L158 Benchmark]: RCFGBuilder took 445.30ms. Allocated memory is still 167.8MB. Free memory was 95.1MB in the beginning and 62.7MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 12:52:41,355 INFO L158 Benchmark]: TraceAbstraction took 47850.49ms. Allocated memory was 167.8MB in the beginning and 704.6MB in the end (delta: 536.9MB). Free memory was 62.0MB in the beginning and 630.2MB in the end (delta: -568.1MB). Peak memory consumption was 359.6MB. Max. memory is 16.1GB. [2025-01-09 12:52:41,356 INFO L158 Benchmark]: Witness Printer took 3.33ms. Allocated memory is still 704.6MB. Free memory was 630.2MB in the beginning and 630.0MB in the end (delta: 144.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:52:41,356 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.46ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 107.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.34ms. Allocated memory is still 167.8MB. Free memory was 107.2MB in the beginning and 102.7MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.29ms. Allocated memory is still 167.8MB. Free memory was 102.7MB in the beginning and 95.1MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 445.30ms. Allocated memory is still 167.8MB. Free memory was 95.1MB in the beginning and 62.7MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 47850.49ms. Allocated memory was 167.8MB in the beginning and 704.6MB in the end (delta: 536.9MB). Free memory was 62.0MB in the beginning and 630.2MB in the end (delta: -568.1MB). Peak memory consumption was 359.6MB. Max. memory is 16.1GB. * Witness Printer took 3.33ms. Allocated memory is still 704.6MB. Free memory was 630.2MB in the beginning and 630.0MB in the end (delta: 144.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 206, overapproximation of someUnaryDOUBLEoperation at line 46, overapproximation of bitwiseAnd at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 193, overapproximation of someBinaryDOUBLEComparisonOperation at line 206, overapproximation of someBinaryDOUBLEComparisonOperation at line 191, overapproximation of someBinaryDOUBLEComparisonOperation at line 195. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 200; [L23] unsigned long int var_1_4 = 32; [L24] unsigned char var_1_6 = 1; [L25] unsigned char var_1_7 = 0; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 50; [L30] unsigned long int var_1_14 = 1000000000; [L31] unsigned short int var_1_15 = 10; [L32] unsigned short int var_1_16 = 39011; [L33] unsigned long int var_1_17 = 4; [L34] signed char var_1_18 = 4; [L35] signed char var_1_21 = 16; [L36] signed char var_1_22 = 64; [L37] signed long int var_1_23 = 8; [L38] unsigned char var_1_24 = 0; [L39] unsigned char var_1_25 = 0; [L40] unsigned char var_1_26 = 0; [L41] unsigned char var_1_27 = 0; [L42] double var_1_28 = 25.5; [L43] double var_1_29 = 255.25; [L44] double var_1_30 = 24.7; [L45] double var_1_31 = 31.2; [L46] float var_1_32 = -0.2; [L47] unsigned char var_1_33 = 10; [L48] float var_1_34 = 24.5; [L49] unsigned char last_1_var_1_7 = 0; [L50] unsigned short int last_1_var_1_15 = 10; [L51] unsigned long int last_1_var_1_17 = 4; [L52] signed long int last_1_var_1_23 = 8; [L53] unsigned char last_1_var_1_24 = 0; [L54] unsigned char last_1_var_1_33 = 10; VAL [isInitial=0, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=32, var_1_6=1, var_1_7=0] [L210] isInitial = 1 [L211] FCALL initially() [L212] int k_loop; [L213] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=32, var_1_6=1, var_1_7=0] [L213] COND TRUE k_loop < 1 [L214] CALL updateLastVariables() [L198] last_1_var_1_7 = var_1_7 [L199] last_1_var_1_15 = var_1_15 [L200] last_1_var_1_17 = var_1_17 [L201] last_1_var_1_23 = var_1_23 [L202] last_1_var_1_24 = var_1_24 [L203] last_1_var_1_33 = var_1_33 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=32, var_1_6=1, var_1_7=0] [L214] RET updateLastVariables() [L215] CALL updateVariables() [L156] var_1_4 = __VERIFIER_nondet_ulong() [L157] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_6=1, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_6=1, var_1_7=0] [L157] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_6=1, var_1_7=0] [L158] CALL assume_abort_if_not(var_1_4 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_6=1, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_6=1, var_1_7=0] [L158] RET assume_abort_if_not(var_1_4 <= 4294967295) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_6=1, var_1_7=0] [L159] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=1, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=1, var_1_7=0] [L159] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=1, var_1_7=0] [L160] var_1_6 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_7=0] [L161] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_7=0] [L162] CALL assume_abort_if_not(var_1_6 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L162] RET assume_abort_if_not(var_1_6 <= 254) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L163] var_1_10 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L164] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L165] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L165] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L166] var_1_11 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L167] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L168] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L168] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L169] var_1_12 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L170] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L171] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L171] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L172] var_1_16 = __VERIFIER_nondet_ushort() [L173] CALL assume_abort_if_not(var_1_16 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L173] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L174] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L174] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L175] var_1_21 = __VERIFIER_nondet_char() [L176] CALL assume_abort_if_not(var_1_21 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L176] RET assume_abort_if_not(var_1_21 >= -1) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L177] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L177] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L178] var_1_22 = __VERIFIER_nondet_char() [L179] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L179] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L180] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L180] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L181] var_1_25 = __VERIFIER_nondet_uchar() [L182] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L182] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L183] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L183] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L184] var_1_26 = __VERIFIER_nondet_uchar() [L185] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L185] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L186] CALL assume_abort_if_not(var_1_26 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L186] RET assume_abort_if_not(var_1_26 <= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L187] var_1_27 = __VERIFIER_nondet_uchar() [L188] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L188] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L189] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L189] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L190] var_1_29 = __VERIFIER_nondet_double() [L191] CALL assume_abort_if_not((var_1_29 >= 0.0F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L191] RET assume_abort_if_not((var_1_29 >= 0.0F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L192] var_1_30 = __VERIFIER_nondet_double() [L193] CALL assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L193] RET assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L194] var_1_31 = __VERIFIER_nondet_double() [L195] CALL assume_abort_if_not((var_1_31 >= -461168.6018427382800e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 4611686.018427382800e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L195] RET assume_abort_if_not((var_1_31 >= -461168.6018427382800e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 4611686.018427382800e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L215] RET updateVariables() [L216] CALL step() [L58] signed long int stepLocal_8 = last_1_var_1_33; VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_8=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L59] COND FALSE !(stepLocal_8 <= ((last_1_var_1_17 / var_1_4) / var_1_16)) [L68] var_1_18 = var_1_21 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L70] COND FALSE !(! (! (last_1_var_1_7 && last_1_var_1_24))) [L77] var_1_15 = last_1_var_1_23 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L79] var_1_14 = (var_1_6 + var_1_15) [L80] unsigned char stepLocal_9 = last_1_var_1_7; VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_9=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L81] COND TRUE ! last_1_var_1_24 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_9=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L82] COND FALSE !(stepLocal_9 && (last_1_var_1_33 >= ((((last_1_var_1_17) < (var_1_4)) ? (last_1_var_1_17) : (var_1_4))))) [L85] var_1_24 = var_1_12 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L90] unsigned short int stepLocal_10 = var_1_15; VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_10=8, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L91] COND FALSE !(stepLocal_10 < var_1_4) [L98] var_1_28 = (100.4 + var_1_30) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_33=10, var_1_34=49/2, var_1_4=6, var_1_6=0, var_1_7=0] [L100] var_1_32 = var_1_29 [L101] var_1_33 = var_1_22 [L102] var_1_34 = var_1_29 [L103] unsigned char stepLocal_7 = var_1_12; VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=6, var_1_6=0, var_1_7=0] [L104] EXPR last_1_var_1_15 & 16 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=6, var_1_6=0, var_1_7=0] [L104] signed long int stepLocal_6 = last_1_var_1_15 & 16; [L105] signed long int stepLocal_5 = last_1_var_1_15; VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_5=10, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=6, var_1_6=0, var_1_7=0] [L106] COND FALSE !(last_1_var_1_15 < stepLocal_5) [L117] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=6, var_1_6=0, var_1_7=0] [L119] unsigned char stepLocal_4 = var_1_24; [L120] unsigned long int stepLocal_3 = var_1_4; VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_3=6, stepLocal_4=1, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=6, var_1_6=0, var_1_7=0] [L121] COND TRUE (var_1_24 && var_1_24) && stepLocal_4 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_3=6, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=6, var_1_6=0, var_1_7=0] [L122] COND FALSE !(stepLocal_3 == (- var_1_13)) [L125] var_1_7 = 0 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=6, var_1_6=0, var_1_7=0] [L130] unsigned char stepLocal_2 = var_1_13 < var_1_4; [L131] signed long int stepLocal_1 = var_1_6 + var_1_15; [L132] unsigned long int stepLocal_0 = var_1_13 % var_1_4; VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_0=0, stepLocal_1=8, stepLocal_2=1, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=6, var_1_6=0, var_1_7=0] [L133] COND FALSE !(stepLocal_0 >= var_1_15) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_1=8, stepLocal_2=1, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=6, var_1_6=0, var_1_7=0] [L138] COND TRUE stepLocal_1 > var_1_13 [L139] var_1_1 = var_1_6 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_2=1, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=0, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=6, var_1_6=0, var_1_7=0] [L144] COND FALSE !(var_1_14 < var_1_13) [L147] var_1_23 = var_1_18 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_2=1, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=0, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=6, var_1_6=0, var_1_7=0] [L149] COND FALSE !((var_1_4 <= var_1_18) && var_1_7) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_2=1, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=0, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=6, var_1_6=0, var_1_7=0] [L216] RET step() [L217] CALL, EXPR property() [L206] EXPR ((((var_1_13 % var_1_4) >= var_1_15) ? ((var_1_24 && (var_1_13 < var_1_4)) ? (var_1_1 == ((unsigned char) var_1_6)) : 1) : (((var_1_6 + var_1_15) > var_1_13) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) 1)))) && (((var_1_24 && var_1_24) && var_1_24) ? ((var_1_4 == (- var_1_13)) ? (var_1_7 == ((unsigned char) (! (! (! var_1_10))))) : (var_1_7 == ((unsigned char) 0))) : (var_1_7 == ((unsigned char) (var_1_11 && var_1_12))))) && ((last_1_var_1_15 < last_1_var_1_15) ? ((var_1_12 || (last_1_var_1_15 < (var_1_6 >> last_1_var_1_33))) ? (((last_1_var_1_15 & 16) <= var_1_4) ? (var_1_13 == ((unsigned char) var_1_6)) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6))) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=0, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=6, var_1_6=0, var_1_7=0] [L206] EXPR (last_1_var_1_15 < last_1_var_1_15) ? ((var_1_12 || (last_1_var_1_15 < (var_1_6 >> last_1_var_1_33))) ? (((last_1_var_1_15 & 16) <= var_1_4) ? (var_1_13 == ((unsigned char) var_1_6)) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6)) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=0, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=6, var_1_6=0, var_1_7=0] [L206] EXPR ((((var_1_13 % var_1_4) >= var_1_15) ? ((var_1_24 && (var_1_13 < var_1_4)) ? (var_1_1 == ((unsigned char) var_1_6)) : 1) : (((var_1_6 + var_1_15) > var_1_13) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) 1)))) && (((var_1_24 && var_1_24) && var_1_24) ? ((var_1_4 == (- var_1_13)) ? (var_1_7 == ((unsigned char) (! (! (! var_1_10))))) : (var_1_7 == ((unsigned char) 0))) : (var_1_7 == ((unsigned char) (var_1_11 && var_1_12))))) && ((last_1_var_1_15 < last_1_var_1_15) ? ((var_1_12 || (last_1_var_1_15 < (var_1_6 >> last_1_var_1_33))) ? (((last_1_var_1_15 & 16) <= var_1_4) ? (var_1_13 == ((unsigned char) var_1_6)) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6))) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=0, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=6, var_1_6=0, var_1_7=0] [L206-L207] return ((((((((((((((var_1_13 % var_1_4) >= var_1_15) ? ((var_1_24 && (var_1_13 < var_1_4)) ? (var_1_1 == ((unsigned char) var_1_6)) : 1) : (((var_1_6 + var_1_15) > var_1_13) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) 1)))) && (((var_1_24 && var_1_24) && var_1_24) ? ((var_1_4 == (- var_1_13)) ? (var_1_7 == ((unsigned char) (! (! (! var_1_10))))) : (var_1_7 == ((unsigned char) 0))) : (var_1_7 == ((unsigned char) (var_1_11 && var_1_12))))) && ((last_1_var_1_15 < last_1_var_1_15) ? ((var_1_12 || (last_1_var_1_15 < (var_1_6 >> last_1_var_1_33))) ? (((last_1_var_1_15 & 16) <= var_1_4) ? (var_1_13 == ((unsigned char) var_1_6)) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6)))) && (var_1_14 == ((unsigned long int) (var_1_6 + var_1_15)))) && ((! (! (last_1_var_1_7 && last_1_var_1_24))) ? (last_1_var_1_7 ? (var_1_15 == ((unsigned short int) ((((last_1_var_1_33) > (last_1_var_1_23)) ? (last_1_var_1_33) : (last_1_var_1_23))))) : (var_1_15 == ((unsigned short int) (((((var_1_16 - var_1_6)) < (10)) ? ((var_1_16 - var_1_6)) : (10)))))) : (var_1_15 == ((unsigned short int) last_1_var_1_23)))) && (((var_1_4 <= var_1_18) && var_1_7) ? ((var_1_23 == var_1_1) ? (var_1_17 == ((unsigned long int) var_1_6)) : 1) : 1)) && ((last_1_var_1_33 <= ((last_1_var_1_17 / var_1_4) / var_1_16)) ? (last_1_var_1_24 ? (var_1_18 == ((signed char) (var_1_21 - var_1_22))) : (var_1_11 ? (var_1_18 == ((signed char) var_1_22)) : 1)) : (var_1_18 == ((signed char) var_1_21)))) && ((var_1_14 < var_1_13) ? (var_1_23 == ((signed long int) (((((var_1_14 + var_1_16)) < ((((((var_1_18 - var_1_14)) < (-128)) ? ((var_1_18 - var_1_14)) : (-128))))) ? ((var_1_14 + var_1_16)) : ((((((var_1_18 - var_1_14)) < (-128)) ? ((var_1_18 - var_1_14)) : (-128)))))))) : (var_1_23 == ((signed long int) var_1_18)))) && ((! last_1_var_1_24) ? ((last_1_var_1_7 && (last_1_var_1_33 >= ((((last_1_var_1_17) < (var_1_4)) ? (last_1_var_1_17) : (var_1_4))))) ? (var_1_24 == ((unsigned char) (var_1_10 || ((var_1_25 || var_1_26) || var_1_27)))) : (var_1_24 == ((unsigned char) var_1_12))) : (var_1_24 == ((unsigned char) var_1_12)))) && ((var_1_15 < var_1_4) ? (var_1_24 ? (var_1_28 == ((double) ((var_1_29 - var_1_30) + var_1_31))) : (var_1_28 == ((double) (4.75 + var_1_29)))) : (var_1_28 == ((double) (100.4 + var_1_30))))) && (var_1_32 == ((float) var_1_29))) && (var_1_33 == ((unsigned char) var_1_22))) && (var_1_34 == ((float) var_1_29)) ; [L217] RET, EXPR property() [L217] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=0, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=6, var_1_6=0, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=0, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=6, var_1_6=0, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.7s, OverallIterations: 23, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6571 SdHoareTripleChecker+Valid, 11.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6541 mSDsluCounter, 18025 SdHoareTripleChecker+Invalid, 10.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14488 mSDsCounter, 2050 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7804 IncrementalHoareTripleChecker+Invalid, 9854 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2050 mSolverCounterUnsat, 3537 mSDtfsCounter, 7804 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 965 GetRequests, 638 SyntacticMatches, 2 SemanticMatches, 325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1754 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3507occurred in iteration=21, InterpolantAutomatonStates: 266, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 3556 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 25.0s InterpolantComputationTime, 4568 NumberOfCodeBlocks, 4568 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 4364 ConstructedInterpolants, 0 QuantifiedInterpolants, 18185 SizeOfPredicates, 1 NumberOfNonLiveVariables, 861 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 25 InterpolantComputations, 21 PerfectInterpolantSequences, 32264/32500 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-01-09 12:52:41,569 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-01-09 12:52:41,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-31.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 0facbc53e01d120e629a50b5211a29fd2bc23d2bc5e324a9623e8d1b2c65da11 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:52:43,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:52:43,419 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 12:52:43,426 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:52:43,426 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:52:43,454 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:52:43,455 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:52:43,455 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:52:43,455 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:52:43,455 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:52:43,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:52:43,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:52:43,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:52:43,455 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:52:43,455 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:52:43,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:52:43,456 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:52:43,456 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:52:43,456 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:52:43,456 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:52:43,456 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:52:43,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:52:43,456 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:52:43,456 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:52:43,456 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:52:43,456 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:52:43,456 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:52:43,456 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:52:43,456 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:52:43,456 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:52:43,456 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:52:43,456 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:52:43,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:52:43,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:52:43,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:52:43,457 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:52:43,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:52:43,457 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:52:43,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:52:43,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:52:43,457 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:52:43,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:52:43,457 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:52:43,457 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:52:43,457 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:52:43,457 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:52:43,457 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:52:43,458 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:52:43,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:52:43,458 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:52:43,459 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-jdk21/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 -> 0facbc53e01d120e629a50b5211a29fd2bc23d2bc5e324a9623e8d1b2c65da11 [2025-01-09 12:52:43,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:52:43,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:52:43,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:52:43,702 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:52:43,702 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:52:43,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-31.i [2025-01-09 12:52:44,917 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c57d02307/18b999d5f22141648ac00bb0b8b4641b/FLAGc1440bce0 [2025-01-09 12:52:45,130 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:52:45,132 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-31.i [2025-01-09 12:52:45,141 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c57d02307/18b999d5f22141648ac00bb0b8b4641b/FLAGc1440bce0 [2025-01-09 12:52:45,158 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c57d02307/18b999d5f22141648ac00bb0b8b4641b [2025-01-09 12:52:45,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:52:45,163 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:52:45,164 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:52:45,165 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:52:45,167 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:52:45,169 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:52:45" (1/1) ... [2025-01-09 12:52:45,169 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34121465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:52:45, skipping insertion in model container [2025-01-09 12:52:45,169 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:52:45" (1/1) ... [2025-01-09 12:52:45,187 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:52:45,297 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-31.i[916,929] [2025-01-09 12:52:45,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:52:45,392 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:52:45,402 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-31.i[916,929] [2025-01-09 12:52:45,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:52:45,469 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:52:45,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:52:45 WrapperNode [2025-01-09 12:52:45,472 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:52:45,473 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:52:45,474 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:52:45,474 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:52:45,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:52:45" (1/1) ... [2025-01-09 12:52:45,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:52:45" (1/1) ... [2025-01-09 12:52:45,531 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203 [2025-01-09 12:52:45,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:52:45,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:52:45,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:52:45,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:52:45,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:52:45" (1/1) ... [2025-01-09 12:52:45,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:52:45" (1/1) ... [2025-01-09 12:52:45,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:52:45" (1/1) ... [2025-01-09 12:52:45,552 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-01-09 12:52:45,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:52:45" (1/1) ... [2025-01-09 12:52:45,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:52:45" (1/1) ... [2025-01-09 12:52:45,567 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:52:45" (1/1) ... [2025-01-09 12:52:45,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:52:45" (1/1) ... [2025-01-09 12:52:45,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:52:45" (1/1) ... [2025-01-09 12:52:45,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:52:45" (1/1) ... [2025-01-09 12:52:45,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:52:45" (1/1) ... [2025-01-09 12:52:45,589 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:52:45,591 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:52:45,591 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:52:45,591 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:52:45,592 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:52:45" (1/1) ... [2025-01-09 12:52:45,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:52:45,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:52:45,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:52:45,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:52:45,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:52:45,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:52:45,640 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:52:45,640 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:52:45,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:52:45,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:52:45,706 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:52:45,707 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:52:51,675 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-01-09 12:52:51,676 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:52:51,687 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:52:51,688 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 12:52:51,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:52:51 BoogieIcfgContainer [2025-01-09 12:52:51,689 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:52:51,690 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:52:51,690 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:52:51,694 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:52:51,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:52:45" (1/3) ... [2025-01-09 12:52:51,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d520acd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:52:51, skipping insertion in model container [2025-01-09 12:52:51,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:52:45" (2/3) ... [2025-01-09 12:52:51,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d520acd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:52:51, skipping insertion in model container [2025-01-09 12:52:51,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:52:51" (3/3) ... [2025-01-09 12:52:51,697 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-31.i [2025-01-09 12:52:51,708 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:52:51,709 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-31.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:52:51,758 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:52:51,765 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;@71e6ed03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:52:51,765 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:52:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 55 states have internal predecessors, (78), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 12:52:51,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 12:52:51,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:52:51,781 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:52:51,781 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:52:51,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:52:51,785 INFO L85 PathProgramCache]: Analyzing trace with hash -445133265, now seen corresponding path program 1 times [2025-01-09 12:52:51,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:52:51,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320411809] [2025-01-09 12:52:51,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:52:51,807 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-01-09 12:52:51,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:52:51,813 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-01-09 12:52:51,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 12:52:51,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 12:52:52,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 12:52:52,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:52:52,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:52:52,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:52:52,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:52:52,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2025-01-09 12:52:52,373 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:52:52,374 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:52:52,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320411809] [2025-01-09 12:52:52,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [320411809] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:52:52,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:52:52,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:52:52,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405043788] [2025-01-09 12:52:52,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:52:52,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:52:52,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:52:52,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:52:52,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:52:52,397 INFO L87 Difference]: Start difference. First operand has 83 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 55 states have internal predecessors, (78), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 12:52:52,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:52:52,421 INFO L93 Difference]: Finished difference Result 163 states and 283 transitions. [2025-01-09 12:52:52,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:52:52,423 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2025-01-09 12:52:52,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:52:52,428 INFO L225 Difference]: With dead ends: 163 [2025-01-09 12:52:52,428 INFO L226 Difference]: Without dead ends: 80 [2025-01-09 12:52:52,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 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-01-09 12:52:52,433 INFO L435 NwaCegarLoop]: 128 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, 128 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-01-09 12:52:52,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:52:52,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-09 12:52:52,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-01-09 12:52:52,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 12:52:52,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2025-01-09 12:52:52,473 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 168 [2025-01-09 12:52:52,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:52:52,473 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2025-01-09 12:52:52,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 12:52:52,475 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2025-01-09 12:52:52,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 12:52:52,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:52:52,479 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:52:52,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 12:52:52,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-01-09 12:52:52,680 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:52:52,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:52:52,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1171096969, now seen corresponding path program 1 times [2025-01-09 12:52:52,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:52:52,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975266267] [2025-01-09 12:52:52,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:52:52,683 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-01-09 12:52:52,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:52:52,685 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-01-09 12:52:52,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 12:52:52,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 12:52:53,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 12:52:53,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:52:53,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:52:53,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 12:52:53,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:52:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:52:54,745 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:52:54,745 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:52:54,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975266267] [2025-01-09 12:52:54,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1975266267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:52:54,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:52:54,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:52:54,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361330202] [2025-01-09 12:52:54,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:52:54,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:52:54,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:52:54,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:52:54,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:52:54,747 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:52:56,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:53:00,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:53:03,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:53:07,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:53:11,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:53:11,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:53:11,463 INFO L93 Difference]: Finished difference Result 276 states and 432 transitions. [2025-01-09 12:53:11,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:53:11,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2025-01-09 12:53:11,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:53:11,509 INFO L225 Difference]: With dead ends: 276 [2025-01-09 12:53:11,509 INFO L226 Difference]: Without dead ends: 199 [2025-01-09 12:53:11,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:53:11,510 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 131 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 64 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:53:11,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 387 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 29 Invalid, 3 Unknown, 0 Unchecked, 16.7s Time] [2025-01-09 12:53:11,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-01-09 12:53:11,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 148. [2025-01-09 12:53:11,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 12:53:11,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 228 transitions. [2025-01-09 12:53:11,528 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 228 transitions. Word has length 168 [2025-01-09 12:53:11,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:53:11,528 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 228 transitions. [2025-01-09 12:53:11,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:53:11,529 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 228 transitions. [2025-01-09 12:53:11,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 12:53:11,530 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:53:11,531 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:53:11,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-01-09 12:53:11,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-01-09 12:53:11,735 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:53:11,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:53:11,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1261636168, now seen corresponding path program 1 times [2025-01-09 12:53:11,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:53:11,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642444788] [2025-01-09 12:53:11,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:53:11,736 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-01-09 12:53:11,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:53:11,740 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-01-09 12:53:11,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 12:53:11,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 12:53:12,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 12:53:12,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:53:12,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:53:12,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 12:53:12,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:53:13,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:53:13,761 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:53:13,761 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:53:13,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642444788] [2025-01-09 12:53:13,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642444788] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:53:13,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:53:13,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:53:13,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798038389] [2025-01-09 12:53:13,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:53:13,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:53:13,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:53:13,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:53:13,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:53:13,763 INFO L87 Difference]: Start difference. First operand 148 states and 228 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)