./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-46.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_codestructure_steplocals_file-46.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', '7524697c66e1a4ecd762521f8a604e650820f18fffb82d104752941738ae4cd5']
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_codestructure_steplocals_file-46.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 7524697c66e1a4ecd762521f8a604e650820f18fffb82d104752941738ae4cd5
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 04:21:27,076 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 04:21:27,168 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-07 04:21:27,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 04:21:27,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 04:21:27,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 04:21:27,202 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 04:21:27,202 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 04:21:27,203 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 04:21:27,203 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 04:21:27,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 04:21:27,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 04:21:27,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 04:21:27,203 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 04:21:27,204 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 04:21:27,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 04:21:27,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 04:21:27,204 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 04:21:27,204 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 04:21:27,204 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 04:21:27,204 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 04:21:27,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 04:21:27,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 04:21:27,205 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 04:21:27,205 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 04:21:27,205 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 04:21:27,205 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 04:21:27,205 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 04:21:27,205 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 04:21:27,206 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 04:21:27,206 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 04:21:27,206 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 04:21:27,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 04:21:27,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 04:21:27,206 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 04:21:27,206 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 04:21:27,207 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 04:21:27,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 04:21:27,207 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 04:21:27,207 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 04:21:27,207 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 04:21:27,207 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 04:21:27,207 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 -> 7524697c66e1a4ecd762521f8a604e650820f18fffb82d104752941738ae4cd5
[2024-11-07 04:21:27,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 04:21:27,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 04:21:27,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 04:21:27,497 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 04:21:27,497 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 04:21:27,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-46.i
[2024-11-07 04:21:28,759 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 04:21:29,058 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 04:21:29,060 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-46.i
[2024-11-07 04:21:29,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fffeed7f9/28823dae790842a4a9e55c467b762ddd/FLAG1e32b38a3
[2024-11-07 04:21:29,088 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fffeed7f9/28823dae790842a4a9e55c467b762ddd
[2024-11-07 04:21:29,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 04:21:29,093 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 04:21:29,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 04:21:29,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 04:21:29,099 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 04:21:29,100 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:21:29" (1/1) ...
[2024-11-07 04:21:29,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@383703cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:29, skipping insertion in model container
[2024-11-07 04:21:29,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:21:29" (1/1) ...
[2024-11-07 04:21:29,120 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 04:21:29,254 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_codestructure_steplocals_file-46.i[917,930]
[2024-11-07 04:21:29,319 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 04:21:29,330 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 04:21:29,342 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_codestructure_steplocals_file-46.i[917,930]
[2024-11-07 04:21:29,373 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 04:21:29,390 INFO L204 MainTranslator]: Completed translation
[2024-11-07 04:21:29,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:29 WrapperNode
[2024-11-07 04:21:29,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 04:21:29,392 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 04:21:29,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 04:21:29,393 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 04:21:29,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:29" (1/1) ...
[2024-11-07 04:21:29,414 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:29" (1/1) ...
[2024-11-07 04:21:29,464 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177
[2024-11-07 04:21:29,464 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 04:21:29,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 04:21:29,465 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 04:21:29,465 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 04:21:29,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:29" (1/1) ...
[2024-11-07 04:21:29,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:29" (1/1) ...
[2024-11-07 04:21:29,478 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:29" (1/1) ...
[2024-11-07 04:21:29,506 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 04:21:29,506 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:29" (1/1) ...
[2024-11-07 04:21:29,507 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:29" (1/1) ...
[2024-11-07 04:21:29,525 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:29" (1/1) ...
[2024-11-07 04:21:29,532 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:29" (1/1) ...
[2024-11-07 04:21:29,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:29" (1/1) ...
[2024-11-07 04:21:29,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:29" (1/1) ...
[2024-11-07 04:21:29,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 04:21:29,547 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 04:21:29,547 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 04:21:29,547 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 04:21:29,548 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:29" (1/1) ...
[2024-11-07 04:21:29,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 04:21:29,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 04:21:29,582 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 04:21:29,589 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 04:21:29,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 04:21:29,608 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 04:21:29,609 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 04:21:29,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 04:21:29,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 04:21:29,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 04:21:29,690 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 04:21:29,692 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 04:21:30,101 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live.
[2024-11-07 04:21:30,101 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 04:21:30,109 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 04:21:30,109 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 04:21:30,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:21:30 BoogieIcfgContainer
[2024-11-07 04:21:30,110 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 04:21:30,112 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 04:21:30,112 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 04:21:30,116 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 04:21:30,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:21:29" (1/3) ...
[2024-11-07 04:21:30,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f83c14b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:21:30, skipping insertion in model container
[2024-11-07 04:21:30,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:29" (2/3) ...
[2024-11-07 04:21:30,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f83c14b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:21:30, skipping insertion in model container
[2024-11-07 04:21:30,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:21:30" (3/3) ...
[2024-11-07 04:21:30,119 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-46.i
[2024-11-07 04:21:30,133 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 04:21:30,133 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 04:21:30,193 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 04:21:30,206 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;@5e83d7a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 04:21:30,206 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 04:21:30,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 51 states have (on average 1.411764705882353) internal successors, (72), 52 states have internal predecessors, (72), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22)
[2024-11-07 04:21:30,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142
[2024-11-07 04:21:30,225 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:21:30,226 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:21:30,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:21:30,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:21:30,233 INFO L85 PathProgramCache]: Analyzing trace with hash -805995562, now seen corresponding path program 1 times
[2024-11-07 04:21:30,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:21:30,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30124891]
[2024-11-07 04:21:30,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:21:30,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:21:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:30,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:21:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:30,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:21:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:30,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:21:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:30,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:21:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:30,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:21:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:30,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:21:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:30,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:21:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:30,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:21:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:30,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:21:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:30,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:21:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:30,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 04:21:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:30,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 04:21:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:30,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 04:21:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:30,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 04:21:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:30,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 04:21:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:30,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-07 04:21:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:30,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 04:21:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:30,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 04:21:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:30,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 04:21:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:30,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 04:21:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:30,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115
[2024-11-07 04:21:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:30,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 04:21:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:30,624 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2024-11-07 04:21:30,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:21:30,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30124891]
[2024-11-07 04:21:30,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30124891] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:21:30,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:21:30,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 04:21:30,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752649910]
[2024-11-07 04:21:30,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:21:30,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 04:21:30,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:21:30,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 04:21:30,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 04:21:30,652 INFO L87 Difference]: Start difference. First operand has 76 states, 51 states have (on average 1.411764705882353) internal successors, (72), 52 states have internal predecessors, (72), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22)
[2024-11-07 04:21:30,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:21:30,685 INFO L93 Difference]: Finished difference Result 145 states and 248 transitions.
[2024-11-07 04:21:30,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 04:21:30,687 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 141
[2024-11-07 04:21:30,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:21:30,695 INFO L225 Difference]: With dead ends: 145
[2024-11-07 04:21:30,696 INFO L226 Difference]: Without dead ends: 72
[2024-11-07 04:21:30,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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 04:21:30,702 INFO L432 NwaCegarLoop]: 107 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, 107 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 04:21:30,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 04:21:30,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states.
[2024-11-07 04:21:30,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72.
[2024-11-07 04:21:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22)
[2024-11-07 04:21:30,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 107 transitions.
[2024-11-07 04:21:30,749 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 107 transitions. Word has length 141
[2024-11-07 04:21:30,750 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:21:30,751 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 107 transitions.
[2024-11-07 04:21:30,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22)
[2024-11-07 04:21:30,751 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 107 transitions.
[2024-11-07 04:21:30,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2024-11-07 04:21:30,754 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:21:30,754 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:21:30,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 04:21:30,755 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:21:30,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:21:30,755 INFO L85 PathProgramCache]: Analyzing trace with hash -103296540, now seen corresponding path program 1 times
[2024-11-07 04:21:30,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:21:30,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30748450]
[2024-11-07 04:21:30,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:21:30,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:21:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:40,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:21:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:40,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:21:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:40,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:21:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:40,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:21:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:40,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:21:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:40,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:21:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:40,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:21:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:40,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:21:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:40,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:21:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:40,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:21:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:40,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 04:21:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:40,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 04:21:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:40,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 04:21:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:40,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 04:21:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:40,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 04:21:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:40,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-07 04:21:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:40,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 04:21:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:40,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 04:21:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:40,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 04:21:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:40,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 04:21:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:40,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115
[2024-11-07 04:21:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:40,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 04:21:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2024-11-07 04:21:40,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:21:40,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30748450]
[2024-11-07 04:21:40,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30748450] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:21:40,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:21:40,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 04:21:40,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969908848]
[2024-11-07 04:21:40,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:21:40,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 04:21:40,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:21:40,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 04:21:40,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-07 04:21:40,933 INFO L87 Difference]: Start difference. First operand 72 states and 107 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2024-11-07 04:21:43,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:21:43,604 INFO L93 Difference]: Finished difference Result 231 states and 334 transitions.
[2024-11-07 04:21:43,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 04:21:43,605 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142
[2024-11-07 04:21:43,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:21:43,607 INFO L225 Difference]: With dead ends: 231
[2024-11-07 04:21:43,608 INFO L226 Difference]: Without dead ends: 162
[2024-11-07 04:21:43,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-11-07 04:21:43,609 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 210 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-07 04:21:43,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 372 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-07 04:21:43,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states.
[2024-11-07 04:21:43,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 96.
[2024-11-07 04:21:43,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 67 states have (on average 1.328358208955224) internal successors, (89), 68 states have internal predecessors, (89), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26)
[2024-11-07 04:21:43,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 141 transitions.
[2024-11-07 04:21:43,627 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 141 transitions. Word has length 142
[2024-11-07 04:21:43,627 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:21:43,628 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 141 transitions.
[2024-11-07 04:21:43,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2024-11-07 04:21:43,628 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 141 transitions.
[2024-11-07 04:21:43,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2024-11-07 04:21:43,630 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:21:43,630 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:21:43,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 04:21:43,630 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:21:43,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:21:43,631 INFO L85 PathProgramCache]: Analyzing trace with hash 154868898, now seen corresponding path program 1 times
[2024-11-07 04:21:43,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:21:43,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872983884]
[2024-11-07 04:21:43,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:21:43,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:21:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-07 04:21:43,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [684970715]
[2024-11-07 04:21:43,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:21:43,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 04:21:43,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 04:21:43,701 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 04:21:43,705 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 04:21:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:21:43,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 43 conjuncts are in the unsatisfiable core
[2024-11-07 04:21:43,913 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 04:21:45,791 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 474 proven. 246 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked.
[2024-11-07 04:21:45,791 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 04:21:49,936 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 51 proven. 72 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked.
[2024-11-07 04:21:49,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:21:49,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872983884]
[2024-11-07 04:21:49,938 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-11-07 04:21:49,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684970715]
[2024-11-07 04:21:49,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684970715] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 04:21:49,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 04:21:49,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 12] total 32
[2024-11-07 04:21:49,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869187318]
[2024-11-07 04:21:49,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 04:21:49,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2024-11-07 04:21:49,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:21:49,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2024-11-07 04:21:49,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=689, Unknown=0, NotChecked=0, Total=992
[2024-11-07 04:21:49,945 INFO L87 Difference]: Start difference. First operand 96 states and 141 transitions. Second operand has 32 states, 32 states have (on average 2.65625) internal successors, (85), 30 states have internal predecessors, (85), 10 states have call successors, (39), 7 states have call predecessors, (39), 12 states have return successors, (41), 10 states have call predecessors, (41), 10 states have call successors, (41)
[2024-11-07 04:21:58,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:21:58,973 INFO L93 Difference]: Finished difference Result 446 states and 572 transitions.
[2024-11-07 04:21:58,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states.
[2024-11-07 04:21:58,975 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.65625) internal successors, (85), 30 states have internal predecessors, (85), 10 states have call successors, (39), 7 states have call predecessors, (39), 12 states have return successors, (41), 10 states have call predecessors, (41), 10 states have call successors, (41) Word has length 142
[2024-11-07 04:21:58,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:21:58,981 INFO L225 Difference]: With dead ends: 446
[2024-11-07 04:21:58,983 INFO L226 Difference]: Without dead ends: 360
[2024-11-07 04:21:58,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 257 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4373 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=2770, Invalid=9440, Unknown=0, NotChecked=0, Total=12210
[2024-11-07 04:21:58,997 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 375 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2024-11-07 04:21:58,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 790 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2024-11-07 04:21:58,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states.
[2024-11-07 04:21:59,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 129.
[2024-11-07 04:21:59,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 22 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22)
[2024-11-07 04:21:59,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 171 transitions.
[2024-11-07 04:21:59,032 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 171 transitions. Word has length 142
[2024-11-07 04:21:59,033 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:21:59,033 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 171 transitions.
[2024-11-07 04:21:59,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.65625) internal successors, (85), 30 states have internal predecessors, (85), 10 states have call successors, (39), 7 states have call predecessors, (39), 12 states have return successors, (41), 10 states have call predecessors, (41), 10 states have call successors, (41)
[2024-11-07 04:21:59,033 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 171 transitions.
[2024-11-07 04:21:59,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144
[2024-11-07 04:21:59,037 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:21:59,037 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:21:59,053 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 04:21:59,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 04:21:59,238 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:21:59,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:21:59,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1235516935, now seen corresponding path program 1 times
[2024-11-07 04:21:59,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:21:59,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693882660]
[2024-11-07 04:21:59,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:21:59,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:21:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:22:12,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:22:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:22:12,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:22:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:22:12,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:22:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:22:12,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:22:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:22:12,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:22:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:22:12,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:22:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:22:12,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:22:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:22:12,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:22:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:22:12,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:22:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:22:12,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:22:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:22:12,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 04:22:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:22:12,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 04:22:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:22:12,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 04:22:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:22:12,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 04:22:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:22:12,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 04:22:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:22:12,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-07 04:22:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:22:12,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 04:22:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:22:12,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 04:22:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:22:12,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 04:22:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:22:12,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 04:22:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:22:12,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115
[2024-11-07 04:22:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:22:12,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 04:22:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:22:12,901 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2024-11-07 04:22:12,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:22:12,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693882660]
[2024-11-07 04:22:12,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693882660] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:22:12,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:22:12,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-07 04:22:12,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372476097]
[2024-11-07 04:22:12,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:22:12,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-07 04:22:12,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:22:12,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-07 04:22:12,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56
[2024-11-07 04:22:12,905 INFO L87 Difference]: Start difference. First operand 129 states and 171 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2024-11-07 04:22:14,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:22:14,964 INFO L93 Difference]: Finished difference Result 352 states and 470 transitions.
[2024-11-07 04:22:14,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-07 04:22:14,965 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143
[2024-11-07 04:22:14,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:22:14,967 INFO L225 Difference]: With dead ends: 352
[2024-11-07 04:22:14,967 INFO L226 Difference]: Without dead ends: 226
[2024-11-07 04:22:14,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72
[2024-11-07 04:22:14,969 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 235 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2024-11-07 04:22:14,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 352 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2024-11-07 04:22:14,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states.
[2024-11-07 04:22:14,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 131.
[2024-11-07 04:22:14,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 22 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22)
[2024-11-07 04:22:14,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 173 transitions.
[2024-11-07 04:22:14,995 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 173 transitions. Word has length 143
[2024-11-07 04:22:14,996 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:22:14,996 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 173 transitions.
[2024-11-07 04:22:14,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2024-11-07 04:22:14,996 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 173 transitions.
[2024-11-07 04:22:14,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144
[2024-11-07 04:22:14,998 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:22:14,998 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:22:14,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-07 04:22:14,998 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:22:14,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:22:14,999 INFO L85 PathProgramCache]: Analyzing trace with hash 648710921, now seen corresponding path program 1 times
[2024-11-07 04:22:14,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:22:14,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579942525]
[2024-11-07 04:22:14,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:22:14,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:22:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-07 04:22:15,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1106131759]
[2024-11-07 04:22:15,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:22:15,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 04:22:15,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 04:22:15,062 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 04:22:15,064 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 04:22:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 04:22:15,203 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 04:22:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 04:22:15,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 04:22:15,349 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 04:22:15,350 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-07 04:22:15,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-07 04:22:15,552 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 04:22:15,555 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2024-11-07 04:22:15,656 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 04:22:15,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:22:15 BoogieIcfgContainer
[2024-11-07 04:22:15,661 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 04:22:15,662 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 04:22:15,662 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 04:22:15,662 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 04:22:15,663 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:21:30" (3/4) ...
[2024-11-07 04:22:15,665 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-07 04:22:15,666 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 04:22:15,666 INFO L158 Benchmark]: Toolchain (without parser) took 46573.28ms. Allocated memory was 109.1MB in the beginning and 411.0MB in the end (delta: 302.0MB). Free memory was 84.9MB in the beginning and 351.7MB in the end (delta: -266.8MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB.
[2024-11-07 04:22:15,668 INFO L158 Benchmark]: CDTParser took 0.77ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 04:22:15,668 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.73ms. Allocated memory is still 109.1MB. Free memory was 84.7MB in the beginning and 70.4MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 04:22:15,668 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.84ms. Allocated memory is still 109.1MB. Free memory was 70.4MB in the beginning and 65.6MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 04:22:15,668 INFO L158 Benchmark]: Boogie Preprocessor took 81.10ms. Allocated memory is still 109.1MB. Free memory was 65.6MB in the beginning and 59.9MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 04:22:15,668 INFO L158 Benchmark]: RCFGBuilder took 562.67ms. Allocated memory is still 109.1MB. Free memory was 59.9MB in the beginning and 79.2MB in the end (delta: -19.3MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB.
[2024-11-07 04:22:15,669 INFO L158 Benchmark]: TraceAbstraction took 45549.27ms. Allocated memory was 109.1MB in the beginning and 411.0MB in the end (delta: 302.0MB). Free memory was 78.7MB in the beginning and 351.8MB in the end (delta: -273.1MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB.
[2024-11-07 04:22:15,669 INFO L158 Benchmark]: Witness Printer took 3.86ms. Allocated memory is still 411.0MB. Free memory was 351.8MB in the beginning and 351.7MB in the end (delta: 105.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 04:22:15,671 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.77ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 296.73ms. Allocated memory is still 109.1MB. Free memory was 84.7MB in the beginning and 70.4MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 71.84ms. Allocated memory is still 109.1MB. Free memory was 70.4MB in the beginning and 65.6MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 81.10ms. Allocated memory is still 109.1MB. Free memory was 65.6MB in the beginning and 59.9MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* RCFGBuilder took 562.67ms. Allocated memory is still 109.1MB. Free memory was 59.9MB in the beginning and 79.2MB in the end (delta: -19.3MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB.
* TraceAbstraction took 45549.27ms. Allocated memory was 109.1MB in the beginning and 411.0MB in the end (delta: 302.0MB). Free memory was 78.7MB in the beginning and 351.8MB in the end (delta: -273.1MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB.
* Witness Printer took 3.86ms. Allocated memory is still 411.0MB. Free memory was 351.8MB in the beginning and 351.7MB in the end (delta: 105.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of someBinaryDOUBLEComparisonOperation at line 128.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] unsigned char var_1_1 = 16;
[L23] unsigned char var_1_2 = 1;
[L24] unsigned char var_1_3 = 0;
[L25] unsigned char var_1_4 = 128;
[L26] unsigned char var_1_5 = 10;
[L27] unsigned short int var_1_6 = 10;
[L28] unsigned short int var_1_7 = 52077;
[L29] unsigned short int var_1_8 = 47248;
[L30] unsigned short int var_1_9 = 50;
[L31] float var_1_10 = 999.2;
[L32] float var_1_11 = 63.75;
[L33] signed long int var_1_12 = 100000;
[L34] unsigned short int var_1_13 = 8;
[L35] signed long int var_1_14 = 2;
[L36] signed long int var_1_15 = 32;
[L37] unsigned short int var_1_16 = 64;
[L38] double var_1_17 = 127.5;
[L39] double var_1_18 = 32.75;
[L40] signed char var_1_19 = 0;
[L41] unsigned long int var_1_20 = 128;
VAL [isInitial=0, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50]
[L132] isInitial = 1
[L133] FCALL initially()
[L134] COND TRUE 1
[L135] FCALL updateLastVariables()
[L136] CALL updateVariables()
[L90] var_1_2 = __VERIFIER_nondet_uchar()
[L91] CALL assume_abort_if_not(var_1_2 >= 0)
VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50]
[L91] RET assume_abort_if_not(var_1_2 >= 0)
VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50]
[L92] CALL assume_abort_if_not(var_1_2 <= 1)
VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50]
[L92] RET assume_abort_if_not(var_1_2 <= 1)
VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50]
[L93] var_1_3 = __VERIFIER_nondet_uchar()
[L94] CALL assume_abort_if_not(var_1_3 >= 0)
VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50]
[L94] RET assume_abort_if_not(var_1_3 >= 0)
VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50]
[L95] CALL assume_abort_if_not(var_1_3 <= 1)
VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50]
[L95] RET assume_abort_if_not(var_1_3 <= 1)
VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50]
[L96] var_1_4 = __VERIFIER_nondet_uchar()
[L97] CALL assume_abort_if_not(var_1_4 >= 127)
VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50]
[L97] RET assume_abort_if_not(var_1_4 >= 127)
VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50]
[L98] CALL assume_abort_if_not(var_1_4 <= 254)
VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50]
[L98] RET assume_abort_if_not(var_1_4 <= 254)
VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50]
[L99] var_1_5 = __VERIFIER_nondet_uchar()
[L100] CALL assume_abort_if_not(var_1_5 >= 0)
VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50]
[L100] RET assume_abort_if_not(var_1_5 >= 0)
VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50]
[L101] CALL assume_abort_if_not(var_1_5 <= 127)
VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50]
[L101] RET assume_abort_if_not(var_1_5 <= 127)
VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50]
[L102] var_1_7 = __VERIFIER_nondet_ushort()
[L103] CALL assume_abort_if_not(var_1_7 >= 32767)
VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50]
[L103] RET assume_abort_if_not(var_1_7 >= 32767)
VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50]
[L104] CALL assume_abort_if_not(var_1_7 <= 65534)
VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50]
[L104] RET assume_abort_if_not(var_1_7 <= 65534)
VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50]
[L105] var_1_8 = __VERIFIER_nondet_ushort()
[L106] CALL assume_abort_if_not(var_1_8 >= 32767)
VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L106] RET assume_abort_if_not(var_1_8 >= 32767)
VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L107] CALL assume_abort_if_not(var_1_8 <= 65534)
VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L107] RET assume_abort_if_not(var_1_8 <= 65534)
VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L108] var_1_10 = __VERIFIER_nondet_float()
[L109] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L109] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F ))
VAL [isInitial=1, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L110] var_1_11 = __VERIFIER_nondet_float()
[L111] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L111] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F ))
VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L112] CALL assume_abort_if_not(var_1_11 != 0.0F)
VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L112] RET assume_abort_if_not(var_1_11 != 0.0F)
VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L113] var_1_14 = __VERIFIER_nondet_long()
[L114] CALL assume_abort_if_not(var_1_14 >= 0)
VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L114] RET assume_abort_if_not(var_1_14 >= 0)
VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L115] CALL assume_abort_if_not(var_1_14 <= 32)
VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L115] RET assume_abort_if_not(var_1_14 <= 32)
VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L116] var_1_15 = __VERIFIER_nondet_long()
[L117] CALL assume_abort_if_not(var_1_15 >= 0)
VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L117] RET assume_abort_if_not(var_1_15 >= 0)
VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L118] CALL assume_abort_if_not(var_1_15 <= 32)
VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L118] RET assume_abort_if_not(var_1_15 <= 32)
VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L119] var_1_16 = __VERIFIER_nondet_ushort()
[L120] CALL assume_abort_if_not(var_1_16 >= 0)
VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L120] RET assume_abort_if_not(var_1_16 >= 0)
VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L121] CALL assume_abort_if_not(var_1_16 <= 65534)
VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L121] RET assume_abort_if_not(var_1_16 <= 65534)
VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L122] var_1_18 = __VERIFIER_nondet_double()
[L123] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L123] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F ))
VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L136] RET updateVariables()
[L137] CALL step()
[L45] unsigned char stepLocal_0 = var_1_3;
VAL [isInitial=1, stepLocal_0=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L46] COND TRUE var_1_2 && stepLocal_0
[L47] var_1_1 = (var_1_4 - var_1_5)
VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L51] COND FALSE !(var_1_1 <= (var_1_5 * var_1_4))
[L58] var_1_6 = var_1_5
VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L60] COND FALSE !(-100000 >= var_1_1)
VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L63] COND FALSE !((var_1_10 / var_1_11) == 999999.6f)
VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L67] COND TRUE var_1_6 < var_1_1
VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L68] COND FALSE !(var_1_5 == (~ (var_1_6 + var_1_1)))
[L71] var_1_12 = ((((var_1_1) < (var_1_8)) ? (var_1_1) : (var_1_8)))
VAL [isInitial=1, var_1_12=254, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L76] EXPR -4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))
VAL [isInitial=1, var_1_12=254, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L76] EXPR var_1_7 | ((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6)))
VAL [isInitial=1, var_1_12=254, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L76] COND FALSE !((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6)))))
[L83] var_1_13 = var_1_16
VAL [isInitial=1, var_1_12=254, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L85] var_1_17 = var_1_18
[L86] var_1_19 = 5
[L87] var_1_20 = var_1_15
VAL [isInitial=1, var_1_12=254, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L137] RET step()
[L138] CALL, EXPR property()
[L128] EXPR (((((var_1_2 && var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (var_1_4 - var_1_5)))) && ((var_1_1 <= (var_1_5 * var_1_4)) ? (var_1_2 ? (var_1_6 == ((unsigned short int) (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5)))) && ((-100000 >= var_1_1) ? (var_1_9 == ((unsigned short int) (((((var_1_1 + var_1_5)) > (64)) ? ((var_1_1 + var_1_5)) : (64))))) : (((var_1_10 / var_1_11) == 999999.6f) ? (var_1_9 == ((unsigned short int) var_1_7)) : 1))) && ((var_1_6 < var_1_1) ? ((var_1_5 == (~ (var_1_6 + var_1_1))) ? (var_1_12 == ((signed long int) (((((var_1_5) > (((((-1) < (var_1_6)) ? (-1) : (var_1_6))))) ? (var_1_5) : (((((-1) < (var_1_6)) ? (-1) : (var_1_6)))))) - 1000))) : (var_1_12 == ((signed long int) ((((var_1_1) < (var_1_8)) ? (var_1_1) : (var_1_8)))))) : (var_1_12 == ((signed long int) var_1_9)))) && (((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6))))) ? (var_1_3 ? (var_1_13 == ((unsigned short int) var_1_1)) : (var_1_13 == ((unsigned short int) var_1_4))) : (var_1_13 == ((unsigned short int) var_1_16)))
VAL [isInitial=1, var_1_12=254, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L128-L129] return ((((((((var_1_2 && var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (var_1_4 - var_1_5)))) && ((var_1_1 <= (var_1_5 * var_1_4)) ? (var_1_2 ? (var_1_6 == ((unsigned short int) (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5)))) && ((-100000 >= var_1_1) ? (var_1_9 == ((unsigned short int) (((((var_1_1 + var_1_5)) > (64)) ? ((var_1_1 + var_1_5)) : (64))))) : (((var_1_10 / var_1_11) == 999999.6f) ? (var_1_9 == ((unsigned short int) var_1_7)) : 1))) && ((var_1_6 < var_1_1) ? ((var_1_5 == (~ (var_1_6 + var_1_1))) ? (var_1_12 == ((signed long int) (((((var_1_5) > (((((-1) < (var_1_6)) ? (-1) : (var_1_6))))) ? (var_1_5) : (((((-1) < (var_1_6)) ? (-1) : (var_1_6)))))) - 1000))) : (var_1_12 == ((signed long int) ((((var_1_1) < (var_1_8)) ? (var_1_1) : (var_1_8)))))) : (var_1_12 == ((signed long int) var_1_9)))) && (((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6))))) ? (var_1_3 ? (var_1_13 == ((unsigned short int) var_1_1)) : (var_1_13 == ((unsigned short int) var_1_4))) : (var_1_13 == ((unsigned short int) var_1_16)))) && (var_1_17 == ((double) var_1_18))) && (var_1_19 == ((signed char) 5))) && (var_1_20 == ((unsigned long int) var_1_15))
;
[L138] RET, EXPR property()
[L138] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, var_1_12=254, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50]
[L19] reach_error()
VAL [isInitial=1, var_1_12=254, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.4s, OverallIterations: 5, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 824 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 820 mSDsluCounter, 1621 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1185 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1681 IncrementalHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 436 mSDtfsCounter, 1681 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 544 GetRequests, 421 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4380 ImplicationChecksByTransitivity, 12.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=4, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 392 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 29.8s InterpolantComputationTime, 996 NumberOfCodeBlocks, 996 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 705 ConstructedInterpolants, 0 QuantifiedInterpolants, 8090 SizeOfPredicates, 7 NumberOfNonLiveVariables, 324 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 4302/4620 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 04:22:15,770 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_codestructure_steplocals_file-46.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 7524697c66e1a4ecd762521f8a604e650820f18fffb82d104752941738ae4cd5
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 04:22:17,935 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 04:22:18,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 04:22:18,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 04:22:18,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 04:22:18,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 04:22:18,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 04:22:18,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 04:22:18,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 04:22:18,065 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 04:22:18,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 04:22:18,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 04:22:18,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 04:22:18,066 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 04:22:18,067 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 04:22:18,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 04:22:18,067 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 04:22:18,068 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 04:22:18,068 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 04:22:18,069 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 04:22:18,069 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 04:22:18,069 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 04:22:18,069 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 04:22:18,069 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 04:22:18,069 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-07 04:22:18,069 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 04:22:18,069 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-07 04:22:18,069 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 04:22:18,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 04:22:18,069 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 04:22:18,070 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 04:22:18,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 04:22:18,070 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 04:22:18,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 04:22:18,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 04:22:18,070 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 04:22:18,070 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 04:22:18,070 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 04:22:18,070 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-11-07 04:22:18,070 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-07 04:22:18,070 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 04:22:18,070 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 04:22:18,070 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 04:22:18,070 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 04:22:18,070 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 -> 7524697c66e1a4ecd762521f8a604e650820f18fffb82d104752941738ae4cd5
[2024-11-07 04:22:18,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 04:22:18,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 04:22:18,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 04:22:18,352 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 04:22:18,352 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 04:22:18,356 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-46.i
[2024-11-07 04:22:19,718 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 04:22:19,965 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 04:22:19,965 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-46.i
[2024-11-07 04:22:19,979 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/870794ee4/103d9d25025c44a0b3a882eecb072ddf/FLAG74ba91fb4
[2024-11-07 04:22:19,999 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/870794ee4/103d9d25025c44a0b3a882eecb072ddf
[2024-11-07 04:22:20,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 04:22:20,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 04:22:20,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 04:22:20,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 04:22:20,016 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 04:22:20,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:22:20" (1/1) ...
[2024-11-07 04:22:20,018 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@932dd5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:22:20, skipping insertion in model container
[2024-11-07 04:22:20,018 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:22:20" (1/1) ...
[2024-11-07 04:22:20,041 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 04:22:20,183 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_codestructure_steplocals_file-46.i[917,930]
[2024-11-07 04:22:20,261 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 04:22:20,281 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 04:22:20,297 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-46.i[917,930]
[2024-11-07 04:22:20,334 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 04:22:20,352 INFO L204 MainTranslator]: Completed translation
[2024-11-07 04:22:20,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:22:20 WrapperNode
[2024-11-07 04:22:20,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 04:22:20,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 04:22:20,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 04:22:20,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 04:22:20,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:22:20" (1/1) ...
[2024-11-07 04:22:20,378 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:22:20" (1/1) ...
[2024-11-07 04:22:20,407 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138
[2024-11-07 04:22:20,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 04:22:20,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 04:22:20,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 04:22:20,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 04:22:20,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:22:20" (1/1) ...
[2024-11-07 04:22:20,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:22:20" (1/1) ...
[2024-11-07 04:22:20,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:22:20" (1/1) ...
[2024-11-07 04:22:20,453 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 04:22:20,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:22:20" (1/1) ...
[2024-11-07 04:22:20,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:22:20" (1/1) ...
[2024-11-07 04:22:20,474 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:22:20" (1/1) ...
[2024-11-07 04:22:20,481 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:22:20" (1/1) ...
[2024-11-07 04:22:20,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:22:20" (1/1) ...
[2024-11-07 04:22:20,489 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:22:20" (1/1) ...
[2024-11-07 04:22:20,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 04:22:20,493 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 04:22:20,493 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 04:22:20,493 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 04:22:20,494 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:22:20" (1/1) ...
[2024-11-07 04:22:20,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 04:22:20,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 04:22:20,531 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 04:22:20,533 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 04:22:20,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 04:22:20,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-07 04:22:20,556 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 04:22:20,556 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 04:22:20,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 04:22:20,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 04:22:20,641 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 04:22:20,642 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 04:22:22,287 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live.
[2024-11-07 04:22:22,287 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 04:22:22,299 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 04:22:22,300 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 04:22:22,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:22:22 BoogieIcfgContainer
[2024-11-07 04:22:22,300 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 04:22:22,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 04:22:22,303 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 04:22:22,308 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 04:22:22,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:22:20" (1/3) ...
[2024-11-07 04:22:22,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a1e9bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:22:22, skipping insertion in model container
[2024-11-07 04:22:22,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:22:20" (2/3) ...
[2024-11-07 04:22:22,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a1e9bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:22:22, skipping insertion in model container
[2024-11-07 04:22:22,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:22:22" (3/3) ...
[2024-11-07 04:22:22,311 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-46.i
[2024-11-07 04:22:22,338 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 04:22:22,338 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 04:22:22,390 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 04:22:22,400 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;@1c794133, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 04:22:22,400 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 04:22:22,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22)
[2024-11-07 04:22:22,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2024-11-07 04:22:22,415 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:22:22,416 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:22:22,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:22:22,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:22:22,420 INFO L85 PathProgramCache]: Analyzing trace with hash -250232366, now seen corresponding path program 1 times
[2024-11-07 04:22:22,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 04:22:22,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [248416461]
[2024-11-07 04:22:22,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:22:22,433 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 04:22:22,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 04:22:22,440 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 04:22:22,442 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 04:22:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:22:22,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-07 04:22:22,785 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 04:22:22,833 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked.
[2024-11-07 04:22:22,834 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 04:22:22,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 04:22:22,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [248416461]
[2024-11-07 04:22:22,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [248416461] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:22:22,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:22:22,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 04:22:22,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559909880]
[2024-11-07 04:22:22,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:22:22,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 04:22:22,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 04:22:22,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 04:22:22,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 04:22:22,859 INFO L87 Difference]: Start difference. First operand has 63 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22)
[2024-11-07 04:22:22,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:22:22,885 INFO L93 Difference]: Finished difference Result 118 states and 206 transitions.
[2024-11-07 04:22:22,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 04:22:22,887 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 137
[2024-11-07 04:22:22,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:22:22,893 INFO L225 Difference]: With dead ends: 118
[2024-11-07 04:22:22,893 INFO L226 Difference]: Without dead ends: 58
[2024-11-07 04:22:22,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 136 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 04:22:22,900 INFO L432 NwaCegarLoop]: 84 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, 84 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 04:22:22,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 04:22:22,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states.
[2024-11-07 04:22:22,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58.
[2024-11-07 04:22:22,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22)
[2024-11-07 04:22:22,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions.
[2024-11-07 04:22:22,950 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 137
[2024-11-07 04:22:22,951 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:22:22,951 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions.
[2024-11-07 04:22:22,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22)
[2024-11-07 04:22:22,951 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions.
[2024-11-07 04:22:22,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139
[2024-11-07 04:22:22,954 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:22:22,954 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:22:22,966 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 04:22:23,154 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 04:22:23,155 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:22:23,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:22:23,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1348772776, now seen corresponding path program 1 times
[2024-11-07 04:22:23,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 04:22:23,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483509184]
[2024-11-07 04:22:23,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:22:23,158 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 04:22:23,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 04:22:23,160 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 04:22:23,162 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 04:22:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:22:23,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 20 conjuncts are in the unsatisfiable core
[2024-11-07 04:22:23,509 INFO L278 TraceCheckSpWp]: Computing forward predicates...