./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-7.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_variablewrapping_wrapper-sp_file-7.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 c08a3d5297bbbcb5881c67d5d83d8ac90b7c708d5d59dacfddb9a4d6bdd83c53 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:14:03,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:14:03,543 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:14:03,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:14:03,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:14:03,564 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:14:03,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:14:03,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:14:03,565 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:14:03,566 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:14:03,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:14:03,566 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:14:03,566 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:14:03,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:14:03,567 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:14:03,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:14:03,567 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:14:03,567 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:14:03,567 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:14:03,567 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:14:03,567 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:14:03,567 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:14:03,567 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:14:03,567 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:14:03,567 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:14:03,567 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:14:03,567 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:14:03,567 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:14:03,567 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:14:03,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:14:03,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:14:03,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:14:03,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:14:03,567 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:14:03,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:14:03,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:14:03,568 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:14:03,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:14:03,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:14:03,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:14:03,568 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:14:03,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:14:03,568 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:14:03,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:14:03,568 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:14:03,568 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:14:03,568 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:14:03,568 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:14:03,568 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 -> c08a3d5297bbbcb5881c67d5d83d8ac90b7c708d5d59dacfddb9a4d6bdd83c53 [2025-01-09 16:14:03,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:14:03,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:14:03,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:14:03,788 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:14:03,788 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:14:03,789 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-7.i [2025-01-09 16:14:04,963 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92014678e/b933eeeb5d834b5787fc9b1d0ef6798e/FLAG1746380a7 [2025-01-09 16:14:05,219 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:14:05,220 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-7.i [2025-01-09 16:14:05,228 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92014678e/b933eeeb5d834b5787fc9b1d0ef6798e/FLAG1746380a7 [2025-01-09 16:14:05,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92014678e/b933eeeb5d834b5787fc9b1d0ef6798e [2025-01-09 16:14:05,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:14:05,245 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:14:05,245 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:14:05,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:14:05,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:14:05,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:14:05" (1/1) ... [2025-01-09 16:14:05,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@535914c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:05, skipping insertion in model container [2025-01-09 16:14:05,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:14:05" (1/1) ... [2025-01-09 16:14:05,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:14:05,366 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_variablewrapping_wrapper-sp_file-7.i[916,929] [2025-01-09 16:14:05,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:14:05,431 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:14:05,438 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_variablewrapping_wrapper-sp_file-7.i[916,929] [2025-01-09 16:14:05,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:14:05,473 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:14:05,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:05 WrapperNode [2025-01-09 16:14:05,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:14:05,474 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:14:05,474 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:14:05,474 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:14:05,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:05" (1/1) ... [2025-01-09 16:14:05,485 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:05" (1/1) ... [2025-01-09 16:14:05,517 INFO L138 Inliner]: procedures = 30, calls = 146, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 483 [2025-01-09 16:14:05,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:14:05,520 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:14:05,520 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:14:05,520 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:14:05,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:05" (1/1) ... [2025-01-09 16:14:05,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:05" (1/1) ... [2025-01-09 16:14:05,530 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:05" (1/1) ... [2025-01-09 16:14:05,534 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 16:14:05,534 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:05" (1/1) ... [2025-01-09 16:14:05,534 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:05" (1/1) ... [2025-01-09 16:14:05,542 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:05" (1/1) ... [2025-01-09 16:14:05,543 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:05" (1/1) ... [2025-01-09 16:14:05,546 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:05" (1/1) ... [2025-01-09 16:14:05,547 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:05" (1/1) ... [2025-01-09 16:14:05,548 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:05" (1/1) ... [2025-01-09 16:14:05,551 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:14:05,551 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:14:05,551 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:14:05,552 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:14:05,552 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:05" (1/1) ... [2025-01-09 16:14:05,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:14:05,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:14:05,586 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 16:14:05,591 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 16:14:05,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:14:05,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 16:14:05,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 16:14:05,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 16:14:05,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 16:14:05,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 16:14:05,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 16:14:05,604 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:14:05,604 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:14:05,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 16:14:05,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:14:05,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:14:05,689 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:14:05,690 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:14:06,035 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2025-01-09 16:14:06,036 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:14:06,045 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:14:06,046 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:14:06,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:14:06 BoogieIcfgContainer [2025-01-09 16:14:06,047 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:14:06,049 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:14:06,049 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:14:06,052 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:14:06,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:14:05" (1/3) ... [2025-01-09 16:14:06,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c74408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:14:06, skipping insertion in model container [2025-01-09 16:14:06,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:05" (2/3) ... [2025-01-09 16:14:06,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c74408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:14:06, skipping insertion in model container [2025-01-09 16:14:06,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:14:06" (3/3) ... [2025-01-09 16:14:06,055 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-7.i [2025-01-09 16:14:06,064 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:14:06,065 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-7.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:14:06,103 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:14:06,112 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;@41edb05d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:14:06,113 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:14:06,116 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:14:06,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 16:14:06,124 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:06,125 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:06,127 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:06,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:06,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1967320107, now seen corresponding path program 1 times [2025-01-09 16:14:06,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:06,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070070914] [2025-01-09 16:14:06,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:06,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:06,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 16:14:06,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 16:14:06,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:06,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:06,398 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 16:14:06,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:06,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070070914] [2025-01-09 16:14:06,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070070914] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:14:06,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670656661] [2025-01-09 16:14:06,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:06,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:14:06,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:14:06,402 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 16:14:06,421 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 16:14:06,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 16:14:06,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 16:14:06,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:06,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:06,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:14:06,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:14:06,587 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 16:14:06,588 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:14:06,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670656661] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:06,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:14:06,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 16:14:06,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134420241] [2025-01-09 16:14:06,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:06,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:14:06,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:06,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:14:06,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:14:06,610 INFO L87 Difference]: Start difference. First operand has 99 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:14:06,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:06,625 INFO L93 Difference]: Finished difference Result 192 states and 301 transitions. [2025-01-09 16:14:06,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:14:06,626 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2025-01-09 16:14:06,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:06,630 INFO L225 Difference]: With dead ends: 192 [2025-01-09 16:14:06,630 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 16:14:06,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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 16:14:06,633 INFO L435 NwaCegarLoop]: 138 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, 138 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 16:14:06,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:14:06,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 16:14:06,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-01-09 16:14:06,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:14:06,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2025-01-09 16:14:06,657 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 103 [2025-01-09 16:14:06,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:06,657 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2025-01-09 16:14:06,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:14:06,658 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2025-01-09 16:14:06,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 16:14:06,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:06,660 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:06,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:14:06,861 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 16:14:06,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:06,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:06,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1590201317, now seen corresponding path program 1 times [2025-01-09 16:14:06,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:06,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594440721] [2025-01-09 16:14:06,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:06,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:06,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 16:14:06,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 16:14:06,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:06,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:06,991 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:14:06,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:06,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594440721] [2025-01-09 16:14:06,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594440721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:06,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:06,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:14:06,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088623249] [2025-01-09 16:14:06,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:06,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:14:06,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:06,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:14:06,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:14:06,994 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:07,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:07,024 INFO L93 Difference]: Finished difference Result 190 states and 275 transitions. [2025-01-09 16:14:07,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:14:07,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-01-09 16:14:07,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:07,025 INFO L225 Difference]: With dead ends: 190 [2025-01-09 16:14:07,025 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 16:14:07,026 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 16:14:07,026 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:07,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 268 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:14:07,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 16:14:07,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-01-09 16:14:07,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 83 states have internal predecessors, (115), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:14:07,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2025-01-09 16:14:07,040 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 103 [2025-01-09 16:14:07,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:07,040 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2025-01-09 16:14:07,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:07,041 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2025-01-09 16:14:07,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 16:14:07,043 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:07,043 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:07,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:14:07,043 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:07,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:07,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648729, now seen corresponding path program 1 times [2025-01-09 16:14:07,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:07,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901872951] [2025-01-09 16:14:07,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:07,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:07,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 16:14:07,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 16:14:07,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:07,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:09,373 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:14:09,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:09,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901872951] [2025-01-09 16:14:09,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901872951] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:09,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:09,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:14:09,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558854075] [2025-01-09 16:14:09,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:09,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:14:09,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:09,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:14:09,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:14:09,375 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 16:14:09,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:09,871 INFO L93 Difference]: Finished difference Result 195 states and 280 transitions. [2025-01-09 16:14:09,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:14:09,872 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2025-01-09 16:14:09,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:09,873 INFO L225 Difference]: With dead ends: 195 [2025-01-09 16:14:09,873 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 16:14:09,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:14:09,874 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 470 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:09,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 304 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:14:09,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 16:14:09,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2025-01-09 16:14:09,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.3764705882352941) internal successors, (117), 85 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:14:09,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2025-01-09 16:14:09,892 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 103 [2025-01-09 16:14:09,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:09,892 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2025-01-09 16:14:09,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 16:14:09,892 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2025-01-09 16:14:09,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 16:14:09,893 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:09,894 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:09,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:14:09,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:09,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:09,894 INFO L85 PathProgramCache]: Analyzing trace with hash 400253234, now seen corresponding path program 1 times [2025-01-09 16:14:09,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:09,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727487237] [2025-01-09 16:14:09,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:09,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:09,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 16:14:09,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 16:14:09,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:09,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:14:11,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:11,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727487237] [2025-01-09 16:14:11,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727487237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:11,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:11,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:14:11,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053009511] [2025-01-09 16:14:11,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:11,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:14:11,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:11,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:14:11,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:14:11,399 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 16:14:11,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:11,968 INFO L93 Difference]: Finished difference Result 197 states and 281 transitions. [2025-01-09 16:14:11,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:14:11,968 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2025-01-09 16:14:11,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:11,969 INFO L225 Difference]: With dead ends: 197 [2025-01-09 16:14:11,969 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 16:14:11,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:14:11,970 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 219 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:11,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 395 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:14:11,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 16:14:11,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2025-01-09 16:14:11,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 83 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:14:11,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 138 transitions. [2025-01-09 16:14:11,977 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 138 transitions. Word has length 105 [2025-01-09 16:14:11,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:11,978 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 138 transitions. [2025-01-09 16:14:11,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 16:14:11,978 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2025-01-09 16:14:11,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 16:14:11,979 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:11,979 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:11,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:14:11,979 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:11,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:11,980 INFO L85 PathProgramCache]: Analyzing trace with hash 202295434, now seen corresponding path program 1 times [2025-01-09 16:14:11,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:11,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289943326] [2025-01-09 16:14:11,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:11,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:11,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 16:14:12,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 16:14:12,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:12,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:12,035 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:14:12,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:12,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289943326] [2025-01-09 16:14:12,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289943326] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:12,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:12,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:14:12,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288596693] [2025-01-09 16:14:12,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:12,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:14:12,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:12,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:14:12,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:14:12,037 INFO L87 Difference]: Start difference. First operand 97 states and 138 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:12,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:12,053 INFO L93 Difference]: Finished difference Result 192 states and 275 transitions. [2025-01-09 16:14:12,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:14:12,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2025-01-09 16:14:12,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:12,054 INFO L225 Difference]: With dead ends: 192 [2025-01-09 16:14:12,054 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 16:14:12,055 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 16:14:12,055 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:12,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:14:12,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 16:14:12,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-01-09 16:14:12,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.369047619047619) internal successors, (115), 84 states have internal predecessors, (115), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:14:12,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 139 transitions. [2025-01-09 16:14:12,069 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 139 transitions. Word has length 106 [2025-01-09 16:14:12,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:12,069 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 139 transitions. [2025-01-09 16:14:12,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:12,069 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 139 transitions. [2025-01-09 16:14:12,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 16:14:12,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:12,070 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:12,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:14:12,070 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:12,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:12,071 INFO L85 PathProgramCache]: Analyzing trace with hash 882353804, now seen corresponding path program 1 times [2025-01-09 16:14:12,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:12,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822092391] [2025-01-09 16:14:12,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:12,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:12,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 16:14:12,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 16:14:12,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:12,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:14:12,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1560253085] [2025-01-09 16:14:12,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:12,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:14:12,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:14:12,182 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 16:14:12,184 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 16:14:12,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 16:14:12,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 16:14:12,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:12,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:14:12,648 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:14:12,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 16:14:12,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 16:14:12,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:12,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:14:13,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:14:13,006 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:14:13,007 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 16:14:13,020 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 16:14:13,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:14:13,211 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 16:14:13,303 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:14:13,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:14:13 BoogieIcfgContainer [2025-01-09 16:14:13,305 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:14:13,306 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:14:13,306 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:14:13,306 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:14:13,310 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:14:06" (3/4) ... [2025-01-09 16:14:13,311 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 16:14:13,312 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:14:13,313 INFO L158 Benchmark]: Toolchain (without parser) took 8067.91ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 113.1MB in the beginning and 191.4MB in the end (delta: -78.3MB). Peak memory consumption was 105.4MB. Max. memory is 16.1GB. [2025-01-09 16:14:13,313 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:14:13,313 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.38ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 98.2MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:14:13,313 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.36ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 94.6MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:14:13,313 INFO L158 Benchmark]: Boogie Preprocessor took 30.87ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 91.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:14:13,313 INFO L158 Benchmark]: RCFGBuilder took 496.07ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 59.3MB in the end (delta: 32.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 16:14:13,313 INFO L158 Benchmark]: TraceAbstraction took 7256.15ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 58.8MB in the beginning and 195.1MB in the end (delta: -136.3MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2025-01-09 16:14:13,315 INFO L158 Benchmark]: Witness Printer took 6.25ms. Allocated memory is still 327.2MB. Free memory was 195.1MB in the beginning and 191.4MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:14:13,316 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.15ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.38ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 98.2MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.36ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 94.6MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.87ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 91.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 496.07ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 59.3MB in the end (delta: 32.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7256.15ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 58.8MB in the beginning and 195.1MB in the end (delta: -136.3MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. * Witness Printer took 6.25ms. Allocated memory is still 327.2MB. Free memory was 195.1MB in the beginning and 191.4MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 111. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 1, 8.2, 100000000000.4, 4, 0.2, 0, 32, 1, 127.5, 5 }; [L47] unsigned char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L48] float* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L49] float* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L50] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L51] double* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L52] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L53] unsigned short int* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L54] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L55] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L56] unsigned long int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L57] double last_1_WrapperStruct00_var_1_7 = 0.2; [L58] unsigned long int last_1_WrapperStruct00_var_1_12 = 5; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=0, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L122] isInitial = 1 [L123] FCALL initially() [L125] CALL updateLastVariables() [L114] EXPR WrapperStruct00.var_1_7 [L114] last_1_WrapperStruct00_var_1_7 = WrapperStruct00.var_1_7 [L115] EXPR WrapperStruct00.var_1_12 [L115] last_1_WrapperStruct00_var_1_12 = WrapperStruct00.var_1_12 [L125] RET updateLastVariables() [L126] CALL updateVariables() [L93] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L94] EXPR WrapperStruct00.var_1_3 [L94] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F [L94] EXPR WrapperStruct00.var_1_3 [L94] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L94] EXPR (WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L94] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L94] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L95] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L96] EXPR WrapperStruct00.var_1_4 [L96] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_4 [L96] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L96] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L97] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L98] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L99] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L100] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L101] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L102] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L103] WrapperStruct00.var_1_9 = __VERIFIER_nondet_ushort() [L104] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L105] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 65535) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 65535) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L106] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_9 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_9 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L107] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L109] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L110] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L111] EXPR WrapperStruct00.var_1_11 [L111] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_11 [L111] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L111] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L126] RET updateVariables() [L127] CALL step() [L62] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L62] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L62] COND FALSE !(! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) [L69] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L69] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_6_Pointer)) [L71] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L71] (*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer))) [L71] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L71] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L71] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L71] (*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L71] COND FALSE !((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) [L78] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L78] (*(WrapperStruct00_var_1_7_Pointer)) = (*(WrapperStruct00_var_1_11_Pointer)) [L80] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L80] COND FALSE !((*(WrapperStruct00_var_1_8_Pointer))) [L89] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L89] (*(WrapperStruct00_var_1_12_Pointer)) = (*(WrapperStruct00_var_1_6_Pointer)) [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L118] EXPR (! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) ? ((-1 < last_1_WrapperStruct00_var_1_12) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) [L118] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L118] EXPR (! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) ? ((-1 < last_1_WrapperStruct00_var_1_12) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L118] EXPR ((! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) ? ((-1 < last_1_WrapperStruct00_var_1_12) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) && (((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) [L118] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L118] EXPR (*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer))) [L118] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L118] EXPR (*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L118] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) [L118] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L118] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L118] EXPR ((! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) ? ((-1 < last_1_WrapperStruct00_var_1_12) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) && (((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L118] EXPR (((! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) ? ((-1 < last_1_WrapperStruct00_var_1_12) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) && (((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))))) && ((*(WrapperStruct00_var_1_8_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer)))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))) > (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) ((((((3725801564u - (*(WrapperStruct00_var_1_6_Pointer))) - (*(WrapperStruct00_var_1_1_Pointer)))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (((3725801564u - (*(WrapperStruct00_var_1_6_Pointer))) - (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_6_Pointer))))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_6_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L118-L119] return (((! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) ? ((-1 < last_1_WrapperStruct00_var_1_12) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) && (((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))))) && ((*(WrapperStruct00_var_1_8_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer)))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))) > (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) ((((((3725801564u - (*(WrapperStruct00_var_1_6_Pointer))) - (*(WrapperStruct00_var_1_1_Pointer)))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (((3725801564u - (*(WrapperStruct00_var_1_6_Pointer))) - (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_6_Pointer))))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_6_Pointer))))) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 691 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 689 mSDsluCounter, 1370 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 803 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 775 IncrementalHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 567 mSDtfsCounter, 775 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=0, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 835 NumberOfCodeBlocks, 835 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 617 ConstructedInterpolants, 0 QuantifiedInterpolants, 4381 SizeOfPredicates, 0 NumberOfNonLiveVariables, 414 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 1562/1584 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 16:14:13,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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_variablewrapping_wrapper-sp_file-7.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 c08a3d5297bbbcb5881c67d5d83d8ac90b7c708d5d59dacfddb9a4d6bdd83c53 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:14:15,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:14:15,363 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 16:14:15,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:14:15,374 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:14:15,395 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:14:15,395 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:14:15,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:14:15,396 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:14:15,396 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:14:15,397 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:14:15,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:14:15,397 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:14:15,398 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:14:15,398 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:14:15,398 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:14:15,398 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:14:15,398 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:14:15,398 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:14:15,398 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:14:15,398 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:14:15,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:14:15,398 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:14:15,398 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 16:14:15,398 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 16:14:15,398 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 16:14:15,398 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:14:15,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:14:15,398 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:14:15,398 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:14:15,398 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:14:15,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:14:15,398 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:14:15,398 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:14:15,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:14:15,399 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:14:15,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:14:15,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:14:15,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:14:15,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:14:15,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:14:15,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:14:15,399 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:14:15,399 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:14:15,399 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 16:14:15,399 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 16:14:15,399 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:14:15,399 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:14:15,399 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:14:15,399 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:14:15,399 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 -> c08a3d5297bbbcb5881c67d5d83d8ac90b7c708d5d59dacfddb9a4d6bdd83c53 [2025-01-09 16:14:15,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:14:15,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:14:15,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:14:15,673 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:14:15,673 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:14:15,674 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-7.i [2025-01-09 16:14:16,952 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d48fd5f0a/07669b3834ed449e9440388a51f98215/FLAG6b2dfd60a [2025-01-09 16:14:17,179 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:14:17,180 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-7.i [2025-01-09 16:14:17,186 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d48fd5f0a/07669b3834ed449e9440388a51f98215/FLAG6b2dfd60a [2025-01-09 16:14:17,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d48fd5f0a/07669b3834ed449e9440388a51f98215 [2025-01-09 16:14:17,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:14:17,538 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:14:17,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:14:17,539 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:14:17,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:14:17,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:14:17" (1/1) ... [2025-01-09 16:14:17,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b6b412f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:17, skipping insertion in model container [2025-01-09 16:14:17,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:14:17" (1/1) ... [2025-01-09 16:14:17,553 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:14:17,672 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_variablewrapping_wrapper-sp_file-7.i[916,929] [2025-01-09 16:14:17,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:14:17,718 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:14:17,725 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_variablewrapping_wrapper-sp_file-7.i[916,929] [2025-01-09 16:14:17,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:14:17,762 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:14:17,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:17 WrapperNode [2025-01-09 16:14:17,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:14:17,763 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:14:17,763 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:14:17,763 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:14:17,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:17" (1/1) ... [2025-01-09 16:14:17,776 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:17" (1/1) ... [2025-01-09 16:14:17,806 INFO L138 Inliner]: procedures = 40, calls = 146, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 482 [2025-01-09 16:14:17,807 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:14:17,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:14:17,807 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:14:17,807 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:14:17,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:17" (1/1) ... [2025-01-09 16:14:17,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:17" (1/1) ... [2025-01-09 16:14:17,819 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:17" (1/1) ... [2025-01-09 16:14:17,837 INFO L175 MemorySlicer]: Split 123 memory accesses to 2 slices as follows [2, 121]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 27 writes are split as follows [0, 27]. [2025-01-09 16:14:17,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:17" (1/1) ... [2025-01-09 16:14:17,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:17" (1/1) ... [2025-01-09 16:14:17,860 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:17" (1/1) ... [2025-01-09 16:14:17,861 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:17" (1/1) ... [2025-01-09 16:14:17,868 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:17" (1/1) ... [2025-01-09 16:14:17,875 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:17" (1/1) ... [2025-01-09 16:14:17,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:17" (1/1) ... [2025-01-09 16:14:17,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:14:17,888 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:14:17,888 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:14:17,888 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:14:17,889 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:17" (1/1) ... [2025-01-09 16:14:17,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:14:17,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:14:17,917 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 16:14:17,919 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 16:14:17,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:14:17,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 16:14:17,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 16:14:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-01-09 16:14:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-01-09 16:14:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 16:14:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 16:14:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 16:14:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 16:14:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 16:14:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 16:14:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 16:14:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 16:14:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 16:14:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 16:14:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 16:14:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 16:14:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-01-09 16:14:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-01-09 16:14:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 16:14:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 16:14:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-01-09 16:14:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-01-09 16:14:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-01-09 16:14:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-01-09 16:14:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:14:17,940 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:14:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-01-09 16:14:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-01-09 16:14:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:14:17,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:14:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 16:14:17,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 16:14:17,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 16:14:17,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 16:14:17,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 16:14:17,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 16:14:18,069 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:14:18,070 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:14:20,253 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2025-01-09 16:14:20,253 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:14:20,260 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:14:20,260 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:14:20,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:14:20 BoogieIcfgContainer [2025-01-09 16:14:20,261 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:14:20,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:14:20,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:14:20,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:14:20,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:14:17" (1/3) ... [2025-01-09 16:14:20,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3553d24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:14:20, skipping insertion in model container [2025-01-09 16:14:20,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:17" (2/3) ... [2025-01-09 16:14:20,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3553d24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:14:20, skipping insertion in model container [2025-01-09 16:14:20,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:14:20" (3/3) ... [2025-01-09 16:14:20,267 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-7.i [2025-01-09 16:14:20,277 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:14:20,278 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-7.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:14:20,310 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:14:20,318 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;@4ca759e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:14:20,320 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:14:20,323 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:14:20,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 16:14:20,330 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:20,331 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:20,331 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:20,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:20,339 INFO L85 PathProgramCache]: Analyzing trace with hash 69667963, now seen corresponding path program 1 times [2025-01-09 16:14:20,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:14:20,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108380725] [2025-01-09 16:14:20,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:20,355 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 16:14:20,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:14:20,358 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 16:14:20,359 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 16:14:20,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 16:14:20,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 16:14:20,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:20,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:20,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:14:20,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:14:20,737 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-01-09 16:14:20,737 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:14:20,738 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:14:20,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108380725] [2025-01-09 16:14:20,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108380725] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:20,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:20,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:14:20,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933699575] [2025-01-09 16:14:20,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:20,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:14:20,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:14:20,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:14:20,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:14:20,760 INFO L87 Difference]: Start difference. First operand has 99 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:14:20,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:20,781 INFO L93 Difference]: Finished difference Result 192 states and 301 transitions. [2025-01-09 16:14:20,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:14:20,783 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2025-01-09 16:14:20,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:20,787 INFO L225 Difference]: With dead ends: 192 [2025-01-09 16:14:20,787 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 16:14:20,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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 16:14:20,791 INFO L435 NwaCegarLoop]: 138 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, 138 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 16:14:20,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:14:20,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 16:14:20,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-01-09 16:14:20,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:14:20,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2025-01-09 16:14:20,831 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 103 [2025-01-09 16:14:20,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:20,832 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2025-01-09 16:14:20,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:14:20,832 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2025-01-09 16:14:20,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 16:14:20,833 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:20,834 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:20,843 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 16:14:21,038 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 16:14:21,038 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:21,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:21,039 INFO L85 PathProgramCache]: Analyzing trace with hash 807113835, now seen corresponding path program 1 times [2025-01-09 16:14:21,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:14:21,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [853472838] [2025-01-09 16:14:21,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:21,040 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 16:14:21,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:14:21,042 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 16:14:21,044 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 16:14:21,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 16:14:21,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 16:14:21,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:21,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:21,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 16:14:21,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:14:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:14:21,378 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:14:21,378 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:14:21,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [853472838] [2025-01-09 16:14:21,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [853472838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:21,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:21,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:14:21,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172184390] [2025-01-09 16:14:21,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:21,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:14:21,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:14:21,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:14:21,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:14:21,381 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:21,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:21,419 INFO L93 Difference]: Finished difference Result 190 states and 275 transitions. [2025-01-09 16:14:21,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:14:21,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-01-09 16:14:21,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:21,421 INFO L225 Difference]: With dead ends: 190 [2025-01-09 16:14:21,421 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 16:14:21,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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 16:14:21,422 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:21,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 268 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:14:21,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 16:14:21,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-01-09 16:14:21,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 83 states have internal predecessors, (115), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:14:21,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2025-01-09 16:14:21,428 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 103 [2025-01-09 16:14:21,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:21,433 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2025-01-09 16:14:21,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:21,433 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2025-01-09 16:14:21,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 16:14:21,434 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:21,434 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:21,452 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 16:14:21,634 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 16:14:21,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:21,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:21,635 INFO L85 PathProgramCache]: Analyzing trace with hash -204003415, now seen corresponding path program 1 times [2025-01-09 16:14:21,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:14:21,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1395515695] [2025-01-09 16:14:21,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:21,636 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 16:14:21,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:14:21,638 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 16:14:21,640 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 16:14:21,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 16:14:21,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 16:14:21,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:21,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:21,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:14:21,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:14:22,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-01-09 16:14:22,115 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:14:22,115 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:14:22,115 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:14:22,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1395515695] [2025-01-09 16:14:22,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1395515695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:22,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:22,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:14:22,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935416037] [2025-01-09 16:14:22,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:22,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:14:22,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:14:22,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:14:22,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:14:22,117 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:24,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:24,048 INFO L93 Difference]: Finished difference Result 192 states and 276 transitions. [2025-01-09 16:14:24,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:14:24,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-01-09 16:14:24,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:24,050 INFO L225 Difference]: With dead ends: 192 [2025-01-09 16:14:24,050 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 16:14:24,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:14:24,051 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 132 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:24,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 381 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 16:14:24,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 16:14:24,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-01-09 16:14:24,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 83 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:14:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 138 transitions. [2025-01-09 16:14:24,056 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 138 transitions. Word has length 103 [2025-01-09 16:14:24,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:24,057 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 138 transitions. [2025-01-09 16:14:24,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:24,057 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2025-01-09 16:14:24,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 16:14:24,058 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:24,058 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:24,068 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 (4)] Ended with exit code 0 [2025-01-09 16:14:24,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 16:14:24,259 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:24,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:24,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1660864893, now seen corresponding path program 1 times [2025-01-09 16:14:24,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:14:24,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1728097244] [2025-01-09 16:14:24,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:24,260 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 16:14:24,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:14:24,263 INFO L229 MonitoredProcess]: Starting monitored process 5 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 16:14:24,264 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 (5)] Waiting until timeout for monitored process [2025-01-09 16:14:24,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 16:14:24,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 16:14:24,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:24,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:24,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:14:24,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:14:24,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-01-09 16:14:24,652 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:14:24,652 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:14:24,652 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:14:24,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1728097244] [2025-01-09 16:14:24,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1728097244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:24,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:24,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:14:24,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23261267] [2025-01-09 16:14:24,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:24,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:14:24,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:14:24,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:14:24,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:14:24,654 INFO L87 Difference]: Start difference. First operand 97 states and 138 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:14:26,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:26,481 INFO L93 Difference]: Finished difference Result 192 states and 274 transitions. [2025-01-09 16:14:26,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:14:26,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2025-01-09 16:14:26,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:26,483 INFO L225 Difference]: With dead ends: 192 [2025-01-09 16:14:26,483 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 16:14:26,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:14:26,484 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 121 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:26,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 376 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 16:14:26,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 16:14:26,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-01-09 16:14:26,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:14:26,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 137 transitions. [2025-01-09 16:14:26,489 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 137 transitions. Word has length 105 [2025-01-09 16:14:26,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:26,489 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 137 transitions. [2025-01-09 16:14:26,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:14:26,489 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 137 transitions. [2025-01-09 16:14:26,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 16:14:26,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:26,490 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:26,501 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 (5)] Ended with exit code 0 [2025-01-09 16:14:26,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 16:14:26,691 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:26,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:26,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1394347113, now seen corresponding path program 1 times [2025-01-09 16:14:26,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:14:26,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052858168] [2025-01-09 16:14:26,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:26,692 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 16:14:26,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:14:26,694 INFO L229 MonitoredProcess]: Starting monitored process 6 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 16:14:26,695 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 (6)] Waiting until timeout for monitored process [2025-01-09 16:14:26,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 16:14:27,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 16:14:27,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:27,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:27,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 16:14:27,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:14:27,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 16:14:28,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-01-09 16:14:28,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-01-09 16:14:29,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2025-01-09 16:14:29,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2025-01-09 16:14:32,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 61 [2025-01-09 16:14:32,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 80 [2025-01-09 16:14:36,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 86 [2025-01-09 16:14:39,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:14:39,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 102 treesize of output 54 [2025-01-09 16:14:40,012 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 176 proven. 44 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 16:14:40,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:14:41,083 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:14:41,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052858168] [2025-01-09 16:14:41,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2052858168] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:14:41,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [257181586] [2025-01-09 16:14:41,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:41,084 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 16:14:41,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 16:14:41,086 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 16:14:41,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-01-09 16:14:41,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 16:14:42,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 16:14:42,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:42,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:42,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 16:14:42,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:14:43,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 16:14:43,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-01-09 16:14:44,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-01-09 16:14:44,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-01-09 16:14:45,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2025-01-09 16:14:47,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 50 [2025-01-09 16:14:47,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2025-01-09 16:14:47,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 53 [2025-01-09 16:14:47,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 42 [2025-01-09 16:14:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 152 proven. 44 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-01-09 16:14:47,937 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:14:48,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [257181586] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:14:48,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:14:48,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2025-01-09 16:14:48,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147318177] [2025-01-09 16:14:48,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 16:14:48,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 16:14:48,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:14:48,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 16:14:48,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=454, Unknown=4, NotChecked=0, Total=552 [2025-01-09 16:14:48,624 INFO L87 Difference]: Start difference. First operand 97 states and 137 transitions. Second operand has 19 states, 19 states have (on average 5.947368421052632) internal successors, (113), 18 states have internal predecessors, (113), 9 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) [2025-01-09 16:14:56,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:15:00,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:15:12,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:15:16,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:15:20,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:15:24,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:15:28,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:15:32,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:15:36,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:15:40,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]