./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-59.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_loopvsstraightlinecode_25-1loop_file-59.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', '5bdbe64eb8d422d2ea5717bc71f96affad4a8cac372591c2430b21f42f6849ce']
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-59.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 5bdbe64eb8d422d2ea5717bc71f96affad4a8cac372591c2430b21f42f6849ce
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 08:22:27,216 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 08:22:27,298 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-07 08:22:27,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 08:22:27,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 08:22:27,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 08:22:27,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 08:22:27,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 08:22:27,334 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 08:22:27,334 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 08:22:27,335 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 08:22:27,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 08:22:27,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 08:22:27,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 08:22:27,335 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 08:22:27,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 08:22:27,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 08:22:27,337 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 08:22:27,337 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 08:22:27,337 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 08:22:27,337 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 08:22:27,337 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 08:22:27,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 08:22:27,337 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 08:22:27,337 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 08:22:27,337 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 08:22:27,337 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 08:22:27,337 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 08:22:27,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 08:22:27,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 08:22:27,338 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 08:22:27,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 08:22:27,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:22:27,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 08:22:27,338 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 08:22:27,338 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 08:22:27,338 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 08:22:27,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 08:22:27,339 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 08:22:27,339 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 08:22:27,339 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 08:22:27,339 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 08:22:27,339 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 -> 5bdbe64eb8d422d2ea5717bc71f96affad4a8cac372591c2430b21f42f6849ce
[2024-11-07 08:22:27,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 08:22:27,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 08:22:27,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 08:22:27,649 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 08:22:27,649 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 08:22:27,650 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-59.i
[2024-11-07 08:22:28,941 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 08:22:29,165 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 08:22:29,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-59.i
[2024-11-07 08:22:29,172 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7dcf1bde/2f1e82c2a34d454b8894a045dfa766cb/FLAGa3ec67ee3
[2024-11-07 08:22:29,190 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7dcf1bde/2f1e82c2a34d454b8894a045dfa766cb
[2024-11-07 08:22:29,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 08:22:29,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 08:22:29,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 08:22:29,198 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 08:22:29,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 08:22:29,203 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:22:29" (1/1) ...
[2024-11-07 08:22:29,205 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@627bae2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:29, skipping insertion in model container
[2024-11-07 08:22:29,205 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:22:29" (1/1) ...
[2024-11-07 08:22:29,224 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 08:22:29,363 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-59.i[915,928]
[2024-11-07 08:22:29,428 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:22:29,445 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 08:22:29,455 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-59.i[915,928]
[2024-11-07 08:22:29,489 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:22:29,507 INFO L204 MainTranslator]: Completed translation
[2024-11-07 08:22:29,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:29 WrapperNode
[2024-11-07 08:22:29,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 08:22:29,509 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 08:22:29,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 08:22:29,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 08:22:29,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:29" (1/1) ...
[2024-11-07 08:22:29,529 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:29" (1/1) ...
[2024-11-07 08:22:29,560 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140
[2024-11-07 08:22:29,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 08:22:29,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 08:22:29,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 08:22:29,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 08:22:29,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:29" (1/1) ...
[2024-11-07 08:22:29,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:29" (1/1) ...
[2024-11-07 08:22:29,574 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:29" (1/1) ...
[2024-11-07 08:22:29,597 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 08:22:29,597 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:29" (1/1) ...
[2024-11-07 08:22:29,597 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:29" (1/1) ...
[2024-11-07 08:22:29,606 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:29" (1/1) ...
[2024-11-07 08:22:29,614 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:29" (1/1) ...
[2024-11-07 08:22:29,618 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:29" (1/1) ...
[2024-11-07 08:22:29,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:29" (1/1) ...
[2024-11-07 08:22:29,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 08:22:29,625 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 08:22:29,625 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 08:22:29,625 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 08:22:29,627 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:29" (1/1) ...
[2024-11-07 08:22:29,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:22:29,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:22:29,666 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 08:22:29,672 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 08:22:29,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 08:22:29,693 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 08:22:29,694 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 08:22:29,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 08:22:29,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 08:22:29,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 08:22:29,790 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 08:22:29,792 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 08:22:30,077 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live.
[2024-11-07 08:22:30,080 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 08:22:30,091 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 08:22:30,093 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 08:22:30,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:22:30 BoogieIcfgContainer
[2024-11-07 08:22:30,094 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 08:22:30,096 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 08:22:30,097 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 08:22:30,103 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 08:22:30,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:22:29" (1/3) ...
[2024-11-07 08:22:30,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71017bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:22:30, skipping insertion in model container
[2024-11-07 08:22:30,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:29" (2/3) ...
[2024-11-07 08:22:30,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71017bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:22:30, skipping insertion in model container
[2024-11-07 08:22:30,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:22:30" (3/3) ...
[2024-11-07 08:22:30,107 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-59.i
[2024-11-07 08:22:30,122 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 08:22:30,123 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 08:22:30,194 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 08:22:30,209 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;@4380adb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 08:22:30,209 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 08:22:30,214 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 38 states have internal predecessors, (47), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21)
[2024-11-07 08:22:30,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133
[2024-11-07 08:22:30,241 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:22:30,242 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:22:30,243 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:22:30,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:22:30,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1628904136, now seen corresponding path program 1 times
[2024-11-07 08:22:30,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:22:30,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773479849]
[2024-11-07 08:22:30,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:22:30,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:22:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:30,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:22:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:30,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:22:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:30,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 08:22:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:30,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 08:22:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:30,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 08:22:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:30,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 08:22:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:30,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 08:22:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:30,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 08:22:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:30,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 08:22:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:30,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 08:22:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:30,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 08:22:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:30,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 08:22:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:30,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 08:22:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:30,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-07 08:22:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:30,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 08:22:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:30,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-07 08:22:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:30,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94
[2024-11-07 08:22:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:30,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100
[2024-11-07 08:22:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:30,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106
[2024-11-07 08:22:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:30,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112
[2024-11-07 08:22:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:30,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118
[2024-11-07 08:22:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:30,618 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked.
[2024-11-07 08:22:30,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:22:30,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773479849]
[2024-11-07 08:22:30,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773479849] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:22:30,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:22:30,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 08:22:30,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501648128]
[2024-11-07 08:22:30,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:22:30,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 08:22:30,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:22:30,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 08:22:30,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 08:22:30,649 INFO L87 Difference]: Start difference. First operand has 61 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 38 states have internal predecessors, (47), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21)
[2024-11-07 08:22:30,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:22:30,679 INFO L93 Difference]: Finished difference Result 119 states and 196 transitions.
[2024-11-07 08:22:30,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 08:22:30,682 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 132
[2024-11-07 08:22:30,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:22:30,691 INFO L225 Difference]: With dead ends: 119
[2024-11-07 08:22:30,691 INFO L226 Difference]: Without dead ends: 57
[2024-11-07 08:22:30,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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 08:22:30,698 INFO L432 NwaCegarLoop]: 85 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, 85 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 08:22:30,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 08:22:30,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states.
[2024-11-07 08:22:30,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57.
[2024-11-07 08:22:30,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21)
[2024-11-07 08:22:30,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 81 transitions.
[2024-11-07 08:22:30,747 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 81 transitions. Word has length 132
[2024-11-07 08:22:30,747 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:22:30,747 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 81 transitions.
[2024-11-07 08:22:30,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21)
[2024-11-07 08:22:30,748 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 81 transitions.
[2024-11-07 08:22:30,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133
[2024-11-07 08:22:30,751 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:22:30,751 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:22:30,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 08:22:30,752 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:22:30,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:22:30,753 INFO L85 PathProgramCache]: Analyzing trace with hash -997229510, now seen corresponding path program 1 times
[2024-11-07 08:22:30,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:22:30,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801799617]
[2024-11-07 08:22:30,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:22:30,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:22:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:31,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:22:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:31,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:22:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:31,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 08:22:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:31,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 08:22:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:31,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 08:22:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:31,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 08:22:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:31,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 08:22:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:31,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 08:22:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:31,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 08:22:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:31,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 08:22:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:31,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 08:22:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:31,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 08:22:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:31,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 08:22:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:31,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-07 08:22:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:31,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 08:22:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:31,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-07 08:22:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:31,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94
[2024-11-07 08:22:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:31,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100
[2024-11-07 08:22:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:31,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106
[2024-11-07 08:22:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:31,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112
[2024-11-07 08:22:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:31,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118
[2024-11-07 08:22:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:31,226 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked.
[2024-11-07 08:22:31,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:22:31,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801799617]
[2024-11-07 08:22:31,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801799617] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:22:31,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:22:31,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 08:22:31,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239704398]
[2024-11-07 08:22:31,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:22:31,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 08:22:31,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:22:31,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 08:22:31,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 08:22:31,233 INFO L87 Difference]: Start difference. First operand 57 states and 81 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21)
[2024-11-07 08:22:31,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:22:31,274 INFO L93 Difference]: Finished difference Result 111 states and 159 transitions.
[2024-11-07 08:22:31,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 08:22:31,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132
[2024-11-07 08:22:31,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:22:31,276 INFO L225 Difference]: With dead ends: 111
[2024-11-07 08:22:31,276 INFO L226 Difference]: Without dead ends: 57
[2024-11-07 08:22:31,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 08:22:31,278 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 08:22:31,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 08:22:31,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states.
[2024-11-07 08:22:31,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57.
[2024-11-07 08:22:31,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21)
[2024-11-07 08:22:31,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions.
[2024-11-07 08:22:31,293 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 132
[2024-11-07 08:22:31,294 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:22:31,295 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions.
[2024-11-07 08:22:31,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21)
[2024-11-07 08:22:31,296 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions.
[2024-11-07 08:22:31,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2024-11-07 08:22:31,298 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:22:31,299 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:22:31,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 08:22:31,299 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:22:31,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:22:31,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1084904031, now seen corresponding path program 1 times
[2024-11-07 08:22:31,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:22:31,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847651570]
[2024-11-07 08:22:31,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:22:31,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:22:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 08:22:31,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 08:22:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 08:22:31,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 08:22:31,578 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 08:22:31,579 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-07 08:22:31,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 08:22:31,584 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2024-11-07 08:22:31,683 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 08:22:31,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:22:31 BoogieIcfgContainer
[2024-11-07 08:22:31,690 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 08:22:31,690 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 08:22:31,693 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 08:22:31,693 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 08:22:31,694 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:22:30" (3/4) ...
[2024-11-07 08:22:31,696 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-07 08:22:31,697 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 08:22:31,698 INFO L158 Benchmark]: Toolchain (without parser) took 2502.44ms. Allocated memory is still 100.7MB. Free memory was 76.1MB in the beginning and 54.8MB in the end (delta: 21.3MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB.
[2024-11-07 08:22:31,698 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:22:31,699 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.11ms. Allocated memory is still 100.7MB. Free memory was 75.9MB in the beginning and 62.9MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 08:22:31,699 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.64ms. Allocated memory is still 100.7MB. Free memory was 62.9MB in the beginning and 61.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:22:31,700 INFO L158 Benchmark]: Boogie Preprocessor took 61.25ms. Allocated memory is still 100.7MB. Free memory was 61.1MB in the beginning and 59.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:22:31,701 INFO L158 Benchmark]: RCFGBuilder took 469.43ms. Allocated memory is still 100.7MB. Free memory was 59.2MB in the beginning and 44.3MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 08:22:31,701 INFO L158 Benchmark]: TraceAbstraction took 1593.71ms. Allocated memory is still 100.7MB. Free memory was 43.7MB in the beginning and 55.6MB in the end (delta: -12.0MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB.
[2024-11-07 08:22:31,701 INFO L158 Benchmark]: Witness Printer took 6.68ms. Allocated memory is still 100.7MB. Free memory was 54.8MB in the beginning and 54.8MB in the end (delta: 14.7kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:22:31,703 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.26ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 311.11ms. Allocated memory is still 100.7MB. Free memory was 75.9MB in the beginning and 62.9MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 52.64ms. Allocated memory is still 100.7MB. Free memory was 62.9MB in the beginning and 61.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 61.25ms. Allocated memory is still 100.7MB. Free memory was 61.1MB in the beginning and 59.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 469.43ms. Allocated memory is still 100.7MB. Free memory was 59.2MB in the beginning and 44.3MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* TraceAbstraction took 1593.71ms. Allocated memory is still 100.7MB. Free memory was 43.7MB in the beginning and 55.6MB in the end (delta: -12.0MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB.
* Witness Printer took 6.68ms. Allocated memory is still 100.7MB. Free memory was 54.8MB in the beginning and 54.8MB in the end (delta: 14.7kB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryArithmeticFLOAToperation at line 61.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] signed long int var_1_1 = -128;
[L23] signed long int var_1_4 = -32;
[L24] signed long int var_1_5 = 10;
[L25] signed long int var_1_6 = -1;
[L26] unsigned long int var_1_7 = 25;
[L27] unsigned char var_1_8 = 1;
[L28] unsigned long int var_1_9 = 2;
[L29] unsigned long int var_1_10 = 32;
[L30] unsigned long int var_1_11 = 128;
[L31] float var_1_12 = 24.2;
[L32] double var_1_13 = 999999999999999.2;
[L33] double var_1_14 = 9999999.6;
[L34] double var_1_15 = 9.75;
[L35] float var_1_16 = 999999999999999.4;
[L36] float var_1_17 = 256.6;
[L37] float var_1_18 = 8.875;
[L38] float var_1_19 = 256.25;
[L39] signed long int last_1_var_1_1 = -128;
[L40] unsigned long int last_1_var_1_7 = 25;
VAL [isInitial=0, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-32, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2]
[L115] isInitial = 1
[L116] FCALL initially()
[L117] int k_loop;
[L118] k_loop = 0
VAL [isInitial=1, k_loop=0, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-32, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2]
[L118] COND TRUE k_loop < 1
[L119] CALL updateLastVariables()
[L107] last_1_var_1_1 = var_1_1
[L108] last_1_var_1_7 = var_1_7
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-32, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2]
[L119] RET updateLastVariables()
[L120] CALL updateVariables()
[L70] var_1_4 = __VERIFIER_nondet_long()
[L71] CALL assume_abort_if_not(var_1_4 >= -536870911)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2]
[L71] RET assume_abort_if_not(var_1_4 >= -536870911)
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2]
[L72] CALL assume_abort_if_not(var_1_4 <= 536870912)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2]
[L72] RET assume_abort_if_not(var_1_4 <= 536870912)
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2]
[L73] var_1_5 = __VERIFIER_nondet_long()
[L74] CALL assume_abort_if_not(var_1_5 >= -536870911)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2]
[L74] RET assume_abort_if_not(var_1_5 >= -536870911)
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2]
[L75] CALL assume_abort_if_not(var_1_5 <= 536870911)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2]
[L75] RET assume_abort_if_not(var_1_5 <= 536870911)
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2]
[L76] var_1_6 = __VERIFIER_nondet_long()
[L77] CALL assume_abort_if_not(var_1_6 >= -1073741823)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2]
[L77] RET assume_abort_if_not(var_1_6 >= -1073741823)
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2]
[L78] CALL assume_abort_if_not(var_1_6 <= 1073741823)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2]
[L78] RET assume_abort_if_not(var_1_6 <= 1073741823)
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2]
[L79] var_1_8 = __VERIFIER_nondet_uchar()
[L80] CALL assume_abort_if_not(var_1_8 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_9=2]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_9=2]
[L80] RET assume_abort_if_not(var_1_8 >= 0)
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_9=2]
[L81] CALL assume_abort_if_not(var_1_8 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=2]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=2]
[L81] RET assume_abort_if_not(var_1_8 <= 1)
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=2]
[L82] var_1_9 = __VERIFIER_nondet_ulong()
[L83] CALL assume_abort_if_not(var_1_9 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0]
[L83] RET assume_abort_if_not(var_1_9 >= 0)
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0]
[L84] CALL assume_abort_if_not(var_1_9 <= 4294967294)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L84] RET assume_abort_if_not(var_1_9 <= 4294967294)
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L85] var_1_10 = __VERIFIER_nondet_ulong()
[L86] CALL assume_abort_if_not(var_1_10 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L86] RET assume_abort_if_not(var_1_10 >= 0)
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L87] CALL assume_abort_if_not(var_1_10 <= 4294967294)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L87] RET assume_abort_if_not(var_1_10 <= 4294967294)
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L88] var_1_11 = __VERIFIER_nondet_ulong()
[L89] CALL assume_abort_if_not(var_1_11 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L89] RET assume_abort_if_not(var_1_11 >= 0)
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L90] CALL assume_abort_if_not(var_1_11 <= 4294967294)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L90] RET assume_abort_if_not(var_1_11 <= 4294967294)
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L91] var_1_13 = __VERIFIER_nondet_double()
[L92] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L92] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L93] var_1_14 = __VERIFIER_nondet_double()
[L94] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L94] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L95] var_1_15 = __VERIFIER_nondet_double()
[L96] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L96] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L97] var_1_16 = __VERIFIER_nondet_float()
[L98] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L98] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L99] var_1_17 = __VERIFIER_nondet_float()
[L100] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L100] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L101] var_1_18 = __VERIFIER_nondet_float()
[L102] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L102] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_19=1025/4, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L103] var_1_19 = __VERIFIER_nondet_float()
[L104] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L104] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_1=-128, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L120] RET updateVariables()
[L121] CALL step()
[L44] COND TRUE ((((last_1_var_1_7) > (1)) ? (last_1_var_1_7) : (1))) <= (256 + last_1_var_1_1)
[L45] var_1_1 = ((var_1_4 + var_1_5) + var_1_6)
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_1=0, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=0, var_1_9=4294967294]
[L49] COND FALSE !(\read(var_1_8))
[L56] var_1_7 = var_1_11
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_1=0, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=4294967294]
[L58] unsigned long int stepLocal_0 = var_1_7;
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, stepLocal_0=0, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_1=0, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=4294967294]
[L59] COND TRUE var_1_7 <= stepLocal_0
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=121/5, var_1_1=0, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=4294967294]
[L60] COND TRUE (var_1_13 - var_1_14) == var_1_15
[L61] var_1_12 = ((((var_1_16) > (((var_1_17 + var_1_18) - var_1_19))) ? (var_1_16) : (((var_1_17 + var_1_18) - var_1_19))))
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=1000000000000004, var_1_16=1000000000000004, var_1_1=0, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=4294967294]
[L121] RET step()
[L122] CALL, EXPR property()
[L111-L112] return (((((((last_1_var_1_7) > (1)) ? (last_1_var_1_7) : (1))) <= (256 + last_1_var_1_1)) ? (var_1_1 == ((signed long int) ((var_1_4 + var_1_5) + var_1_6))) : (var_1_1 == ((signed long int) var_1_6))) && (var_1_8 ? ((var_1_1 <= var_1_1) ? (var_1_7 == ((unsigned long int) ((((var_1_9) > (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))))) ? (var_1_9) : (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))))) : (var_1_7 == ((unsigned long int) var_1_10))) : (var_1_7 == ((unsigned long int) var_1_11)))) && ((var_1_7 <= var_1_7) ? (((var_1_13 - var_1_14) == var_1_15) ? (var_1_12 == ((float) ((((var_1_16) > (((var_1_17 + var_1_18) - var_1_19))) ? (var_1_16) : (((var_1_17 + var_1_18) - var_1_19)))))) : (var_1_12 == ((float) var_1_19))) : (var_1_12 == ((float) var_1_16)))
;
VAL [\result=0, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=1000000000000004, var_1_16=1000000000000004, var_1_1=0, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=4294967294]
[L122] RET, EXPR property()
[L122] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=1000000000000004, var_1_16=1000000000000004, var_1_1=0, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=4294967294]
[L19] reach_error()
VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=0, var_1_12=1000000000000004, var_1_16=1000000000000004, var_1_1=0, var_1_4=536870912, var_1_5=-536870911, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=4294967294]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 236 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 164 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 397 NumberOfCodeBlocks, 397 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 272 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1680/1680 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 08:22:31,734 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_loopvsstraightlinecode_25-1loop_file-59.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 5bdbe64eb8d422d2ea5717bc71f96affad4a8cac372591c2430b21f42f6849ce
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 08:22:33,901 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 08:22:34,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-07 08:22:34,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 08:22:34,017 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 08:22:34,047 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 08:22:34,048 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 08:22:34,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 08:22:34,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 08:22:34,049 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 08:22:34,049 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 08:22:34,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 08:22:34,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 08:22:34,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 08:22:34,050 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 08:22:34,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 08:22:34,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 08:22:34,050 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 08:22:34,051 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 08:22:34,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 08:22:34,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 08:22:34,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 08:22:34,052 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 08:22:34,052 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 08:22:34,052 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-07 08:22:34,052 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 08:22:34,052 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-07 08:22:34,052 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 08:22:34,052 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 08:22:34,053 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 08:22:34,053 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 08:22:34,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 08:22:34,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 08:22:34,053 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 08:22:34,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:22:34,053 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 08:22:34,053 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 08:22:34,053 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 08:22:34,054 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-11-07 08:22:34,054 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-07 08:22:34,054 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 08:22:34,054 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 08:22:34,054 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 08:22:34,055 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 08:22:34,055 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 -> 5bdbe64eb8d422d2ea5717bc71f96affad4a8cac372591c2430b21f42f6849ce
[2024-11-07 08:22:34,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 08:22:34,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 08:22:34,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 08:22:34,365 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 08:22:34,366 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 08:22:34,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-59.i
[2024-11-07 08:22:35,693 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 08:22:35,953 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 08:22:35,955 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-59.i
[2024-11-07 08:22:35,965 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/38c64cddc/7e6e157f104046cbb0ce383df51c6962/FLAG6942782eb
[2024-11-07 08:22:36,283 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/38c64cddc/7e6e157f104046cbb0ce383df51c6962
[2024-11-07 08:22:36,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 08:22:36,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 08:22:36,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 08:22:36,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 08:22:36,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 08:22:36,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:22:36" (1/1) ...
[2024-11-07 08:22:36,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57c7c597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:36, skipping insertion in model container
[2024-11-07 08:22:36,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:22:36" (1/1) ...
[2024-11-07 08:22:36,320 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 08:22:36,463 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-59.i[915,928]
[2024-11-07 08:22:36,532 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:22:36,551 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 08:22:36,564 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-59.i[915,928]
[2024-11-07 08:22:36,592 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:22:36,616 INFO L204 MainTranslator]: Completed translation
[2024-11-07 08:22:36,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:36 WrapperNode
[2024-11-07 08:22:36,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 08:22:36,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 08:22:36,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 08:22:36,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 08:22:36,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:36" (1/1) ...
[2024-11-07 08:22:36,639 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:36" (1/1) ...
[2024-11-07 08:22:36,665 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137
[2024-11-07 08:22:36,667 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 08:22:36,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 08:22:36,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 08:22:36,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 08:22:36,678 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:36" (1/1) ...
[2024-11-07 08:22:36,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:36" (1/1) ...
[2024-11-07 08:22:36,685 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:36" (1/1) ...
[2024-11-07 08:22:36,702 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 08:22:36,703 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:36" (1/1) ...
[2024-11-07 08:22:36,703 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:36" (1/1) ...
[2024-11-07 08:22:36,713 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:36" (1/1) ...
[2024-11-07 08:22:36,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:36" (1/1) ...
[2024-11-07 08:22:36,719 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:36" (1/1) ...
[2024-11-07 08:22:36,720 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:36" (1/1) ...
[2024-11-07 08:22:36,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 08:22:36,724 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 08:22:36,724 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 08:22:36,724 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 08:22:36,725 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:36" (1/1) ...
[2024-11-07 08:22:36,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:22:36,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:22:36,759 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 08:22:36,766 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 08:22:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 08:22:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-07 08:22:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 08:22:36,786 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 08:22:36,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 08:22:36,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 08:22:36,867 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 08:22:36,868 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 08:22:38,240 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live.
[2024-11-07 08:22:38,240 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 08:22:38,248 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 08:22:38,248 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 08:22:38,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:22:38 BoogieIcfgContainer
[2024-11-07 08:22:38,249 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 08:22:38,251 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 08:22:38,251 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 08:22:38,256 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 08:22:38,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:22:36" (1/3) ...
[2024-11-07 08:22:38,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a288ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:22:38, skipping insertion in model container
[2024-11-07 08:22:38,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:22:36" (2/3) ...
[2024-11-07 08:22:38,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a288ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:22:38, skipping insertion in model container
[2024-11-07 08:22:38,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:22:38" (3/3) ...
[2024-11-07 08:22:38,260 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-59.i
[2024-11-07 08:22:38,273 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 08:22:38,273 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 08:22:38,336 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 08:22:38,344 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;@2804cfe2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 08:22:38,344 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 08:22:38,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 38 states have internal predecessors, (47), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21)
[2024-11-07 08:22:38,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133
[2024-11-07 08:22:38,356 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:22:38,357 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:22:38,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:22:38,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:22:38,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1628904136, now seen corresponding path program 1 times
[2024-11-07 08:22:38,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:22:38,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893086597]
[2024-11-07 08:22:38,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:22:38,370 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 08:22:38,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:22:38,374 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 08:22:38,376 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 08:22:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:38,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-07 08:22:38,707 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:22:38,753 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked.
[2024-11-07 08:22:38,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 08:22:38,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 08:22:38,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893086597]
[2024-11-07 08:22:38,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893086597] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:22:38,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:22:38,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 08:22:38,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36657455]
[2024-11-07 08:22:38,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:22:38,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 08:22:38,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 08:22:38,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 08:22:38,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 08:22:38,781 INFO L87 Difference]: Start difference. First operand has 61 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 38 states have internal predecessors, (47), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21)
[2024-11-07 08:22:38,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:22:38,808 INFO L93 Difference]: Finished difference Result 119 states and 196 transitions.
[2024-11-07 08:22:38,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 08:22:38,809 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 132
[2024-11-07 08:22:38,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:22:38,815 INFO L225 Difference]: With dead ends: 119
[2024-11-07 08:22:38,816 INFO L226 Difference]: Without dead ends: 57
[2024-11-07 08:22:38,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 08:22:38,822 INFO L432 NwaCegarLoop]: 85 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, 85 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 08:22:38,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 08:22:38,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states.
[2024-11-07 08:22:38,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57.
[2024-11-07 08:22:38,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21)
[2024-11-07 08:22:38,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 81 transitions.
[2024-11-07 08:22:38,859 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 81 transitions. Word has length 132
[2024-11-07 08:22:38,859 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:22:38,859 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 81 transitions.
[2024-11-07 08:22:38,860 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21)
[2024-11-07 08:22:38,860 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 81 transitions.
[2024-11-07 08:22:38,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133
[2024-11-07 08:22:38,862 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:22:38,862 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:22:38,875 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 08:22:39,063 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 08:22:39,064 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:22:39,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:22:39,065 INFO L85 PathProgramCache]: Analyzing trace with hash -997229510, now seen corresponding path program 1 times
[2024-11-07 08:22:39,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:22:39,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [18915322]
[2024-11-07 08:22:39,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:22:39,065 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 08:22:39,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:22:39,068 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 08:22:39,069 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 08:22:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:39,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-07 08:22:39,409 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:22:39,462 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked.
[2024-11-07 08:22:39,463 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 08:22:39,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 08:22:39,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [18915322]
[2024-11-07 08:22:39,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [18915322] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:22:39,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:22:39,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 08:22:39,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106209346]
[2024-11-07 08:22:39,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:22:39,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 08:22:39,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 08:22:39,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 08:22:39,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 08:22:39,467 INFO L87 Difference]: Start difference. First operand 57 states and 81 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21)
[2024-11-07 08:22:39,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:22:39,967 INFO L93 Difference]: Finished difference Result 111 states and 159 transitions.
[2024-11-07 08:22:39,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 08:22:39,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132
[2024-11-07 08:22:39,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:22:39,982 INFO L225 Difference]: With dead ends: 111
[2024-11-07 08:22:39,982 INFO L226 Difference]: Without dead ends: 57
[2024-11-07 08:22:39,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 08:22:39,984 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-07 08:22:39,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-07 08:22:39,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states.
[2024-11-07 08:22:39,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57.
[2024-11-07 08:22:39,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21)
[2024-11-07 08:22:39,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions.
[2024-11-07 08:22:39,993 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 132
[2024-11-07 08:22:39,994 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:22:39,994 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions.
[2024-11-07 08:22:39,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21)
[2024-11-07 08:22:39,995 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions.
[2024-11-07 08:22:39,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2024-11-07 08:22:39,996 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:22:39,997 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:22:40,007 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 (3)] Ended with exit code 0
[2024-11-07 08:22:40,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 08:22:40,199 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:22:40,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:22:40,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1084904031, now seen corresponding path program 1 times
[2024-11-07 08:22:40,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:22:40,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364646673]
[2024-11-07 08:22:40,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:22:40,200 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 08:22:40,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:22:40,203 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 08:22:40,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2024-11-07 08:22:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:22:40,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 27 conjuncts are in the unsatisfiable core
[2024-11-07 08:22:40,563 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:23:24,845 WARN L286 SmtUtils]: Spent 10.49s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)