./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-2.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_50-1loop_file-2.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', '84703b5fd2fbca77a636bf79712463c0e9901391b15edc6d772ff3f7bfe48b3e']
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_50-1loop_file-2.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 84703b5fd2fbca77a636bf79712463c0e9901391b15edc6d772ff3f7bfe48b3e
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 08:39:17,574 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 08:39:17,648 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:39:17,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 08:39:17,654 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 08:39:17,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 08:39:17,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 08:39:17,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 08:39:17,677 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 08:39:17,677 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 08:39:17,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 08:39:17,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 08:39:17,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 08:39:17,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 08:39:17,679 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 08:39:17,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 08:39:17,679 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 08:39:17,679 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 08:39:17,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 08:39:17,679 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 08:39:17,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 08:39:17,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 08:39:17,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 08:39:17,679 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 08:39:17,679 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 08:39:17,679 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 08:39:17,679 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 08:39:17,679 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 08:39:17,680 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 08:39:17,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 08:39:17,680 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 08:39:17,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 08:39:17,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:39:17,680 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 08:39:17,680 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 08:39:17,680 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 08:39:17,680 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 08:39:17,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 08:39:17,680 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 08:39:17,680 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 08:39:17,680 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 08:39:17,680 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 08:39:17,680 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 -> 84703b5fd2fbca77a636bf79712463c0e9901391b15edc6d772ff3f7bfe48b3e
[2024-11-07 08:39:17,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 08:39:17,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 08:39:17,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 08:39:17,935 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 08:39:17,935 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 08:39:17,936 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-2.i
[2024-11-07 08:39:19,058 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 08:39:19,309 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 08:39:19,310 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-2.i
[2024-11-07 08:39:19,319 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0031ed30d/93de1061f0d04e83bb964c531f109348/FLAGd367ac4a2
[2024-11-07 08:39:19,333 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0031ed30d/93de1061f0d04e83bb964c531f109348
[2024-11-07 08:39:19,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 08:39:19,336 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 08:39:19,338 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 08:39:19,339 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 08:39:19,342 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 08:39:19,343 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:39:19" (1/1) ...
[2024-11-07 08:39:19,344 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c6edaeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:19, skipping insertion in model container
[2024-11-07 08:39:19,344 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:39:19" (1/1) ...
[2024-11-07 08:39:19,361 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 08:39:19,449 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_50-1loop_file-2.i[914,927]
[2024-11-07 08:39:19,495 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:39:19,503 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 08:39:19,513 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_50-1loop_file-2.i[914,927]
[2024-11-07 08:39:19,529 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:39:19,539 INFO L204 MainTranslator]: Completed translation
[2024-11-07 08:39:19,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:19 WrapperNode
[2024-11-07 08:39:19,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 08:39:19,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 08:39:19,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 08:39:19,542 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 08:39:19,546 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:39:19" (1/1) ...
[2024-11-07 08:39:19,556 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:39:19" (1/1) ...
[2024-11-07 08:39:19,583 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127
[2024-11-07 08:39:19,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 08:39:19,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 08:39:19,588 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 08:39:19,588 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 08:39:19,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:19" (1/1) ...
[2024-11-07 08:39:19,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:19" (1/1) ...
[2024-11-07 08:39:19,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:19" (1/1) ...
[2024-11-07 08:39:19,613 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:39:19,615 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:19" (1/1) ...
[2024-11-07 08:39:19,615 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:19" (1/1) ...
[2024-11-07 08:39:19,620 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:19" (1/1) ...
[2024-11-07 08:39:19,627 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:19" (1/1) ...
[2024-11-07 08:39:19,631 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:19" (1/1) ...
[2024-11-07 08:39:19,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:19" (1/1) ...
[2024-11-07 08:39:19,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 08:39:19,638 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 08:39:19,638 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 08:39:19,638 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 08:39:19,639 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:19" (1/1) ...
[2024-11-07 08:39:19,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:39:19,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:39:19,669 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:39:19,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-07 08:39:19,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 08:39:19,688 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 08:39:19,688 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 08:39:19,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 08:39:19,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 08:39:19,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 08:39:19,746 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 08:39:19,747 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 08:39:19,903 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live.
[2024-11-07 08:39:19,904 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 08:39:19,912 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 08:39:19,912 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 08:39:19,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:39:19 BoogieIcfgContainer
[2024-11-07 08:39:19,912 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 08:39:19,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 08:39:19,915 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 08:39:19,918 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 08:39:19,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:39:19" (1/3) ...
[2024-11-07 08:39:19,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3762c1f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:39:19, skipping insertion in model container
[2024-11-07 08:39:19,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:19" (2/3) ...
[2024-11-07 08:39:19,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3762c1f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:39:19, skipping insertion in model container
[2024-11-07 08:39:19,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:39:19" (3/3) ...
[2024-11-07 08:39:19,920 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-2.i
[2024-11-07 08:39:19,930 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 08:39:19,930 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 08:39:19,961 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 08:39:19,968 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;@393938cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 08:39:19,969 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 08:39:19,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-07 08:39:19,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2024-11-07 08:39:19,977 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:39:19,977 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:19,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:39:19,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:39:19,981 INFO L85 PathProgramCache]: Analyzing trace with hash 99878994, now seen corresponding path program 1 times
[2024-11-07 08:39:19,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:39:19,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911439367]
[2024-11-07 08:39:19,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:39:19,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:39:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:39:20,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:39:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:39:20,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-07 08:39:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:39:20,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-07 08:39:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:39:20,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-07 08:39:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:39:20,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-07 08:39:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:39:20,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-07 08:39:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:39:20,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-07 08:39:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:39:20,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2024-11-07 08:39:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:39:20,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-07 08:39:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:39:20,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57
[2024-11-07 08:39:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:39:20,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-07 08:39:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:39:20,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-11-07 08:39:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:39:20,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-07 08:39:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:39:20,287 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2024-11-07 08:39:20,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:39:20,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911439367]
[2024-11-07 08:39:20,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911439367] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:39:20,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:39:20,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 08:39:20,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989006396]
[2024-11-07 08:39:20,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:39:20,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 08:39:20,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:39:20,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 08:39:20,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 08:39:20,311 INFO L87 Difference]: Start difference. First operand has 54 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2024-11-07 08:39:20,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:39:20,330 INFO L93 Difference]: Finished difference Result 105 states and 168 transitions.
[2024-11-07 08:39:20,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 08:39:20,332 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91
[2024-11-07 08:39:20,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:39:20,336 INFO L225 Difference]: With dead ends: 105
[2024-11-07 08:39:20,336 INFO L226 Difference]: Without dead ends: 50
[2024-11-07 08:39:20,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 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:39:20,340 INFO L432 NwaCegarLoop]: 74 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, 74 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:39:20,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 08:39:20,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states.
[2024-11-07 08:39:20,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50.
[2024-11-07 08:39:20,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-07 08:39:20,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions.
[2024-11-07 08:39:20,374 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 91
[2024-11-07 08:39:20,375 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:39:20,376 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions.
[2024-11-07 08:39:20,376 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2024-11-07 08:39:20,376 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions.
[2024-11-07 08:39:20,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2024-11-07 08:39:20,378 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:39:20,378 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:20,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 08:39:20,378 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:39:20,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:39:20,379 INFO L85 PathProgramCache]: Analyzing trace with hash 87026101, now seen corresponding path program 1 times
[2024-11-07 08:39:20,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:39:20,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253808724]
[2024-11-07 08:39:20,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:39:20,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:39:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-07 08:39:20,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1334255844]
[2024-11-07 08:39:20,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:39:20,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 08:39:20,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:39:20,483 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:39:20,484 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:39:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:39:20,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 17 conjuncts are in the unsatisfiable core
[2024-11-07 08:39:20,659 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:39:20,920 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 153 proven. 9 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked.
[2024-11-07 08:39:20,922 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 08:39:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked.
[2024-11-07 08:39:21,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:39:21,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253808724]
[2024-11-07 08:39:21,387 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-11-07 08:39:21,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334255844]
[2024-11-07 08:39:21,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334255844] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 08:39:21,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 08:39:21,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14
[2024-11-07 08:39:21,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499882373]
[2024-11-07 08:39:21,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 08:39:21,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-11-07 08:39:21,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:39:21,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-11-07 08:39:21,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182
[2024-11-07 08:39:21,391 INFO L87 Difference]: Start difference. First operand 50 states and 70 transitions. Second operand has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 14 states have internal predecessors, (49), 5 states have call successors, (17), 3 states have call predecessors, (17), 5 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17)
[2024-11-07 08:39:21,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:39:21,705 INFO L93 Difference]: Finished difference Result 125 states and 172 transitions.
[2024-11-07 08:39:21,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-11-07 08:39:21,707 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 14 states have internal predecessors, (49), 5 states have call successors, (17), 3 states have call predecessors, (17), 5 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) Word has length 92
[2024-11-07 08:39:21,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:39:21,708 INFO L225 Difference]: With dead ends: 125
[2024-11-07 08:39:21,708 INFO L226 Difference]: Without dead ends: 78
[2024-11-07 08:39:21,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272
[2024-11-07 08:39:21,709 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 87 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 08:39:21,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 257 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 08:39:21,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states.
[2024-11-07 08:39:21,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75.
[2024-11-07 08:39:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.163265306122449) internal successors, (57), 50 states have internal predecessors, (57), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22)
[2024-11-07 08:39:21,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 101 transitions.
[2024-11-07 08:39:21,725 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 101 transitions. Word has length 92
[2024-11-07 08:39:21,725 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:39:21,726 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 101 transitions.
[2024-11-07 08:39:21,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 14 states have internal predecessors, (49), 5 states have call successors, (17), 3 states have call predecessors, (17), 5 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17)
[2024-11-07 08:39:21,726 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 101 transitions.
[2024-11-07 08:39:21,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2024-11-07 08:39:21,727 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:39:21,727 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:21,741 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:39:21,931 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:39:21,932 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:39:21,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:39:21,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1091885561, now seen corresponding path program 1 times
[2024-11-07 08:39:21,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:39:21,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843807556]
[2024-11-07 08:39:21,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:39:21,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:39:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-07 08:39:21,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [241605138]
[2024-11-07 08:39:21,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:39:21,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 08:39:21,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:39:21,994 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 08:39:21,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-07 08:39:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 08:39:22,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 08:39:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 08:39:22,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 08:39:22,145 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 08:39:22,147 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-07 08:39:22,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-07 08:39:22,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 08:39:22,351 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2024-11-07 08:39:22,403 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 08:39:22,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:39:22 BoogieIcfgContainer
[2024-11-07 08:39:22,407 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 08:39:22,407 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 08:39:22,407 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 08:39:22,407 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 08:39:22,408 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:39:19" (3/4) ...
[2024-11-07 08:39:22,410 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-07 08:39:22,410 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 08:39:22,411 INFO L158 Benchmark]: Toolchain (without parser) took 3074.46ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 91.1MB in the beginning and 114.9MB in the end (delta: -23.8MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB.
[2024-11-07 08:39:22,412 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:39:22,412 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.11ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 77.7MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 08:39:22,412 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.26ms. Allocated memory is still 117.4MB. Free memory was 77.7MB in the beginning and 75.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:39:22,412 INFO L158 Benchmark]: Boogie Preprocessor took 49.83ms. Allocated memory is still 117.4MB. Free memory was 75.7MB in the beginning and 73.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:39:22,412 INFO L158 Benchmark]: RCFGBuilder took 274.11ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 57.9MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 08:39:22,412 INFO L158 Benchmark]: TraceAbstraction took 2491.42ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 57.4MB in the beginning and 115.0MB in the end (delta: -57.6MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB.
[2024-11-07 08:39:22,413 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 151.0MB. Free memory was 115.0MB in the beginning and 114.9MB in the end (delta: 52.0kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:39:22,413 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.21ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 202.11ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 77.7MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 46.26ms. Allocated memory is still 117.4MB. Free memory was 77.7MB in the beginning and 75.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 49.83ms. Allocated memory is still 117.4MB. Free memory was 75.7MB in the beginning and 73.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 274.11ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 57.9MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* TraceAbstraction took 2491.42ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 57.4MB in the beginning and 115.0MB in the end (delta: -57.6MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB.
* Witness Printer took 2.95ms. Allocated memory is still 151.0MB. Free memory was 115.0MB in the beginning and 114.9MB in the end (delta: 52.0kB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of someBinaryArithmeticDOUBLEoperation at line 86.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] float var_1_1 = 3.95;
[L23] float var_1_4 = 9999999.8;
[L24] float var_1_5 = 8.6;
[L25] unsigned long int var_1_6 = 10000;
[L26] double var_1_8 = 64.5;
[L27] float var_1_10 = 255.25;
[L28] float var_1_11 = 7.5;
[L29] float var_1_12 = 0.0;
[L30] float var_1_13 = 64.8;
[L31] double var_1_14 = 127.75;
[L32] signed char var_1_15 = 8;
[L33] signed char var_1_16 = 32;
[L34] unsigned char var_1_17 = 0;
[L35] unsigned char var_1_18 = 0;
[L36] double var_1_19 = 2.25;
[L37] unsigned char var_1_20 = 0;
[L38] unsigned short int var_1_21 = 256;
[L39] unsigned long int last_1_var_1_6 = 10000;
VAL [isInitial=0, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_4=49999999/5, var_1_5=43/5, var_1_6=10000, var_1_8=129/2]
[L121] isInitial = 1
[L122] FCALL initially()
[L123] int k_loop;
[L124] k_loop = 0
VAL [isInitial=1, k_loop=0, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_4=49999999/5, var_1_5=43/5, var_1_6=10000, var_1_8=129/2]
[L124] COND TRUE k_loop < 1
[L125] CALL updateLastVariables()
[L114] last_1_var_1_6 = var_1_6
VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_4=49999999/5, var_1_5=43/5, var_1_6=10000, var_1_8=129/2]
[L125] RET updateLastVariables()
[L126] CALL updateVariables()
[L90] var_1_4 = __VERIFIER_nondet_float()
[L91] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_5=43/5, var_1_6=10000, var_1_8=129/2]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_5=43/5, var_1_6=10000, var_1_8=129/2]
[L91] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_5=43/5, var_1_6=10000, var_1_8=129/2]
[L92] var_1_5 = __VERIFIER_nondet_float()
[L93] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000, var_1_8=129/2]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000, var_1_8=129/2]
[L93] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000, var_1_8=129/2]
[L94] var_1_8 = __VERIFIER_nondet_double()
[L95] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L95] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L96] var_1_11 = __VERIFIER_nondet_float()
[L97] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L97] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L98] CALL assume_abort_if_not(var_1_11 != 0.0F)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L98] RET assume_abort_if_not(var_1_11 != 0.0F)
VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L99] var_1_12 = __VERIFIER_nondet_float()
[L100] CALL assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L100] RET assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L101] var_1_13 = __VERIFIER_nondet_float()
[L102] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L102] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L103] var_1_15 = __VERIFIER_nondet_char()
[L104] CALL assume_abort_if_not(var_1_15 >= -1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L104] RET assume_abort_if_not(var_1_15 >= -1)
VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L105] CALL assume_abort_if_not(var_1_15 <= 127)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L105] RET assume_abort_if_not(var_1_15 <= 127)
VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L106] var_1_16 = __VERIFIER_nondet_char()
[L107] CALL assume_abort_if_not(var_1_16 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L107] RET assume_abort_if_not(var_1_16 >= 0)
VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L108] CALL assume_abort_if_not(var_1_16 <= 127)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L108] RET assume_abort_if_not(var_1_16 <= 127)
VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L109] var_1_18 = __VERIFIER_nondet_uchar()
[L110] CALL assume_abort_if_not(var_1_18 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L110] RET assume_abort_if_not(var_1_18 >= 0)
VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L111] CALL assume_abort_if_not(var_1_18 <= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L111] RET assume_abort_if_not(var_1_18 <= 0)
VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L126] RET updateVariables()
[L127] CALL step()
[L43] COND TRUE (var_1_15 - ((((0) < (var_1_16)) ? (0) : (var_1_16)))) > last_1_var_1_6
[L44] var_1_14 = var_1_12
VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L46] COND FALSE !((var_1_5 / var_1_11) >= (var_1_8 - var_1_4))
[L49] var_1_10 = 4.2f
VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000]
[L51] var_1_20 = var_1_16
[L52] var_1_21 = var_1_16
VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_6=10000]
[L53] COND TRUE var_1_21 <= (var_1_16 * var_1_20)
VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_6=10000]
[L54] COND TRUE (var_1_5 + var_1_14) <= 127.025f
[L55] var_1_17 = var_1_18
VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_6=10000]
[L62] unsigned char stepLocal_0 = var_1_20 != var_1_20;
VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_6=10000]
[L63] COND FALSE !(\read(var_1_17))
[L74] var_1_6 = var_1_20
VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_6=1]
[L76] COND TRUE var_1_6 <= var_1_6
VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_6=1]
[L77] COND FALSE !(var_1_6 > var_1_6)
[L80] var_1_1 = var_1_5
VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=3, var_1_20=1, var_1_21=1, var_1_5=3, var_1_6=1]
[L85] COND TRUE var_1_1 < var_1_11
[L86] var_1_19 = (var_1_13 - 256.4)
VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=3, var_1_20=1, var_1_21=1, var_1_5=3, var_1_6=1]
[L127] RET step()
[L128] CALL, EXPR property()
[L117-L118] return ((((((((var_1_6 <= var_1_6) ? ((var_1_6 > var_1_6) ? (var_1_1 == ((float) (var_1_4 - var_1_5))) : (var_1_1 == ((float) var_1_5))) : (var_1_1 == ((float) var_1_4))) && (var_1_17 ? ((((((var_1_14) > (((((var_1_5) > (199.78)) ? (var_1_5) : (199.78))))) ? (var_1_14) : (((((var_1_5) > (199.78)) ? (var_1_5) : (199.78)))))) != (var_1_4 - var_1_8)) ? (((var_1_20 != var_1_20) || var_1_17) ? (var_1_6 == ((unsigned long int) var_1_20)) : (var_1_6 == ((unsigned long int) 5u))) : (var_1_6 == ((unsigned long int) var_1_20))) : (var_1_6 == ((unsigned long int) var_1_20)))) && (((var_1_5 / var_1_11) >= (var_1_8 - var_1_4)) ? (var_1_10 == ((float) (((((var_1_5 - (var_1_12 - var_1_13))) < (var_1_4)) ? ((var_1_5 - (var_1_12 - var_1_13))) : (var_1_4))))) : (var_1_10 == ((float) 4.2f)))) && (((var_1_15 - ((((0) < (var_1_16)) ? (0) : (var_1_16)))) > last_1_var_1_6) ? (var_1_14 == ((double) var_1_12)) : 1)) && ((var_1_21 <= (var_1_16 * var_1_20)) ? (((var_1_5 + var_1_14) <= 127.025f) ? (var_1_17 == ((unsigned char) var_1_18)) : (var_1_17 == ((unsigned char) var_1_18))) : (var_1_17 == ((unsigned char) var_1_18)))) && ((var_1_1 < var_1_11) ? (var_1_19 == ((double) (var_1_13 - 256.4))) : 1)) && (var_1_20 == ((unsigned char) var_1_16))) && (var_1_21 == ((unsigned short int) var_1_16))
;
VAL [\result=0, isInitial=1, last_1_var_1_6=10000, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=3, var_1_20=1, var_1_21=1, var_1_5=3, var_1_6=1]
[L128] RET, EXPR property()
[L128] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=3, var_1_20=1, var_1_21=1, var_1_5=3, var_1_6=1]
[L19] reach_error()
VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=3, var_1_20=1, var_1_21=1, var_1_5=3, var_1_6=1]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 3, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 105 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 331 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 190 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 327 IncrementalHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 141 mSDtfsCounter, 327 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 213 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=2, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 461 NumberOfCodeBlocks, 461 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 604 SizeOfPredicates, 4 NumberOfNonLiveVariables, 231 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 918/936 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:39:22,431 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_50-1loop_file-2.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 84703b5fd2fbca77a636bf79712463c0e9901391b15edc6d772ff3f7bfe48b3e
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 08:39:24,204 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 08:39:24,248 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:39:24,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 08:39:24,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 08:39:24,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 08:39:24,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 08:39:24,309 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 08:39:24,309 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 08:39:24,309 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 08:39:24,310 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 08:39:24,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 08:39:24,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 08:39:24,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 08:39:24,311 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 08:39:24,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 08:39:24,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 08:39:24,311 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 08:39:24,311 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 08:39:24,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 08:39:24,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 08:39:24,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 08:39:24,312 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 08:39:24,312 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 08:39:24,312 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-07 08:39:24,312 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 08:39:24,312 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-07 08:39:24,312 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 08:39:24,312 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 08:39:24,312 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 08:39:24,312 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 08:39:24,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 08:39:24,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 08:39:24,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 08:39:24,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:39:24,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 08:39:24,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 08:39:24,313 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 08:39:24,313 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-11-07 08:39:24,313 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-07 08:39:24,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 08:39:24,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 08:39:24,313 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 08:39:24,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 08:39:24,313 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 -> 84703b5fd2fbca77a636bf79712463c0e9901391b15edc6d772ff3f7bfe48b3e
[2024-11-07 08:39:24,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 08:39:24,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 08:39:24,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 08:39:24,531 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 08:39:24,531 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 08:39:24,532 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-2.i
[2024-11-07 08:39:25,644 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 08:39:25,875 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 08:39:25,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-2.i
[2024-11-07 08:39:25,887 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/33cb117ed/b1afed20ce7f457487fcb1fb2cf37be1/FLAGd608fc1d3
[2024-11-07 08:39:25,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/33cb117ed/b1afed20ce7f457487fcb1fb2cf37be1
[2024-11-07 08:39:25,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 08:39:25,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 08:39:25,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 08:39:25,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 08:39:25,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 08:39:25,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:39:25" (1/1) ...
[2024-11-07 08:39:25,913 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2931f702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:25, skipping insertion in model container
[2024-11-07 08:39:25,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:39:25" (1/1) ...
[2024-11-07 08:39:25,928 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 08:39:26,030 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_50-1loop_file-2.i[914,927]
[2024-11-07 08:39:26,078 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:39:26,091 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 08:39:26,099 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_50-1loop_file-2.i[914,927]
[2024-11-07 08:39:26,115 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:39:26,126 INFO L204 MainTranslator]: Completed translation
[2024-11-07 08:39:26,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:26 WrapperNode
[2024-11-07 08:39:26,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 08:39:26,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 08:39:26,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 08:39:26,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 08:39:26,133 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:39:26" (1/1) ...
[2024-11-07 08:39:26,145 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:39:26" (1/1) ...
[2024-11-07 08:39:26,161 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125
[2024-11-07 08:39:26,161 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 08:39:26,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 08:39:26,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 08:39:26,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 08:39:26,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:26" (1/1) ...
[2024-11-07 08:39:26,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:26" (1/1) ...
[2024-11-07 08:39:26,173 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:26" (1/1) ...
[2024-11-07 08:39:26,191 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:39:26,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:26" (1/1) ...
[2024-11-07 08:39:26,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:26" (1/1) ...
[2024-11-07 08:39:26,201 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:26" (1/1) ...
[2024-11-07 08:39:26,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:26" (1/1) ...
[2024-11-07 08:39:26,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:26" (1/1) ...
[2024-11-07 08:39:26,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:26" (1/1) ...
[2024-11-07 08:39:26,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 08:39:26,217 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 08:39:26,217 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 08:39:26,217 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 08:39:26,218 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:26" (1/1) ...
[2024-11-07 08:39:26,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:39:26,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:39:26,247 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:39:26,253 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:39:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 08:39:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-07 08:39:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 08:39:26,267 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 08:39:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 08:39:26,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 08:39:26,338 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 08:39:26,340 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 08:39:40,820 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live.
[2024-11-07 08:39:40,820 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 08:39:40,826 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 08:39:40,826 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 08:39:40,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:39:40 BoogieIcfgContainer
[2024-11-07 08:39:40,827 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 08:39:40,828 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 08:39:40,828 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 08:39:40,832 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 08:39:40,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:39:25" (1/3) ...
[2024-11-07 08:39:40,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758230e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:39:40, skipping insertion in model container
[2024-11-07 08:39:40,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:26" (2/3) ...
[2024-11-07 08:39:40,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758230e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:39:40, skipping insertion in model container
[2024-11-07 08:39:40,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:39:40" (3/3) ...
[2024-11-07 08:39:40,834 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-2.i
[2024-11-07 08:39:40,843 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 08:39:40,843 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 08:39:40,875 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 08:39:40,883 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;@5cfc1cb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 08:39:40,883 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 08:39:40,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-07 08:39:40,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2024-11-07 08:39:40,891 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:39:40,892 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:40,892 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:39:40,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:39:40,895 INFO L85 PathProgramCache]: Analyzing trace with hash 99878994, now seen corresponding path program 1 times
[2024-11-07 08:39:40,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:39:40,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140281911]
[2024-11-07 08:39:40,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:39:40,902 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:39:40,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:39:40,905 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:39:40,906 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:39:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:39:41,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-07 08:39:41,426 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:39:41,458 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2024-11-07 08:39:41,459 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 08:39:41,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 08:39:41,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140281911]
[2024-11-07 08:39:41,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140281911] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:39:41,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:39:41,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 08:39:41,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580661735]
[2024-11-07 08:39:41,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:39:41,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 08:39:41,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 08:39:41,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 08:39:41,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 08:39:41,477 INFO L87 Difference]: Start difference. First operand has 54 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2024-11-07 08:39:41,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:39:41,489 INFO L93 Difference]: Finished difference Result 105 states and 168 transitions.
[2024-11-07 08:39:41,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 08:39:41,491 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91
[2024-11-07 08:39:41,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:39:41,495 INFO L225 Difference]: With dead ends: 105
[2024-11-07 08:39:41,495 INFO L226 Difference]: Without dead ends: 50
[2024-11-07 08:39:41,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 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:39:41,498 INFO L432 NwaCegarLoop]: 74 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, 74 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:39:41,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 08:39:41,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states.
[2024-11-07 08:39:41,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50.
[2024-11-07 08:39:41,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-07 08:39:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions.
[2024-11-07 08:39:41,521 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 91
[2024-11-07 08:39:41,522 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:39:41,522 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions.
[2024-11-07 08:39:41,523 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2024-11-07 08:39:41,523 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions.
[2024-11-07 08:39:41,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2024-11-07 08:39:41,525 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:39:41,525 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:41,539 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:39:41,725 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:39:41,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:39:41,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:39:41,726 INFO L85 PathProgramCache]: Analyzing trace with hash 87026101, now seen corresponding path program 1 times
[2024-11-07 08:39:41,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:39:41,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775850466]
[2024-11-07 08:39:41,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:39:41,727 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:39:41,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:39:41,729 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:39:41,731 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:39:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:39:42,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-07 08:39:42,222 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:39:42,915 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 138 proven. 9 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked.
[2024-11-07 08:39:42,916 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 08:39:44,101 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked.
[2024-11-07 08:39:44,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 08:39:44,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775850466]
[2024-11-07 08:39:44,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775850466] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 08:39:44,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 08:39:44,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9
[2024-11-07 08:39:44,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469401912]
[2024-11-07 08:39:44,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 08:39:44,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-07 08:39:44,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 08:39:44,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-07 08:39:44,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2024-11-07 08:39:44,104 INFO L87 Difference]: Start difference. First operand 50 states and 70 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17)
[2024-11-07 08:39:50,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 08:39:54,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 08:39:58,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 08:39:59,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:39:59,541 INFO L93 Difference]: Finished difference Result 127 states and 174 transitions.
[2024-11-07 08:39:59,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-11-07 08:39:59,542 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 92
[2024-11-07 08:39:59,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:39:59,545 INFO L225 Difference]: With dead ends: 127
[2024-11-07 08:39:59,545 INFO L226 Difference]: Without dead ends: 80
[2024-11-07 08:39:59,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210
[2024-11-07 08:39:59,546 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 128 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 41 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time
[2024-11-07 08:39:59,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 164 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 179 Invalid, 3 Unknown, 0 Unchecked, 14.9s Time]
[2024-11-07 08:39:59,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states.
[2024-11-07 08:39:59,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75.
[2024-11-07 08:39:59,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.163265306122449) internal successors, (57), 50 states have internal predecessors, (57), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22)
[2024-11-07 08:39:59,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 101 transitions.
[2024-11-07 08:39:59,558 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 101 transitions. Word has length 92
[2024-11-07 08:39:59,558 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:39:59,558 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 101 transitions.
[2024-11-07 08:39:59,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17)
[2024-11-07 08:39:59,559 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 101 transitions.
[2024-11-07 08:39:59,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2024-11-07 08:39:59,560 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:39:59,560 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:59,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0
[2024-11-07 08:39:59,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 08:39:59,761 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:39:59,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:39:59,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1091885561, now seen corresponding path program 1 times
[2024-11-07 08:39:59,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:39:59,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1386288765]
[2024-11-07 08:39:59,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:39:59,763 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:39:59,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:39:59,766 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 08:39:59,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2024-11-07 08:40:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:40:00,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 28 conjuncts are in the unsatisfiable core
[2024-11-07 08:40:00,380 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:40:16,793 WARN L286 SmtUtils]: Spent 5.36s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-07 08:40:27,200 WARN L286 SmtUtils]: Spent 6.78s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-07 08:40:43,507 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-07 08:41:01,081 WARN L286 SmtUtils]: Spent 5.54s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)