./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-98.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 4f9af400
extending candidate: java
['java']
extending candidate: /usr/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/oracle-jdk-bin-*/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/openjdk-*/bin/java
['java', '/usr/bin/java']
extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java
['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java']
['/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_operatoramount_amount100_file-98.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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '3e656310ec67c2d05ae017a9135a80fcd37a9ab722f93d5597cf89a898d3876d']
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_operatoramount_amount100_file-98.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 3e656310ec67c2d05ae017a9135a80fcd37a9ab722f93d5597cf89a898d3876d
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 09:12:01,340 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 09:12:01,436 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-07 09:12:01,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 09:12:01,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 09:12:01,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 09:12:01,472 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 09:12:01,472 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 09:12:01,472 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 09:12:01,472 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 09:12:01,472 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 09:12:01,473 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 09:12:01,473 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 09:12:01,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 09:12:01,474 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 09:12:01,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 09:12:01,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 09:12:01,475 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 09:12:01,475 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 09:12:01,476 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 09:12:01,476 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 09:12:01,476 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 09:12:01,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 09:12:01,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 09:12:01,476 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 09:12:01,476 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 09:12:01,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 09:12:01,476 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 09:12:01,476 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 09:12:01,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 09:12:01,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 09:12:01,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 09:12:01,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 09:12:01,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 09:12:01,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 09:12:01,477 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 09:12:01,477 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 09:12:01,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 09:12:01,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 09:12:01,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 09:12:01,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 09:12:01,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 09:12:01,477 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 -> 3e656310ec67c2d05ae017a9135a80fcd37a9ab722f93d5597cf89a898d3876d
[2024-11-07 09:12:01,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 09:12:01,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 09:12:01,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 09:12:01,748 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 09:12:01,749 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 09:12:01,750 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-98.i
[2024-11-07 09:12:03,062 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 09:12:03,350 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 09:12:03,350 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-98.i
[2024-11-07 09:12:03,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d44db18de/85d21780c77d4b6c95c38da618053fed/FLAG089ba822f
[2024-11-07 09:12:03,634 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d44db18de/85d21780c77d4b6c95c38da618053fed
[2024-11-07 09:12:03,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 09:12:03,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 09:12:03,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 09:12:03,638 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 09:12:03,642 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 09:12:03,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:12:03" (1/1) ...
[2024-11-07 09:12:03,643 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34ba374a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:03, skipping insertion in model container
[2024-11-07 09:12:03,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:12:03" (1/1) ...
[2024-11-07 09:12:03,661 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 09:12:03,770 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_operatoramount_amount100_file-98.i[916,929]
[2024-11-07 09:12:03,835 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 09:12:03,847 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 09:12:03,859 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_operatoramount_amount100_file-98.i[916,929]
[2024-11-07 09:12:03,885 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 09:12:03,902 INFO L204 MainTranslator]: Completed translation
[2024-11-07 09:12:03,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:03 WrapperNode
[2024-11-07 09:12:03,904 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 09:12:03,905 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 09:12:03,905 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 09:12:03,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 09:12:03,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:03" (1/1) ...
[2024-11-07 09:12:03,921 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:03" (1/1) ...
[2024-11-07 09:12:03,950 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179
[2024-11-07 09:12:03,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 09:12:03,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 09:12:03,952 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 09:12:03,952 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 09:12:03,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:03" (1/1) ...
[2024-11-07 09:12:03,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:03" (1/1) ...
[2024-11-07 09:12:03,963 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:03" (1/1) ...
[2024-11-07 09:12:03,977 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-07 09:12:03,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:03" (1/1) ...
[2024-11-07 09:12:03,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:03" (1/1) ...
[2024-11-07 09:12:03,983 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:03" (1/1) ...
[2024-11-07 09:12:03,986 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:03" (1/1) ...
[2024-11-07 09:12:03,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:03" (1/1) ...
[2024-11-07 09:12:03,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:03" (1/1) ...
[2024-11-07 09:12:03,990 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 09:12:03,991 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 09:12:03,991 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 09:12:03,992 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 09:12:03,992 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:03" (1/1) ...
[2024-11-07 09:12:04,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 09:12:04,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 09:12:04,026 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)
[2024-11-07 09:12:04,032 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
[2024-11-07 09:12:04,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 09:12:04,048 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 09:12:04,049 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 09:12:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 09:12:04,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 09:12:04,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 09:12:04,143 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 09:12:04,144 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 09:12:04,492 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live.
[2024-11-07 09:12:04,493 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 09:12:04,505 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 09:12:04,506 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 09:12:04,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:12:04 BoogieIcfgContainer
[2024-11-07 09:12:04,506 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 09:12:04,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 09:12:04,508 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 09:12:04,513 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 09:12:04,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:12:03" (1/3) ...
[2024-11-07 09:12:04,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4c2d3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:12:04, skipping insertion in model container
[2024-11-07 09:12:04,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:03" (2/3) ...
[2024-11-07 09:12:04,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4c2d3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:12:04, skipping insertion in model container
[2024-11-07 09:12:04,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:12:04" (3/3) ...
[2024-11-07 09:12:04,516 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-98.i
[2024-11-07 09:12:04,527 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 09:12:04,527 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 09:12:04,583 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 09:12:04,592 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;@158de2ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 09:12:04,592 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 09:12:04,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-07 09:12:04,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153
[2024-11-07 09:12:04,607 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 09:12:04,607 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 09:12:04,608 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 09:12:04,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 09:12:04,612 INFO L85 PathProgramCache]: Analyzing trace with hash 2036502826, now seen corresponding path program 1 times
[2024-11-07 09:12:04,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 09:12:04,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458375590]
[2024-11-07 09:12:04,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 09:12:04,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 09:12:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:04,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 09:12:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:04,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 09:12:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:04,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-07 09:12:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:04,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 09:12:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:04,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-07 09:12:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:04,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 09:12:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:04,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-07 09:12:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:04,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 09:12:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:04,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-07 09:12:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:04,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 09:12:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:04,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 09:12:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:04,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 09:12:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:04,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 09:12:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:04,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-07 09:12:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:04,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 09:12:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:04,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-07 09:12:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:04,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 09:12:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:04,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 09:12:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:04,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105
[2024-11-07 09:12:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:04,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111
[2024-11-07 09:12:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:04,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117
[2024-11-07 09:12:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:04,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-07 09:12:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:04,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128
[2024-11-07 09:12:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:04,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-07 09:12:04,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 09:12:04,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458375590]
[2024-11-07 09:12:04,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458375590] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 09:12:04,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 09:12:04,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 09:12:04,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869825024]
[2024-11-07 09:12:04,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 09:12:04,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 09:12:04,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 09:12:05,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 09:12:05,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 09:12:05,010 INFO L87 Difference]: Start difference. First operand has 77 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-07 09:12:05,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 09:12:05,041 INFO L93 Difference]: Finished difference Result 147 states and 255 transitions.
[2024-11-07 09:12:05,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 09:12:05,043 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 152
[2024-11-07 09:12:05,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 09:12:05,048 INFO L225 Difference]: With dead ends: 147
[2024-11-07 09:12:05,048 INFO L226 Difference]: Without dead ends: 73
[2024-11-07 09:12:05,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 09:12:05,053 INFO L432 NwaCegarLoop]: 112 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, 112 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
[2024-11-07 09:12:05,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 09:12:05,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states.
[2024-11-07 09:12:05,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73.
[2024-11-07 09:12:05,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-07 09:12:05,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 112 transitions.
[2024-11-07 09:12:05,094 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 112 transitions. Word has length 152
[2024-11-07 09:12:05,094 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 09:12:05,094 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 112 transitions.
[2024-11-07 09:12:05,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-07 09:12:05,095 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 112 transitions.
[2024-11-07 09:12:05,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153
[2024-11-07 09:12:05,098 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 09:12:05,099 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 09:12:05,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 09:12:05,099 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 09:12:05,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 09:12:05,100 INFO L85 PathProgramCache]: Analyzing trace with hash -317854024, now seen corresponding path program 1 times
[2024-11-07 09:12:05,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 09:12:05,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432955714]
[2024-11-07 09:12:05,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 09:12:05,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 09:12:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:05,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 09:12:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:05,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 09:12:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:05,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-07 09:12:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:05,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 09:12:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:05,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-07 09:12:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:05,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 09:12:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:05,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-07 09:12:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:05,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 09:12:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:05,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-07 09:12:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:05,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 09:12:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:05,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 09:12:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:05,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 09:12:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:05,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 09:12:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:05,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-07 09:12:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:05,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 09:12:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:05,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-07 09:12:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:05,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 09:12:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:05,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 09:12:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:05,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105
[2024-11-07 09:12:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:05,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111
[2024-11-07 09:12:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:05,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117
[2024-11-07 09:12:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:05,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-07 09:12:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:05,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128
[2024-11-07 09:12:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:05,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-07 09:12:05,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 09:12:05,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432955714]
[2024-11-07 09:12:05,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432955714] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 09:12:05,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 09:12:05,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 09:12:05,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600896824]
[2024-11-07 09:12:05,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 09:12:05,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 09:12:05,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 09:12:05,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 09:12:05,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 09:12:05,477 INFO L87 Difference]: Start difference. First operand 73 states and 112 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 09:12:05,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 09:12:05,561 INFO L93 Difference]: Finished difference Result 211 states and 326 transitions.
[2024-11-07 09:12:05,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 09:12:05,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152
[2024-11-07 09:12:05,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 09:12:05,564 INFO L225 Difference]: With dead ends: 211
[2024-11-07 09:12:05,564 INFO L226 Difference]: Without dead ends: 141
[2024-11-07 09:12:05,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 09:12:05,567 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 97 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 09:12:05,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 290 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 09:12:05,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states.
[2024-11-07 09:12:05,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139.
[2024-11-07 09:12:05,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 90 states have internal predecessors, (121), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46)
[2024-11-07 09:12:05,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 213 transitions.
[2024-11-07 09:12:05,600 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 213 transitions. Word has length 152
[2024-11-07 09:12:05,601 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 09:12:05,601 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 213 transitions.
[2024-11-07 09:12:05,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 09:12:05,603 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 213 transitions.
[2024-11-07 09:12:05,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153
[2024-11-07 09:12:05,605 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 09:12:05,605 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 09:12:05,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 09:12:05,606 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 09:12:05,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 09:12:05,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1457153338, now seen corresponding path program 1 times
[2024-11-07 09:12:05,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 09:12:05,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170040141]
[2024-11-07 09:12:05,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 09:12:05,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 09:12:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:06,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 09:12:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:06,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 09:12:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:06,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-07 09:12:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:06,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 09:12:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:06,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-07 09:12:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:06,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 09:12:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:06,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-07 09:12:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:06,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 09:12:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:06,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-07 09:12:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:06,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 09:12:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:06,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 09:12:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:06,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 09:12:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:06,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 09:12:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:06,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-07 09:12:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:06,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 09:12:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:06,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-07 09:12:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:06,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 09:12:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:06,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 09:12:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:06,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105
[2024-11-07 09:12:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:06,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111
[2024-11-07 09:12:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:06,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117
[2024-11-07 09:12:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:06,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-07 09:12:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:06,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128
[2024-11-07 09:12:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-07 09:12:06,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 09:12:06,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170040141]
[2024-11-07 09:12:06,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170040141] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 09:12:06,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 09:12:06,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 09:12:06,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151852342]
[2024-11-07 09:12:06,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 09:12:06,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 09:12:06,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 09:12:06,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 09:12:06,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 09:12:06,807 INFO L87 Difference]: Start difference. First operand 139 states and 213 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-07 09:12:07,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 09:12:07,110 INFO L93 Difference]: Finished difference Result 377 states and 575 transitions.
[2024-11-07 09:12:07,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 09:12:07,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 152
[2024-11-07 09:12:07,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 09:12:07,115 INFO L225 Difference]: With dead ends: 377
[2024-11-07 09:12:07,117 INFO L226 Difference]: Without dead ends: 241
[2024-11-07 09:12:07,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-11-07 09:12:07,119 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 166 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 09:12:07,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 390 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 09:12:07,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states.
[2024-11-07 09:12:07,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 211.
[2024-11-07 09:12:07,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 137 states have (on average 1.3503649635036497) internal successors, (185), 137 states have internal predecessors, (185), 69 states have call successors, (69), 4 states have call predecessors, (69), 4 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69)
[2024-11-07 09:12:07,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 323 transitions.
[2024-11-07 09:12:07,168 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 323 transitions. Word has length 152
[2024-11-07 09:12:07,168 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 09:12:07,169 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 323 transitions.
[2024-11-07 09:12:07,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-07 09:12:07,169 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 323 transitions.
[2024-11-07 09:12:07,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153
[2024-11-07 09:12:07,171 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 09:12:07,171 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 09:12:07,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 09:12:07,172 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 09:12:07,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 09:12:07,172 INFO L85 PathProgramCache]: Analyzing trace with hash -131194564, now seen corresponding path program 1 times
[2024-11-07 09:12:07,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 09:12:07,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128449767]
[2024-11-07 09:12:07,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 09:12:07,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 09:12:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:07,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 09:12:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:07,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 09:12:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:07,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-07 09:12:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:07,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 09:12:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:07,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-07 09:12:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:07,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 09:12:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:07,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-07 09:12:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:07,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 09:12:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:07,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-07 09:12:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:07,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 09:12:07,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:07,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 09:12:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:07,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 09:12:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:07,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 09:12:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:07,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-07 09:12:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:07,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 09:12:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:07,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-07 09:12:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:07,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 09:12:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:07,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 09:12:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:07,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105
[2024-11-07 09:12:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:07,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111
[2024-11-07 09:12:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:07,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117
[2024-11-07 09:12:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:07,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-07 09:12:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:07,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128
[2024-11-07 09:12:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:07,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked.
[2024-11-07 09:12:07,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 09:12:07,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128449767]
[2024-11-07 09:12:07,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128449767] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 09:12:07,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716847571]
[2024-11-07 09:12:07,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 09:12:07,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 09:12:07,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 09:12:07,573 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)
[2024-11-07 09:12:07,575 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
[2024-11-07 09:12:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:07,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-07 09:12:07,740 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 09:12:07,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 498 proven. 24 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked.
[2024-11-07 09:12:07,884 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 09:12:08,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked.
[2024-11-07 09:12:08,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716847571] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 09:12:08,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 09:12:08,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7
[2024-11-07 09:12:08,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202203235]
[2024-11-07 09:12:08,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 09:12:08,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 09:12:08,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 09:12:08,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 09:12:08,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-07 09:12:08,114 INFO L87 Difference]: Start difference. First operand 211 states and 323 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32)
[2024-11-07 09:12:08,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 09:12:08,362 INFO L93 Difference]: Finished difference Result 445 states and 666 transitions.
[2024-11-07 09:12:08,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-07 09:12:08,363 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 152
[2024-11-07 09:12:08,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 09:12:08,365 INFO L225 Difference]: With dead ends: 445
[2024-11-07 09:12:08,365 INFO L226 Difference]: Without dead ends: 237
[2024-11-07 09:12:08,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110
[2024-11-07 09:12:08,368 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 168 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 09:12:08,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 197 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 09:12:08,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states.
[2024-11-07 09:12:08,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 223.
[2024-11-07 09:12:08,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 146 states have (on average 1.2945205479452055) internal successors, (189), 146 states have internal predecessors, (189), 69 states have call successors, (69), 7 states have call predecessors, (69), 7 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69)
[2024-11-07 09:12:08,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions.
[2024-11-07 09:12:08,417 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 152
[2024-11-07 09:12:08,417 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 09:12:08,417 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions.
[2024-11-07 09:12:08,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32)
[2024-11-07 09:12:08,418 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions.
[2024-11-07 09:12:08,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154
[2024-11-07 09:12:08,423 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 09:12:08,423 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 09:12:08,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-07 09:12:08,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 09:12:08,625 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 09:12:08,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 09:12:08,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1925501331, now seen corresponding path program 1 times
[2024-11-07 09:12:08,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 09:12:08,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829851225]
[2024-11-07 09:12:08,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 09:12:08,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 09:12:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:08,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 09:12:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:08,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 09:12:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:08,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-07 09:12:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:08,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 09:12:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:08,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-07 09:12:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:08,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 09:12:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:09,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-07 09:12:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:09,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 09:12:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:09,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-07 09:12:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:09,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 09:12:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:09,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 09:12:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:09,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 09:12:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:09,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 09:12:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:09,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-07 09:12:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:09,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 09:12:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:09,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-07 09:12:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:09,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 09:12:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:09,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 09:12:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:09,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105
[2024-11-07 09:12:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:09,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111
[2024-11-07 09:12:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:09,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117
[2024-11-07 09:12:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:09,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-07 09:12:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:09,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128
[2024-11-07 09:12:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:09,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked.
[2024-11-07 09:12:09,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 09:12:09,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829851225]
[2024-11-07 09:12:09,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829851225] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 09:12:09,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412230093]
[2024-11-07 09:12:09,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 09:12:09,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 09:12:09,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 09:12:09,064 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)
[2024-11-07 09:12:09,066 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
[2024-11-07 09:12:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:09,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-11-07 09:12:09,215 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 09:12:10,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 372 proven. 51 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked.
[2024-11-07 09:12:10,027 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 09:12:10,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked.
[2024-11-07 09:12:10,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412230093] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 09:12:10,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 09:12:10,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 17
[2024-11-07 09:12:10,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918415918]
[2024-11-07 09:12:10,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 09:12:10,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2024-11-07 09:12:10,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 09:12:10,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2024-11-07 09:12:10,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272
[2024-11-07 09:12:10,314 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 17 states have internal predecessors, (98), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 6 states have call predecessors, (69), 6 states have call successors, (69)
[2024-11-07 09:12:11,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 09:12:11,228 INFO L93 Difference]: Finished difference Result 674 states and 982 transitions.
[2024-11-07 09:12:11,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2024-11-07 09:12:11,229 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 17 states have internal predecessors, (98), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 6 states have call predecessors, (69), 6 states have call successors, (69) Word has length 153
[2024-11-07 09:12:11,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 09:12:11,233 INFO L225 Difference]: With dead ends: 674
[2024-11-07 09:12:11,233 INFO L226 Difference]: Without dead ends: 454
[2024-11-07 09:12:11,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650
[2024-11-07 09:12:11,234 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 231 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-07 09:12:11,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 748 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-07 09:12:11,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states.
[2024-11-07 09:12:11,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 280.
[2024-11-07 09:12:11,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 176 states have (on average 1.2443181818181819) internal successors, (219), 176 states have internal predecessors, (219), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92)
[2024-11-07 09:12:11,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 403 transitions.
[2024-11-07 09:12:11,292 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 403 transitions. Word has length 153
[2024-11-07 09:12:11,294 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 09:12:11,294 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 403 transitions.
[2024-11-07 09:12:11,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 17 states have internal predecessors, (98), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 6 states have call predecessors, (69), 6 states have call successors, (69)
[2024-11-07 09:12:11,295 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 403 transitions.
[2024-11-07 09:12:11,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154
[2024-11-07 09:12:11,296 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 09:12:11,297 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 09:12:11,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-11-07 09:12:11,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 09:12:11,502 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 09:12:11,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 09:12:11,502 INFO L85 PathProgramCache]: Analyzing trace with hash 375321259, now seen corresponding path program 1 times
[2024-11-07 09:12:11,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 09:12:11,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130091377]
[2024-11-07 09:12:11,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 09:12:11,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 09:12:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:21,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 09:12:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:21,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 09:12:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:21,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-07 09:12:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:21,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 09:12:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:21,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-07 09:12:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:21,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 09:12:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:21,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-07 09:12:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:21,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 09:12:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:21,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-07 09:12:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:21,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 09:12:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:21,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 09:12:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:21,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 09:12:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:21,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 09:12:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:22,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-07 09:12:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:22,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 09:12:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:22,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-07 09:12:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:22,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 09:12:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:22,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 09:12:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:22,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105
[2024-11-07 09:12:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:22,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111
[2024-11-07 09:12:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:22,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117
[2024-11-07 09:12:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:22,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-07 09:12:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:22,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128
[2024-11-07 09:12:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:22,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 129 proven. 51 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked.
[2024-11-07 09:12:22,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 09:12:22,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130091377]
[2024-11-07 09:12:22,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130091377] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 09:12:22,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078068784]
[2024-11-07 09:12:22,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 09:12:22,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 09:12:22,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 09:12:22,168 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 09:12:22,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-07 09:12:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:12:22,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 42 conjuncts are in the unsatisfiable core
[2024-11-07 09:12:22,443 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 09:12:24,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 563 proven. 156 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked.
[2024-11-07 09:12:24,689 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 09:12:43,699 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-07 09:12:46,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078068784] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 09:12:46,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 09:12:46,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25] total 40
[2024-11-07 09:12:46,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429263944]
[2024-11-07 09:12:46,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 09:12:46,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states
[2024-11-07 09:12:46,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 09:12:46,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2024-11-07 09:12:46,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=2154, Unknown=0, NotChecked=0, Total=2450
[2024-11-07 09:12:46,381 INFO L87 Difference]: Start difference. First operand 280 states and 403 transitions. Second operand has 40 states, 37 states have (on average 2.72972972972973) internal successors, (101), 36 states have internal predecessors, (101), 13 states have call successors, (46), 6 states have call predecessors, (46), 10 states have return successors, (46), 13 states have call predecessors, (46), 13 states have call successors, (46)
[2024-11-07 09:13:02,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 09:13:02,403 INFO L93 Difference]: Finished difference Result 1443 states and 1945 transitions.
[2024-11-07 09:13:02,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states.
[2024-11-07 09:13:02,404 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 2.72972972972973) internal successors, (101), 36 states have internal predecessors, (101), 13 states have call successors, (46), 6 states have call predecessors, (46), 10 states have return successors, (46), 13 states have call predecessors, (46), 13 states have call successors, (46) Word has length 153
[2024-11-07 09:13:02,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 09:13:02,411 INFO L225 Difference]: With dead ends: 1443
[2024-11-07 09:13:02,411 INFO L226 Difference]: Without dead ends: 1299
[2024-11-07 09:13:02,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12619 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=5111, Invalid=32331, Unknown=0, NotChecked=0, Total=37442
[2024-11-07 09:13:02,421 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 2611 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 3671 mSolverCounterSat, 669 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2615 SdHoareTripleChecker+Valid, 1908 SdHoareTripleChecker+Invalid, 4340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 669 IncrementalHoareTripleChecker+Valid, 3671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time
[2024-11-07 09:13:02,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2615 Valid, 1908 Invalid, 4340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [669 Valid, 3671 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time]
[2024-11-07 09:13:02,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states.
[2024-11-07 09:13:02,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 556.
[2024-11-07 09:13:02,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 368 states have (on average 1.190217391304348) internal successors, (438), 368 states have internal predecessors, (438), 138 states have call successors, (138), 49 states have call predecessors, (138), 49 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138)
[2024-11-07 09:13:02,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 714 transitions.
[2024-11-07 09:13:02,530 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 714 transitions. Word has length 153
[2024-11-07 09:13:02,531 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 09:13:02,531 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 714 transitions.
[2024-11-07 09:13:02,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 2.72972972972973) internal successors, (101), 36 states have internal predecessors, (101), 13 states have call successors, (46), 6 states have call predecessors, (46), 10 states have return successors, (46), 13 states have call predecessors, (46), 13 states have call successors, (46)
[2024-11-07 09:13:02,532 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 714 transitions.
[2024-11-07 09:13:02,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154
[2024-11-07 09:13:02,533 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 09:13:02,533 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 09:13:02,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-11-07 09:13:02,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 09:13:02,738 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 09:13:02,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 09:13:02,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1055379629, now seen corresponding path program 1 times
[2024-11-07 09:13:02,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 09:13:02,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840374875]
[2024-11-07 09:13:02,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 09:13:02,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 09:13:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-07 09:13:02,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1068537680]
[2024-11-07 09:13:02,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 09:13:02,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 09:13:02,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 09:13:02,879 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 09:13:02,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-07 09:13:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 09:13:03,002 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 09:13:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 09:13:03,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 09:13:03,170 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 09:13:03,171 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-07 09:13:03,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-11-07 09:13:03,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6
[2024-11-07 09:13:03,378 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1]
[2024-11-07 09:13:03,501 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 09:13:03,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:13:03 BoogieIcfgContainer
[2024-11-07 09:13:03,506 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 09:13:03,507 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 09:13:03,507 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 09:13:03,507 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 09:13:03,508 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:12:04" (3/4) ...
[2024-11-07 09:13:03,509 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-07 09:13:03,510 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 09:13:03,511 INFO L158 Benchmark]: Toolchain (without parser) took 59873.70ms. Allocated memory was 117.4MB in the beginning and 478.2MB in the end (delta: 360.7MB). Free memory was 91.4MB in the beginning and 173.3MB in the end (delta: -81.9MB). Peak memory consumption was 278.5MB. Max. memory is 16.1GB.
[2024-11-07 09:13:03,512 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 117.4MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 09:13:03,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.78ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 76.1MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 09:13:03,513 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.36ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 73.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 09:13:03,513 INFO L158 Benchmark]: Boogie Preprocessor took 39.12ms. Allocated memory is still 117.4MB. Free memory was 73.5MB in the beginning and 70.2MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 09:13:03,513 INFO L158 Benchmark]: RCFGBuilder took 514.93ms. Allocated memory is still 117.4MB. Free memory was 70.1MB in the beginning and 48.8MB in the end (delta: 21.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 09:13:03,513 INFO L158 Benchmark]: TraceAbstraction took 58997.94ms. Allocated memory was 117.4MB in the beginning and 478.2MB in the end (delta: 360.7MB). Free memory was 48.1MB in the beginning and 173.5MB in the end (delta: -125.4MB). Peak memory consumption was 236.5MB. Max. memory is 16.1GB.
[2024-11-07 09:13:03,513 INFO L158 Benchmark]: Witness Printer took 3.79ms. Allocated memory is still 478.2MB. Free memory was 173.5MB in the beginning and 173.3MB in the end (delta: 120.1kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 09:13:03,515 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.29ms. Allocated memory is still 117.4MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 265.78ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 76.1MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 46.36ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 73.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 39.12ms. Allocated memory is still 117.4MB. Free memory was 73.5MB in the beginning and 70.2MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 514.93ms. Allocated memory is still 117.4MB. Free memory was 70.1MB in the beginning and 48.8MB in the end (delta: 21.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* TraceAbstraction took 58997.94ms. Allocated memory was 117.4MB in the beginning and 478.2MB in the end (delta: 360.7MB). Free memory was 48.1MB in the beginning and 173.5MB in the end (delta: -125.4MB). Peak memory consumption was 236.5MB. Max. memory is 16.1GB.
* Witness Printer took 3.79ms. Allocated memory is still 478.2MB. Free memory was 173.5MB in the beginning and 173.3MB in the end (delta: 120.1kB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: overapproximation of someBinaryFLOATComparisonOperation at line 172, overapproximation of someBinaryArithmeticFLOAToperation at line 74.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] signed char var_1_1 = -2;
[L23] unsigned long int var_1_4 = 128;
[L24] signed char var_1_5 = 100;
[L25] signed char var_1_6 = 5;
[L26] signed char var_1_7 = 25;
[L27] signed long int var_1_8 = 0;
[L28] signed long int var_1_9 = 100;
[L29] signed char var_1_10 = 10;
[L30] unsigned char var_1_11 = 1;
[L31] unsigned char var_1_12 = 0;
[L32] unsigned char var_1_14 = 0;
[L33] float var_1_15 = 63.5;
[L34] float var_1_16 = 0.0;
[L35] float var_1_17 = 8.16;
[L36] float var_1_18 = 4.625;
[L37] float var_1_19 = 1000000.2;
[L38] float var_1_20 = 5.2;
[L39] signed char var_1_21 = 8;
[L40] signed long int var_1_22 = 64;
[L41] signed char var_1_24 = 10;
[L42] float var_1_25 = 0.0;
[L43] float var_1_26 = 128.55;
[L44] signed char var_1_27 = 16;
[L45] unsigned long int var_1_28 = 256;
[L46] signed short int var_1_29 = -128;
[L47] signed char last_1_var_1_10 = 10;
[L48] signed long int last_1_var_1_22 = 64;
[L49] unsigned long int last_1_var_1_28 = 256;
VAL [isInitial=0, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100]
[L176] isInitial = 1
[L177] FCALL initially()
[L178] COND TRUE 1
[L179] CALL updateLastVariables()
[L167] last_1_var_1_10 = var_1_10
[L168] last_1_var_1_22 = var_1_22
[L169] last_1_var_1_28 = var_1_28
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100]
[L179] RET updateLastVariables()
[L180] CALL updateVariables()
[L128] var_1_4 = __VERIFIER_nondet_ulong()
[L129] CALL assume_abort_if_not(var_1_4 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100]
[L129] RET assume_abort_if_not(var_1_4 >= 0)
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100]
[L130] CALL assume_abort_if_not(var_1_4 <= 4294967295)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100]
[L130] RET assume_abort_if_not(var_1_4 <= 4294967295)
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100]
[L131] CALL assume_abort_if_not(var_1_4 != 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100]
[L131] RET assume_abort_if_not(var_1_4 != 0)
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100]
[L132] var_1_5 = __VERIFIER_nondet_char()
[L133] CALL assume_abort_if_not(var_1_5 >= 62)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100]
[L133] RET assume_abort_if_not(var_1_5 >= 62)
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100]
[L134] CALL assume_abort_if_not(var_1_5 <= 126)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100]
[L134] RET assume_abort_if_not(var_1_5 <= 126)
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100]
[L135] var_1_6 = __VERIFIER_nondet_char()
[L136] CALL assume_abort_if_not(var_1_6 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=100]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=100]
[L136] RET assume_abort_if_not(var_1_6 >= 0)
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=100]
[L137] CALL assume_abort_if_not(var_1_6 <= 63)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=100]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=100]
[L137] RET assume_abort_if_not(var_1_6 <= 63)
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=100]
[L138] var_1_7 = __VERIFIER_nondet_char()
[L139] CALL assume_abort_if_not(var_1_7 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=100]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=100]
[L139] RET assume_abort_if_not(var_1_7 >= 0)
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=100]
[L140] CALL assume_abort_if_not(var_1_7 <= 126)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=100]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=100]
[L140] RET assume_abort_if_not(var_1_7 <= 126)
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=100]
[L141] var_1_9 = __VERIFIER_nondet_long()
[L142] CALL assume_abort_if_not(var_1_9 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L142] RET assume_abort_if_not(var_1_9 >= 0)
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L143] CALL assume_abort_if_not(var_1_9 <= 2147483646)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L143] RET assume_abort_if_not(var_1_9 <= 2147483646)
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L144] var_1_12 = __VERIFIER_nondet_uchar()
[L145] CALL assume_abort_if_not(var_1_12 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L145] RET assume_abort_if_not(var_1_12 >= 0)
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L146] CALL assume_abort_if_not(var_1_12 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L146] RET assume_abort_if_not(var_1_12 <= 1)
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L147] var_1_14 = __VERIFIER_nondet_uchar()
[L148] CALL assume_abort_if_not(var_1_14 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L148] RET assume_abort_if_not(var_1_14 >= 0)
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L149] CALL assume_abort_if_not(var_1_14 <= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L149] RET assume_abort_if_not(var_1_14 <= 0)
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L150] var_1_16 = __VERIFIER_nondet_float()
[L151] CALL assume_abort_if_not((var_1_16 >= 4611686.018427382800e+12F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L151] RET assume_abort_if_not((var_1_16 >= 4611686.018427382800e+12F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L152] var_1_17 = __VERIFIER_nondet_float()
[L153] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L153] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L154] var_1_18 = __VERIFIER_nondet_float()
[L155] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L155] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L156] var_1_19 = __VERIFIER_nondet_float()
[L157] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L157] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L158] var_1_25 = __VERIFIER_nondet_float()
[L159] CALL assume_abort_if_not((var_1_25 >= 4611686.018427387900e+12F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854776000e+12F && var_1_25 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L159] RET assume_abort_if_not((var_1_25 >= 4611686.018427387900e+12F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854776000e+12F && var_1_25 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L160] var_1_26 = __VERIFIER_nondet_float()
[L161] CALL assume_abort_if_not((var_1_26 >= 0.0F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427387900e+12F && var_1_26 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L161] RET assume_abort_if_not((var_1_26 >= 0.0F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427387900e+12F && var_1_26 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L162] var_1_27 = __VERIFIER_nondet_char()
[L163] CALL assume_abort_if_not(var_1_27 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L163] RET assume_abort_if_not(var_1_27 >= 0)
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L164] CALL assume_abort_if_not(var_1_27 <= 63)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L164] RET assume_abort_if_not(var_1_27 <= 63)
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L180] RET updateVariables()
[L181] CALL step()
[L53] COND FALSE !(\read(var_1_14))
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L56] COND FALSE !(last_1_var_1_10 >= (var_1_6 + last_1_var_1_22))
[L59] var_1_21 = var_1_7
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L62] COND FALSE !(last_1_var_1_28 <= ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L65] COND TRUE \read(var_1_12)
[L66] var_1_11 = (((var_1_20 + 31.75f) <= 4.2f) && var_1_14)
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L68] signed char stepLocal_0 = var_1_7;
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_0=0, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49]
[L69] COND TRUE stepLocal_0 != var_1_4
[L70] var_1_8 = ((var_1_7 + ((((var_1_6) > (var_1_5)) ? (var_1_6) : (var_1_5)))) - var_1_9)
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49]
[L74] var_1_15 = ((((((var_1_16 - var_1_17)) > (var_1_18)) ? ((var_1_16 - var_1_17)) : (var_1_18))) - var_1_19)
[L75] unsigned char stepLocal_3 = var_1_11;
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49]
[L76] COND TRUE var_1_17 > (((((var_1_19) > (var_1_16)) ? (var_1_19) : (var_1_16))) - (var_1_25 - var_1_26))
[L77] var_1_24 = (32 - (var_1_6 + var_1_27))
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=-1, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49]
[L89] COND FALSE !(\read(var_1_11))
[L98] var_1_28 = ((((var_1_7) > (var_1_6)) ? (var_1_7) : (var_1_6)))
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49]
[L100] signed long int stepLocal_1 = var_1_24 + (var_1_5 - var_1_7);
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_1=61, stepLocal_3=0, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49]
[L101] COND FALSE !(var_1_6 >= stepLocal_1)
[L104] var_1_10 = var_1_7
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49]
[L106] unsigned char stepLocal_2 = var_1_11;
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49]
[L107] COND FALSE !(stepLocal_2 && var_1_11)
[L110] var_1_22 = ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28)))
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=1, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49]
[L112] COND FALSE !(10u <= ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))))
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=1, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49]
[L117] COND FALSE !((var_1_8 > var_1_22) && (var_1_19 < (var_1_15 / var_1_16)))
[L124] var_1_29 = var_1_27
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=1, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=32, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49]
[L181] RET step()
[L182] CALL, EXPR property()
[L172-L173] return (((((((((((10u <= ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))) ? ((((((16u) < (var_1_22)) ? (16u) : (var_1_22))) >= (var_1_8 % var_1_4)) ? (var_1_1 == ((signed char) ((var_1_5 - var_1_6) - var_1_7))) : 1) : 1) && ((var_1_7 != var_1_4) ? (var_1_8 == ((signed long int) ((var_1_7 + ((((var_1_6) > (var_1_5)) ? (var_1_6) : (var_1_5)))) - var_1_9))) : (var_1_8 == ((signed long int) var_1_21)))) && ((var_1_6 >= (var_1_24 + (var_1_5 - var_1_7))) ? (var_1_10 == ((signed char) (var_1_7 - var_1_6))) : (var_1_10 == ((signed char) var_1_7)))) && (var_1_12 ? (var_1_11 == ((unsigned char) (((var_1_20 + 31.75f) <= 4.2f) && var_1_14))) : 1)) && (var_1_15 == ((float) ((((((var_1_16 - var_1_17)) > (var_1_18)) ? ((var_1_16 - var_1_17)) : (var_1_18))) - var_1_19)))) && ((last_1_var_1_28 <= ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) ? (var_1_20 == ((float) ((((var_1_17) < (var_1_16)) ? (var_1_17) : (var_1_16))))) : 1)) && (var_1_14 ? (var_1_21 == ((signed char) ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))) : ((last_1_var_1_10 >= (var_1_6 + last_1_var_1_22)) ? (var_1_21 == ((signed char) var_1_6)) : (var_1_21 == ((signed char) var_1_7))))) && ((var_1_11 && var_1_11) ? (var_1_22 == ((signed long int) (((((var_1_6 + var_1_10) + var_1_21) < 0 ) ? -((var_1_6 + var_1_10) + var_1_21) : ((var_1_6 + var_1_10) + var_1_21))))) : (var_1_22 == ((signed long int) ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))))))) && ((var_1_17 > (((((var_1_19) > (var_1_16)) ? (var_1_19) : (var_1_16))) - (var_1_25 - var_1_26))) ? (var_1_24 == ((signed char) (32 - (var_1_6 + var_1_27)))) : ((var_1_11 && (var_1_11 && var_1_14)) ? (var_1_24 == ((signed char) (var_1_6 + var_1_27))) : ((var_1_15 >= var_1_18) ? (var_1_24 == ((signed char) var_1_6)) : (var_1_24 == ((signed char) var_1_27)))))) && (var_1_11 ? ((! (var_1_20 >= var_1_16)) ? (var_1_28 == ((unsigned long int) (var_1_27 + var_1_5))) : (((- var_1_26) < (- (var_1_15 + var_1_17))) ? (var_1_28 == ((unsigned long int) ((((var_1_7) > (var_1_27)) ? (var_1_7) : (var_1_27))))) : 1)) : (var_1_28 == ((unsigned long int) ((((var_1_7) > (var_1_6)) ? (var_1_7) : (var_1_6))))))) && (((var_1_8 > var_1_22) && (var_1_19 < (var_1_15 / var_1_16))) ? ((var_1_27 != (var_1_7 - var_1_6)) ? (var_1_29 == ((signed short int) (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))) - ((10000 - var_1_5) + var_1_27)))) : (var_1_29 == ((signed short int) var_1_10))) : (var_1_29 == ((signed short int) var_1_27)))
;
VAL [\result=0, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=1, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=32, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49]
[L182] RET, EXPR property()
[L182] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=1, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=32, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49]
[L19] reach_error()
VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=1, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=32, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 58.8s, OverallIterations: 7, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3312 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3273 mSDsluCounter, 3645 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2959 mSDsCounter, 952 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4735 IncrementalHoareTripleChecker+Invalid, 5687 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 952 mSolverCounterUnsat, 686 mSDtfsCounter, 4735 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1301 GetRequests, 1068 SyntacticMatches, 1 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12732 ImplicationChecksByTransitivity, 18.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=556occurred in iteration=6, InterpolantAutomatonStates: 200, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 963 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 37.8s InterpolantComputationTime, 1678 NumberOfCodeBlocks, 1678 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1666 ConstructedInterpolants, 0 QuantifiedInterpolants, 9061 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1093 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 10700/11132 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
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-11-07 09:13:03,737 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process
[2024-11-07 09:13:03,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 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_operatoramount_amount100_file-98.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 3e656310ec67c2d05ae017a9135a80fcd37a9ab722f93d5597cf89a898d3876d
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 09:13:05,909 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 09:13:06,015 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-07 09:13:06,022 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 09:13:06,024 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 09:13:06,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 09:13:06,054 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 09:13:06,054 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 09:13:06,055 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 09:13:06,055 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 09:13:06,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 09:13:06,056 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 09:13:06,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 09:13:06,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 09:13:06,057 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 09:13:06,057 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 09:13:06,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 09:13:06,058 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 09:13:06,058 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 09:13:06,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 09:13:06,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 09:13:06,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 09:13:06,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 09:13:06,059 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 09:13:06,059 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-07 09:13:06,059 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 09:13:06,059 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-07 09:13:06,059 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 09:13:06,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 09:13:06,059 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 09:13:06,059 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 09:13:06,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 09:13:06,060 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 09:13:06,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 09:13:06,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 09:13:06,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 09:13:06,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 09:13:06,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 09:13:06,061 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-11-07 09:13:06,061 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-07 09:13:06,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 09:13:06,061 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 09:13:06,061 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 09:13:06,061 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 09:13:06,062 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 -> 3e656310ec67c2d05ae017a9135a80fcd37a9ab722f93d5597cf89a898d3876d
[2024-11-07 09:13:06,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 09:13:06,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 09:13:06,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 09:13:06,380 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 09:13:06,380 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 09:13:06,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-98.i
[2024-11-07 09:13:07,879 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 09:13:08,164 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 09:13:08,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-98.i
[2024-11-07 09:13:08,178 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/743315a53/9ebdc0a3622c49629424ea7e49e1b94b/FLAG79a76ec65
[2024-11-07 09:13:08,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/743315a53/9ebdc0a3622c49629424ea7e49e1b94b
[2024-11-07 09:13:08,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 09:13:08,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 09:13:08,207 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 09:13:08,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 09:13:08,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 09:13:08,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:13:08" (1/1) ...
[2024-11-07 09:13:08,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a42c97c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08, skipping insertion in model container
[2024-11-07 09:13:08,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:13:08" (1/1) ...
[2024-11-07 09:13:08,238 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 09:13:08,382 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_operatoramount_amount100_file-98.i[916,929]
[2024-11-07 09:13:08,479 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 09:13:08,499 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 09:13:08,510 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_operatoramount_amount100_file-98.i[916,929]
[2024-11-07 09:13:08,570 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 09:13:08,596 INFO L204 MainTranslator]: Completed translation
[2024-11-07 09:13:08,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08 WrapperNode
[2024-11-07 09:13:08,598 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 09:13:08,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 09:13:08,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 09:13:08,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 09:13:08,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08" (1/1) ...
[2024-11-07 09:13:08,626 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08" (1/1) ...
[2024-11-07 09:13:08,664 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174
[2024-11-07 09:13:08,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 09:13:08,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 09:13:08,665 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 09:13:08,665 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 09:13:08,676 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08" (1/1) ...
[2024-11-07 09:13:08,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08" (1/1) ...
[2024-11-07 09:13:08,682 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08" (1/1) ...
[2024-11-07 09:13:08,713 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-07 09:13:08,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08" (1/1) ...
[2024-11-07 09:13:08,713 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08" (1/1) ...
[2024-11-07 09:13:08,734 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08" (1/1) ...
[2024-11-07 09:13:08,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08" (1/1) ...
[2024-11-07 09:13:08,740 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08" (1/1) ...
[2024-11-07 09:13:08,741 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08" (1/1) ...
[2024-11-07 09:13:08,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 09:13:08,745 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 09:13:08,745 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 09:13:08,745 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 09:13:08,746 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08" (1/1) ...
[2024-11-07 09:13:08,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 09:13:08,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 09:13:08,784 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)
[2024-11-07 09:13:08,792 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
[2024-11-07 09:13:08,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 09:13:08,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-07 09:13:08,820 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 09:13:08,820 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 09:13:08,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 09:13:08,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 09:13:08,908 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 09:13:08,910 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 09:13:17,076 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live.
[2024-11-07 09:13:17,076 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 09:13:17,085 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 09:13:17,085 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 09:13:17,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:13:17 BoogieIcfgContainer
[2024-11-07 09:13:17,086 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 09:13:17,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 09:13:17,089 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 09:13:17,093 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 09:13:17,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:13:08" (1/3) ...
[2024-11-07 09:13:17,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d87e946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:13:17, skipping insertion in model container
[2024-11-07 09:13:17,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08" (2/3) ...
[2024-11-07 09:13:17,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d87e946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:13:17, skipping insertion in model container
[2024-11-07 09:13:17,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:13:17" (3/3) ...
[2024-11-07 09:13:17,095 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-98.i
[2024-11-07 09:13:17,109 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 09:13:17,109 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 09:13:17,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 09:13:17,172 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;@557b8063, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 09:13:17,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 09:13:17,177 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-07 09:13:17,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153
[2024-11-07 09:13:17,187 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 09:13:17,188 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 09:13:17,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 09:13:17,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 09:13:17,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2036502826, now seen corresponding path program 1 times
[2024-11-07 09:13:17,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 09:13:17,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326606447]
[2024-11-07 09:13:17,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 09:13:17,204 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
[2024-11-07 09:13:17,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 09:13:17,207 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)
[2024-11-07 09:13:17,208 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
[2024-11-07 09:13:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:13:17,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-07 09:13:17,771 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 09:13:17,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked.
[2024-11-07 09:13:17,816 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 09:13:17,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 09:13:17,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326606447]
[2024-11-07 09:13:17,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326606447] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 09:13:17,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 09:13:17,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 09:13:17,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82727570]
[2024-11-07 09:13:17,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 09:13:17,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 09:13:17,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 09:13:17,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 09:13:17,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 09:13:17,847 INFO L87 Difference]: Start difference. First operand has 77 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-07 09:13:17,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 09:13:17,897 INFO L93 Difference]: Finished difference Result 147 states and 255 transitions.
[2024-11-07 09:13:17,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 09:13:17,898 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 152
[2024-11-07 09:13:17,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 09:13:17,907 INFO L225 Difference]: With dead ends: 147
[2024-11-07 09:13:17,907 INFO L226 Difference]: Without dead ends: 73
[2024-11-07 09:13:17,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 09:13:17,912 INFO L432 NwaCegarLoop]: 112 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, 112 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
[2024-11-07 09:13:17,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 09:13:17,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states.
[2024-11-07 09:13:17,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73.
[2024-11-07 09:13:17,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-07 09:13:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 112 transitions.
[2024-11-07 09:13:17,956 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 112 transitions. Word has length 152
[2024-11-07 09:13:17,956 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 09:13:17,956 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 112 transitions.
[2024-11-07 09:13:17,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-07 09:13:17,957 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 112 transitions.
[2024-11-07 09:13:17,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153
[2024-11-07 09:13:17,960 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 09:13:17,960 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 09:13:17,983 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
[2024-11-07 09:13:18,165 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
[2024-11-07 09:13:18,166 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 09:13:18,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 09:13:18,167 INFO L85 PathProgramCache]: Analyzing trace with hash -317854024, now seen corresponding path program 1 times
[2024-11-07 09:13:18,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 09:13:18,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110349209]
[2024-11-07 09:13:18,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 09:13:18,168 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
[2024-11-07 09:13:18,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 09:13:18,170 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)
[2024-11-07 09:13:18,173 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
[2024-11-07 09:13:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:13:18,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 09:13:18,736 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 09:13:19,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 498 proven. 24 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked.
[2024-11-07 09:13:19,600 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 09:13:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked.
[2024-11-07 09:13:20,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 09:13:20,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110349209]
[2024-11-07 09:13:20,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110349209] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 09:13:20,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 09:13:20,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7
[2024-11-07 09:13:20,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706221058]
[2024-11-07 09:13:20,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 09:13:20,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 09:13:20,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 09:13:20,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 09:13:20,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-07 09:13:20,745 INFO L87 Difference]: Start difference. First operand 73 states and 112 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32)