./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-45.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-45.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', '5d7e41890311b17b4172246b2c6ff0c305b3b8a9717c6f0cb798c28922acd89f']
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-45.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 5d7e41890311b17b4172246b2c6ff0c305b3b8a9717c6f0cb798c28922acd89f
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 08:20:44,867 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 08:20:44,948 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:20:44,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 08:20:44,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 08:20:44,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 08:20:44,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 08:20:44,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 08:20:44,985 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 08:20:44,985 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 08:20:44,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 08:20:44,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 08:20:44,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 08:20:44,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 08:20:44,986 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 08:20:44,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 08:20:44,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 08:20:44,986 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 08:20:44,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 08:20:44,986 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 08:20:44,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 08:20:44,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 08:20:44,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 08:20:44,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 08:20:44,987 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 08:20:44,987 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 08:20:44,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 08:20:44,987 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 08:20:44,987 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 08:20:44,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 08:20:44,987 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 08:20:44,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 08:20:44,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:20:44,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 08:20:44,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 08:20:44,988 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 08:20:44,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 08:20:44,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 08:20:44,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 08:20:44,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 08:20:44,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 08:20:44,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 08:20:44,989 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 -> 5d7e41890311b17b4172246b2c6ff0c305b3b8a9717c6f0cb798c28922acd89f
[2024-11-07 08:20:45,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 08:20:45,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 08:20:45,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 08:20:45,310 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 08:20:45,310 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 08:20:45,311 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-45.i
[2024-11-07 08:20:46,629 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 08:20:46,919 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 08:20:46,920 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-45.i
[2024-11-07 08:20:46,929 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fef00a2cb/87ef2071da814c3699c3294a53ab9355/FLAGb920a04aa
[2024-11-07 08:20:46,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fef00a2cb/87ef2071da814c3699c3294a53ab9355
[2024-11-07 08:20:46,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 08:20:46,952 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 08:20:46,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 08:20:46,957 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 08:20:46,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 08:20:46,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:20:46" (1/1) ...
[2024-11-07 08:20:46,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@873eb6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:46, skipping insertion in model container
[2024-11-07 08:20:46,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:20:46" (1/1) ...
[2024-11-07 08:20:46,983 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 08:20:47,121 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-45.i[915,928]
[2024-11-07 08:20:47,182 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:20:47,200 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 08:20:47,214 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-45.i[915,928]
[2024-11-07 08:20:47,247 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:20:47,271 INFO L204 MainTranslator]: Completed translation
[2024-11-07 08:20:47,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:47 WrapperNode
[2024-11-07 08:20:47,273 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 08:20:47,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 08:20:47,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 08:20:47,275 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 08:20:47,281 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:20:47" (1/1) ...
[2024-11-07 08:20:47,291 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:20:47" (1/1) ...
[2024-11-07 08:20:47,330 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122
[2024-11-07 08:20:47,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 08:20:47,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 08:20:47,331 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 08:20:47,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 08:20:47,340 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:47" (1/1) ...
[2024-11-07 08:20:47,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:47" (1/1) ...
[2024-11-07 08:20:47,344 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:47" (1/1) ...
[2024-11-07 08:20:47,365 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:20:47,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:47" (1/1) ...
[2024-11-07 08:20:47,369 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:47" (1/1) ...
[2024-11-07 08:20:47,378 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:47" (1/1) ...
[2024-11-07 08:20:47,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:47" (1/1) ...
[2024-11-07 08:20:47,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:47" (1/1) ...
[2024-11-07 08:20:47,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:47" (1/1) ...
[2024-11-07 08:20:47,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 08:20:47,395 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 08:20:47,395 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 08:20:47,396 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 08:20:47,397 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:47" (1/1) ...
[2024-11-07 08:20:47,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:20:47,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:20:47,433 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:20:47,438 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:20:47,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 08:20:47,460 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 08:20:47,460 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 08:20:47,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 08:20:47,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 08:20:47,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 08:20:47,550 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 08:20:47,552 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 08:20:47,830 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live.
[2024-11-07 08:20:47,831 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 08:20:47,844 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 08:20:47,844 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 08:20:47,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:20:47 BoogieIcfgContainer
[2024-11-07 08:20:47,844 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 08:20:47,849 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 08:20:47,850 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 08:20:47,854 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 08:20:47,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:20:46" (1/3) ...
[2024-11-07 08:20:47,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9ed45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:20:47, skipping insertion in model container
[2024-11-07 08:20:47,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:47" (2/3) ...
[2024-11-07 08:20:47,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9ed45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:20:47, skipping insertion in model container
[2024-11-07 08:20:47,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:20:47" (3/3) ...
[2024-11-07 08:20:47,856 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-45.i
[2024-11-07 08:20:47,869 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 08:20:47,870 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 08:20:47,933 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 08:20:47,947 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;@1edcd624, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 08:20:47,947 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 08:20:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19)
[2024-11-07 08:20:47,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2024-11-07 08:20:47,965 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:20:47,966 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:47,967 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:20:47,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:20:47,973 INFO L85 PathProgramCache]: Analyzing trace with hash 875331919, now seen corresponding path program 1 times
[2024-11-07 08:20:47,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:20:47,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730734798]
[2024-11-07 08:20:47,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:20:47,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:20:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:20:48,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:20:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:20:48,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-07 08:20:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:20:48,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-07 08:20:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:20:48,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-07 08:20:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:20:48,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-07 08:20:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:20:48,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-07 08:20:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:20:48,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-07 08:20:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:20:48,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-07 08:20:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:20:48,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-07 08:20:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:20:48,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-07 08:20:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:20:48,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-07 08:20:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:20:48,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-07 08:20:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:20:48,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72
[2024-11-07 08:20:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:20:48,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-07 08:20:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:20:48,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-07 08:20:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:20:48,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-07 08:20:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:20:48,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94
[2024-11-07 08:20:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:20:48,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100
[2024-11-07 08:20:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:20:48,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105
[2024-11-07 08:20:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:20:48,431 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked.
[2024-11-07 08:20:48,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:20:48,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730734798]
[2024-11-07 08:20:48,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730734798] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:20:48,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:20:48,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 08:20:48,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802810193]
[2024-11-07 08:20:48,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:20:48,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 08:20:48,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:20:48,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 08:20:48,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 08:20:48,461 INFO L87 Difference]: Start difference. First operand has 55 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19)
[2024-11-07 08:20:48,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:20:48,479 INFO L93 Difference]: Finished difference Result 107 states and 176 transitions.
[2024-11-07 08:20:48,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 08:20:48,482 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 119
[2024-11-07 08:20:48,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:20:48,487 INFO L225 Difference]: With dead ends: 107
[2024-11-07 08:20:48,487 INFO L226 Difference]: Without dead ends: 51
[2024-11-07 08:20:48,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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:20:48,493 INFO L432 NwaCegarLoop]: 77 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, 77 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:20:48,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 08:20:48,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2024-11-07 08:20:48,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51.
[2024-11-07 08:20:48,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19)
[2024-11-07 08:20:48,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions.
[2024-11-07 08:20:48,530 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 119
[2024-11-07 08:20:48,530 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:20:48,531 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions.
[2024-11-07 08:20:48,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19)
[2024-11-07 08:20:48,531 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions.
[2024-11-07 08:20:48,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2024-11-07 08:20:48,539 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:20:48,539 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:48,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 08:20:48,540 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:20:48,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:20:48,541 INFO L85 PathProgramCache]: Analyzing trace with hash 231010313, now seen corresponding path program 1 times
[2024-11-07 08:20:48,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:20:48,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127984251]
[2024-11-07 08:20:48,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:20:48,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:20:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:21:01,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:21:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:21:01,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-07 08:21:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:21:01,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-07 08:21:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:21:01,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-07 08:21:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:21:01,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-07 08:21:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:21:01,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-07 08:21:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:21:01,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-07 08:21:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:21:01,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-07 08:21:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:21:01,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-07 08:21:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:21:01,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-07 08:21:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:21:01,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-07 08:21:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:21:01,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-07 08:21:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:21:01,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72
[2024-11-07 08:21:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:21:01,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-07 08:21:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:21:01,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-07 08:21:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:21:01,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-07 08:21:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:21:02,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94
[2024-11-07 08:21:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:21:02,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100
[2024-11-07 08:21:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:21:02,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105
[2024-11-07 08:21:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:21:02,029 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 60 proven. 120 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked.
[2024-11-07 08:21:02,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:21:02,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127984251]
[2024-11-07 08:21:02,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127984251] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 08:21:02,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406834088]
[2024-11-07 08:21:02,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:21:02,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 08:21:02,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:21:02,033 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 08:21:02,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-07 08:21:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:21:02,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 23 conjuncts are in the unsatisfiable core
[2024-11-07 08:21:02,442 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:21:03,732 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 339 proven. 120 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked.
[2024-11-07 08:21:03,733 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 08:21:05,329 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 99 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked.
[2024-11-07 08:21:05,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406834088] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 08:21:05,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 08:21:05,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 12] total 30
[2024-11-07 08:21:05,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609435781]
[2024-11-07 08:21:05,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 08:21:05,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2024-11-07 08:21:05,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:21:05,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2024-11-07 08:21:05,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=679, Unknown=0, NotChecked=0, Total=870
[2024-11-07 08:21:05,334 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 30 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 26 states have internal predecessors, (72), 10 states have call successors, (45), 5 states have call predecessors, (45), 9 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46)
[2024-11-07 08:21:35,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:21:35,936 INFO L93 Difference]: Finished difference Result 236 states and 306 transitions.
[2024-11-07 08:21:35,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states.
[2024-11-07 08:21:35,937 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 26 states have internal predecessors, (72), 10 states have call successors, (45), 5 states have call predecessors, (45), 9 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46) Word has length 119
[2024-11-07 08:21:35,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:21:35,939 INFO L225 Difference]: With dead ends: 236
[2024-11-07 08:21:35,939 INFO L226 Difference]: Without dead ends: 188
[2024-11-07 08:21:35,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=1128, Invalid=3025, Unknown=7, NotChecked=0, Total=4160
[2024-11-07 08:21:35,943 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 311 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time
[2024-11-07 08:21:35,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 471 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time]
[2024-11-07 08:21:35,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states.
[2024-11-07 08:21:35,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 152.
[2024-11-07 08:21:35,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 97 states have (on average 1.1237113402061856) internal successors, (109), 98 states have internal predecessors, (109), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43)
[2024-11-07 08:21:35,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 195 transitions.
[2024-11-07 08:21:35,989 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 195 transitions. Word has length 119
[2024-11-07 08:21:35,990 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:21:35,992 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 195 transitions.
[2024-11-07 08:21:35,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 26 states have internal predecessors, (72), 10 states have call successors, (45), 5 states have call predecessors, (45), 9 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46)
[2024-11-07 08:21:35,992 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 195 transitions.
[2024-11-07 08:21:35,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2024-11-07 08:21:35,994 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:21:35,994 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:36,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-07 08:21:36,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 08:21:36,195 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:21:36,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:21:36,195 INFO L85 PathProgramCache]: Analyzing trace with hash 232857355, now seen corresponding path program 1 times
[2024-11-07 08:21:36,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:21:36,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732466313]
[2024-11-07 08:21:36,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:21:36,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:21:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 08:21:36,412 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 08:21:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 08:21:36,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 08:21:36,520 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 08:21:36,521 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-07 08:21:36,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 08:21:36,527 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2024-11-07 08:21:36,617 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 08:21:36,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:21:36 BoogieIcfgContainer
[2024-11-07 08:21:36,620 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 08:21:36,621 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 08:21:36,621 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 08:21:36,621 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 08:21:36,622 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:20:47" (3/4) ...
[2024-11-07 08:21:36,624 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-07 08:21:36,625 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 08:21:36,625 INFO L158 Benchmark]: Toolchain (without parser) took 49673.51ms. Allocated memory was 117.4MB in the beginning and 402.7MB in the end (delta: 285.2MB). Free memory was 91.1MB in the beginning and 240.3MB in the end (delta: -149.3MB). Peak memory consumption was 135.6MB. Max. memory is 16.1GB.
[2024-11-07 08:21:36,626 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 117.4MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:21:36,626 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.62ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 78.2MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 08:21:36,626 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.84ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 76.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:21:36,626 INFO L158 Benchmark]: Boogie Preprocessor took 63.33ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 74.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:21:36,627 INFO L158 Benchmark]: RCFGBuilder took 449.22ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 58.9MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 08:21:36,627 INFO L158 Benchmark]: TraceAbstraction took 48771.29ms. Allocated memory was 117.4MB in the beginning and 402.7MB in the end (delta: 285.2MB). Free memory was 58.4MB in the beginning and 240.4MB in the end (delta: -182.0MB). Peak memory consumption was 110.4MB. Max. memory is 16.1GB.
[2024-11-07 08:21:36,627 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 402.7MB. Free memory was 240.4MB in the beginning and 240.3MB in the end (delta: 124.7kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:21:36,628 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.24ms. Allocated memory is still 117.4MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 317.62ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 78.2MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 56.84ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 76.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 63.33ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 74.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 449.22ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 58.9MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* TraceAbstraction took 48771.29ms. Allocated memory was 117.4MB in the beginning and 402.7MB in the end (delta: 285.2MB). Free memory was 58.4MB in the beginning and 240.4MB in the end (delta: -182.0MB). Peak memory consumption was 110.4MB. Max. memory is 16.1GB.
* Witness Printer took 3.58ms. Allocated memory is still 402.7MB. Free memory was 240.4MB in the beginning and 240.3MB in the end (delta: 124.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 93.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] double var_1_1 = 999999.2;
[L23] double var_1_6 = 0.0;
[L24] double var_1_7 = 5.9;
[L25] double var_1_8 = 255.6;
[L26] unsigned long int var_1_9 = 4;
[L27] unsigned char var_1_10 = 0;
[L28] unsigned long int var_1_11 = 1142722175;
[L29] unsigned long int var_1_12 = 1231257437;
[L30] signed char var_1_13 = -10;
[L31] signed char var_1_14 = 100;
[L32] signed char var_1_15 = 4;
[L33] signed char var_1_16 = 64;
[L34] signed char var_1_17 = 1;
[L35] signed char var_1_18 = -8;
[L36] unsigned char var_1_19 = 4;
VAL [isInitial=0, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_6=0, var_1_7=59/10, var_1_8=1278/5, var_1_9=4]
[L97] isInitial = 1
[L98] FCALL initially()
[L99] int k_loop;
[L100] k_loop = 0
VAL [isInitial=1, k_loop=0, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_6=0, var_1_7=59/10, var_1_8=1278/5, var_1_9=4]
[L100] COND TRUE k_loop < 1
[L101] FCALL updateLastVariables()
[L102] CALL updateVariables()
[L59] var_1_6 = __VERIFIER_nondet_double()
[L60] CALL assume_abort_if_not((var_1_6 >= 4611686.018427382800e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_7=59/10, var_1_8=1278/5, var_1_9=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_7=59/10, var_1_8=1278/5, var_1_9=4]
[L60] RET assume_abort_if_not((var_1_6 >= 4611686.018427382800e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F ))
VAL [isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_7=59/10, var_1_8=1278/5, var_1_9=4]
[L61] var_1_7 = __VERIFIER_nondet_double()
[L62] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_8=1278/5, var_1_9=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_8=1278/5, var_1_9=4]
[L62] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F ))
VAL [isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_8=1278/5, var_1_9=4]
[L63] var_1_8 = __VERIFIER_nondet_double()
[L64] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L64] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F ))
VAL [isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L65] var_1_10 = __VERIFIER_nondet_uchar()
[L66] CALL assume_abort_if_not(var_1_10 >= 0)
VAL [\old(cond)=1, isInitial=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L66] RET assume_abort_if_not(var_1_10 >= 0)
VAL [isInitial=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L67] CALL assume_abort_if_not(var_1_10 <= 1)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L67] RET assume_abort_if_not(var_1_10 <= 1)
VAL [isInitial=1, var_1_10=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L68] var_1_11 = __VERIFIER_nondet_ulong()
[L69] CALL assume_abort_if_not(var_1_11 >= 1073741823)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L69] RET assume_abort_if_not(var_1_11 >= 1073741823)
VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L70] CALL assume_abort_if_not(var_1_11 <= 2147483647)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L70] RET assume_abort_if_not(var_1_11 <= 2147483647)
VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L71] var_1_12 = __VERIFIER_nondet_ulong()
[L72] CALL assume_abort_if_not(var_1_12 >= 1073741824)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L72] RET assume_abort_if_not(var_1_12 >= 1073741824)
VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L73] CALL assume_abort_if_not(var_1_12 <= 2147483647)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L73] RET assume_abort_if_not(var_1_12 <= 2147483647)
VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L74] var_1_14 = __VERIFIER_nondet_char()
[L75] CALL assume_abort_if_not(var_1_14 >= -1)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L75] RET assume_abort_if_not(var_1_14 >= -1)
VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L76] CALL assume_abort_if_not(var_1_14 <= 126)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L76] RET assume_abort_if_not(var_1_14 <= 126)
VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L77] var_1_15 = __VERIFIER_nondet_char()
[L78] CALL assume_abort_if_not(var_1_15 >= 0)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L78] RET assume_abort_if_not(var_1_15 >= 0)
VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L79] CALL assume_abort_if_not(var_1_15 <= 126)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L79] RET assume_abort_if_not(var_1_15 <= 126)
VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L80] var_1_16 = __VERIFIER_nondet_char()
[L81] CALL assume_abort_if_not(var_1_16 >= 0)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=50, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=50, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L81] RET assume_abort_if_not(var_1_16 >= 0)
VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=50, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L82] CALL assume_abort_if_not(var_1_16 <= 126)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=50, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=50, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L82] RET assume_abort_if_not(var_1_16 <= 126)
VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=50, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L83] var_1_17 = __VERIFIER_nondet_char()
[L84] CALL assume_abort_if_not(var_1_17 >= -63)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=50, var_1_17=61, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=50, var_1_17=61, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L84] RET assume_abort_if_not(var_1_17 >= -63)
VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=50, var_1_17=61, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L85] CALL assume_abort_if_not(var_1_17 <= 63)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=50, var_1_17=61, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=50, var_1_17=61, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L85] RET assume_abort_if_not(var_1_17 <= 63)
VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=50, var_1_17=61, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L86] var_1_18 = __VERIFIER_nondet_char()
[L87] CALL assume_abort_if_not(var_1_18 >= -63)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=50, var_1_17=61, var_1_18=-63, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=50, var_1_17=61, var_1_18=-63, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L87] RET assume_abort_if_not(var_1_18 >= -63)
VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=50, var_1_17=61, var_1_18=-63, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L88] CALL assume_abort_if_not(var_1_18 <= 63)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=50, var_1_17=61, var_1_18=-63, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=50, var_1_17=61, var_1_18=-63, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L88] RET assume_abort_if_not(var_1_18 <= 63)
VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=50, var_1_17=61, var_1_18=-63, var_1_19=4, var_1_1=4999996/5, var_1_9=4]
[L102] RET updateVariables()
[L103] CALL step()
[L40] COND TRUE \read(var_1_10)
[L41] var_1_9 = ((var_1_11 + var_1_12) - 5u)
VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=50, var_1_17=61, var_1_18=-63, var_1_19=4, var_1_1=4999996/5, var_1_9=-26]
[L43] var_1_19 = var_1_16
[L44] unsigned long int stepLocal_0 = ((((var_1_19 + var_1_9)) < (var_1_9)) ? ((var_1_19 + var_1_9)) : (var_1_9));
VAL [isInitial=1, stepLocal_0=24, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=50, var_1_17=61, var_1_18=-63, var_1_19=50, var_1_1=4999996/5, var_1_9=-26]
[L45] COND TRUE \read(var_1_10)
[L46] var_1_13 = (var_1_14 - ((((((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16)))) < (50)) ? (((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16)))) : (50))))
VAL [isInitial=1, stepLocal_0=24, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=76, var_1_14=126, var_1_15=126, var_1_16=50, var_1_17=61, var_1_18=-63, var_1_19=50, var_1_1=4999996/5, var_1_9=-26]
[L52] COND FALSE !((var_1_9 / 32) < (((((var_1_13 + var_1_9)) < (var_1_19)) ? ((var_1_13 + var_1_9)) : (var_1_19))))
[L55] var_1_1 = var_1_6
VAL [isInitial=1, stepLocal_0=24, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=76, var_1_14=126, var_1_15=126, var_1_16=50, var_1_17=61, var_1_18=-63, var_1_19=50, var_1_1=2147483652, var_1_6=2147483652, var_1_9=-26]
[L103] RET step()
[L104] CALL, EXPR property()
[L93-L94] return (((((var_1_9 / 32) < (((((var_1_13 + var_1_9)) < (var_1_19)) ? ((var_1_13 + var_1_9)) : (var_1_19)))) ? (var_1_1 == ((double) ((var_1_6 - var_1_7) - var_1_8))) : (var_1_1 == ((double) var_1_6))) && (var_1_10 ? (var_1_9 == ((unsigned long int) ((var_1_11 + var_1_12) - 5u))) : 1)) && (var_1_10 ? (var_1_13 == ((signed char) (var_1_14 - ((((((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16)))) < (50)) ? (((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16)))) : (50)))))) : ((var_1_12 < (((((var_1_19 + var_1_9)) < (var_1_9)) ? ((var_1_19 + var_1_9)) : (var_1_9)))) ? (var_1_13 == ((signed char) (var_1_17 + var_1_18))) : 1))) && (var_1_19 == ((unsigned char) var_1_16))
;
VAL [\result=0, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=76, var_1_14=126, var_1_15=126, var_1_16=50, var_1_17=61, var_1_18=-63, var_1_19=50, var_1_1=2147483652, var_1_6=2147483652, var_1_9=-26]
[L104] RET, EXPR property()
[L104] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=76, var_1_14=126, var_1_15=126, var_1_16=50, var_1_17=61, var_1_18=-63, var_1_19=50, var_1_1=2147483652, var_1_6=2147483652, var_1_9=-26]
[L19] reach_error()
VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483668, var_1_13=76, var_1_14=126, var_1_15=126, var_1_16=50, var_1_17=61, var_1_18=-63, var_1_19=50, var_1_1=2147483652, var_1_6=2147483652, var_1_9=-26]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.6s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 30.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 316 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 311 mSDsluCounter, 548 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 387 mSDsCounter, 137 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 817 IncrementalHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 137 mSolverCounterUnsat, 161 mSDtfsCounter, 817 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 388 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 30.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=2, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 36 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 16.2s InterpolantComputationTime, 476 NumberOfCodeBlocks, 476 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 472 ConstructedInterpolants, 3 QuantifiedInterpolants, 3798 SizeOfPredicates, 8 NumberOfNonLiveVariables, 270 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 2397/2736 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:21:36,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-45.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 5d7e41890311b17b4172246b2c6ff0c305b3b8a9717c6f0cb798c28922acd89f
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 08:21:38,882 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 08:21:38,973 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:21:38,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 08:21:38,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 08:21:39,010 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 08:21:39,012 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 08:21:39,012 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 08:21:39,013 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 08:21:39,013 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 08:21:39,013 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 08:21:39,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 08:21:39,014 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 08:21:39,014 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 08:21:39,014 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 08:21:39,015 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 08:21:39,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 08:21:39,016 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 08:21:39,016 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 08:21:39,016 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 08:21:39,016 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 08:21:39,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 08:21:39,017 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 08:21:39,017 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 08:21:39,017 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-07 08:21:39,017 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 08:21:39,017 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-07 08:21:39,017 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 08:21:39,018 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 08:21:39,018 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 08:21:39,018 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 08:21:39,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 08:21:39,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 08:21:39,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 08:21:39,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:21:39,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 08:21:39,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 08:21:39,019 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 08:21:39,019 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-11-07 08:21:39,020 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-07 08:21:39,020 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 08:21:39,020 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 08:21:39,020 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 08:21:39,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 08:21:39,020 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 -> 5d7e41890311b17b4172246b2c6ff0c305b3b8a9717c6f0cb798c28922acd89f
[2024-11-07 08:21:39,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 08:21:39,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 08:21:39,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 08:21:39,320 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 08:21:39,323 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 08:21:39,325 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-45.i
[2024-11-07 08:21:40,737 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 08:21:40,983 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 08:21:40,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-45.i
[2024-11-07 08:21:40,994 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d638899b3/28edc48c252049efa1beaef684c2991a/FLAG8b29b957a
[2024-11-07 08:21:41,012 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d638899b3/28edc48c252049efa1beaef684c2991a
[2024-11-07 08:21:41,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 08:21:41,017 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 08:21:41,018 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 08:21:41,018 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 08:21:41,022 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 08:21:41,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:21:41" (1/1) ...
[2024-11-07 08:21:41,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3870008d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:21:41, skipping insertion in model container
[2024-11-07 08:21:41,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:21:41" (1/1) ...
[2024-11-07 08:21:41,040 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 08:21:41,181 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-45.i[915,928]
[2024-11-07 08:21:41,233 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:21:41,254 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 08:21:41,270 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-45.i[915,928]
[2024-11-07 08:21:41,299 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:21:41,318 INFO L204 MainTranslator]: Completed translation
[2024-11-07 08:21:41,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:21:41 WrapperNode
[2024-11-07 08:21:41,320 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 08:21:41,321 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 08:21:41,321 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 08:21:41,321 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 08:21:41,328 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:21:41" (1/1) ...
[2024-11-07 08:21:41,340 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:21:41" (1/1) ...
[2024-11-07 08:21:41,373 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117
[2024-11-07 08:21:41,374 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 08:21:41,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 08:21:41,376 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 08:21:41,376 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 08:21:41,384 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:21:41" (1/1) ...
[2024-11-07 08:21:41,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:21:41" (1/1) ...
[2024-11-07 08:21:41,388 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:21:41" (1/1) ...
[2024-11-07 08:21:41,404 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:21:41,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:21:41" (1/1) ...
[2024-11-07 08:21:41,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:21:41" (1/1) ...
[2024-11-07 08:21:41,416 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:21:41" (1/1) ...
[2024-11-07 08:21:41,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:21:41" (1/1) ...
[2024-11-07 08:21:41,428 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:21:41" (1/1) ...
[2024-11-07 08:21:41,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:21:41" (1/1) ...
[2024-11-07 08:21:41,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 08:21:41,436 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 08:21:41,440 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 08:21:41,440 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 08:21:41,441 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:21:41" (1/1) ...
[2024-11-07 08:21:41,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:21:41,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:21:41,472 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:21:41,480 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:21:41,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 08:21:41,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-07 08:21:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 08:21:41,501 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 08:21:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 08:21:41,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 08:21:41,591 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 08:21:41,592 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 08:21:43,578 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live.
[2024-11-07 08:21:43,579 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 08:21:43,591 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 08:21:43,592 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 08:21:43,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:21:43 BoogieIcfgContainer
[2024-11-07 08:21:43,593 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 08:21:43,595 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 08:21:43,595 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 08:21:43,601 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 08:21:43,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:21:41" (1/3) ...
[2024-11-07 08:21:43,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378ee9d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:21:43, skipping insertion in model container
[2024-11-07 08:21:43,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:21:41" (2/3) ...
[2024-11-07 08:21:43,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378ee9d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:21:43, skipping insertion in model container
[2024-11-07 08:21:43,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:21:43" (3/3) ...
[2024-11-07 08:21:43,604 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-45.i
[2024-11-07 08:21:43,619 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 08:21:43,619 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 08:21:43,682 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 08:21:43,729 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;@1deb991c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 08:21:43,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 08:21:43,735 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19)
[2024-11-07 08:21:43,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2024-11-07 08:21:43,746 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:21:43,747 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:43,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:21:43,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:21:43,756 INFO L85 PathProgramCache]: Analyzing trace with hash 875331919, now seen corresponding path program 1 times
[2024-11-07 08:21:43,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:21:43,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1505545090]
[2024-11-07 08:21:43,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:21:43,769 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:21:43,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:21:43,774 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:21:43,775 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:21:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:21:44,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-07 08:21:44,060 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:21:44,108 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked.
[2024-11-07 08:21:44,108 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 08:21:44,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 08:21:44,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1505545090]
[2024-11-07 08:21:44,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1505545090] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:21:44,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:21:44,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 08:21:44,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146735911]
[2024-11-07 08:21:44,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:21:44,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 08:21:44,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 08:21:44,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 08:21:44,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 08:21:44,133 INFO L87 Difference]: Start difference. First operand has 55 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19)
[2024-11-07 08:21:44,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:21:44,153 INFO L93 Difference]: Finished difference Result 107 states and 176 transitions.
[2024-11-07 08:21:44,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 08:21:44,155 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119
[2024-11-07 08:21:44,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:21:44,160 INFO L225 Difference]: With dead ends: 107
[2024-11-07 08:21:44,160 INFO L226 Difference]: Without dead ends: 51
[2024-11-07 08:21:44,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 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:21:44,169 INFO L432 NwaCegarLoop]: 77 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, 77 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:21:44,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 08:21:44,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2024-11-07 08:21:44,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51.
[2024-11-07 08:21:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19)
[2024-11-07 08:21:44,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions.
[2024-11-07 08:21:44,213 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 119
[2024-11-07 08:21:44,214 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:21:44,214 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions.
[2024-11-07 08:21:44,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19)
[2024-11-07 08:21:44,215 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions.
[2024-11-07 08:21:44,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2024-11-07 08:21:44,218 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:21:44,218 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:44,230 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:21:44,419 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:21:44,420 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:21:44,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:21:44,420 INFO L85 PathProgramCache]: Analyzing trace with hash 231010313, now seen corresponding path program 1 times
[2024-11-07 08:21:44,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:21:44,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [70032646]
[2024-11-07 08:21:44,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:21:44,422 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:21:44,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:21:44,424 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:21:44,425 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:21:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:21:44,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 21 conjuncts are in the unsatisfiable core
[2024-11-07 08:21:44,734 INFO L278 TraceCheckSpWp]: Computing forward predicates...