./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-79.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-while_file-79.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', '6bbbe2cee8f4695a581c4f71225dc72ba731151283bb1ceb687623e1d215afc7']
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-while_file-79.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 6bbbe2cee8f4695a581c4f71225dc72ba731151283bb1ceb687623e1d215afc7
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 08:58:12,076 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 08:58:12,167 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:58:12,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 08:58:12,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 08:58:12,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 08:58:12,202 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 08:58:12,204 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 08:58:12,204 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 08:58:12,204 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 08:58:12,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 08:58:12,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 08:58:12,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 08:58:12,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 08:58:12,205 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 08:58:12,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 08:58:12,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 08:58:12,205 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 08:58:12,205 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 08:58:12,205 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 08:58:12,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 08:58:12,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 08:58:12,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 08:58:12,205 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 08:58:12,205 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 08:58:12,205 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 08:58:12,205 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 08:58:12,205 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 08:58:12,205 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 08:58:12,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 08:58:12,205 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 08:58:12,205 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 08:58:12,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:58:12,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 08:58:12,206 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 08:58:12,206 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 08:58:12,206 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 08:58:12,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 08:58:12,206 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 08:58:12,206 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 08:58:12,206 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 08:58:12,206 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 08:58:12,206 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 -> 6bbbe2cee8f4695a581c4f71225dc72ba731151283bb1ceb687623e1d215afc7
[2024-11-07 08:58:12,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 08:58:12,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 08:58:12,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 08:58:12,466 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 08:58:12,466 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 08:58:12,467 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-while_file-79.i
[2024-11-07 08:58:13,725 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 08:58:13,994 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 08:58:13,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-79.i
[2024-11-07 08:58:14,006 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd9135b16/a1d2bf6aa30e42e5b1ef73a4c395e6b9/FLAG6c80559cd
[2024-11-07 08:58:14,304 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd9135b16/a1d2bf6aa30e42e5b1ef73a4c395e6b9
[2024-11-07 08:58:14,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 08:58:14,316 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 08:58:14,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 08:58:14,319 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 08:58:14,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 08:58:14,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:58:14" (1/1) ...
[2024-11-07 08:58:14,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5095eba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:14, skipping insertion in model container
[2024-11-07 08:58:14,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:58:14" (1/1) ...
[2024-11-07 08:58:14,351 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 08:58:14,527 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-while_file-79.i[915,928]
[2024-11-07 08:58:14,642 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:58:14,659 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 08:58:14,667 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-while_file-79.i[915,928]
[2024-11-07 08:58:14,684 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:58:14,700 INFO L204 MainTranslator]: Completed translation
[2024-11-07 08:58:14,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:14 WrapperNode
[2024-11-07 08:58:14,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 08:58:14,702 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 08:58:14,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 08:58:14,702 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 08:58:14,711 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:58:14" (1/1) ...
[2024-11-07 08:58:14,727 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:58:14" (1/1) ...
[2024-11-07 08:58:14,788 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 163
[2024-11-07 08:58:14,795 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 08:58:14,796 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 08:58:14,796 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 08:58:14,796 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 08:58:14,811 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:14" (1/1) ...
[2024-11-07 08:58:14,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:14" (1/1) ...
[2024-11-07 08:58:14,816 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:14" (1/1) ...
[2024-11-07 08:58:14,839 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:58:14,839 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:14" (1/1) ...
[2024-11-07 08:58:14,840 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:14" (1/1) ...
[2024-11-07 08:58:14,851 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:14" (1/1) ...
[2024-11-07 08:58:14,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:14" (1/1) ...
[2024-11-07 08:58:14,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:14" (1/1) ...
[2024-11-07 08:58:14,865 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:14" (1/1) ...
[2024-11-07 08:58:14,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 08:58:14,873 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 08:58:14,874 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 08:58:14,874 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 08:58:14,875 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:14" (1/1) ...
[2024-11-07 08:58:14,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:58:14,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:58:14,906 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:58:14,908 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:58:14,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 08:58:14,929 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 08:58:14,929 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 08:58:14,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 08:58:14,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 08:58:14,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 08:58:15,013 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 08:58:15,015 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 08:58:15,295 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live.
[2024-11-07 08:58:15,296 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 08:58:15,311 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 08:58:15,311 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 08:58:15,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:58:15 BoogieIcfgContainer
[2024-11-07 08:58:15,311 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 08:58:15,313 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 08:58:15,313 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 08:58:15,324 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 08:58:15,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:58:14" (1/3) ...
[2024-11-07 08:58:15,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52e73b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:58:15, skipping insertion in model container
[2024-11-07 08:58:15,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:14" (2/3) ...
[2024-11-07 08:58:15,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52e73b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:58:15, skipping insertion in model container
[2024-11-07 08:58:15,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:58:15" (3/3) ...
[2024-11-07 08:58:15,328 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-79.i
[2024-11-07 08:58:15,339 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 08:58:15,340 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 08:58:15,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 08:58:15,388 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;@4bb811d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 08:58:15,388 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 08:58:15,392 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25)
[2024-11-07 08:58:15,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158
[2024-11-07 08:58:15,426 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:58:15,427 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:15,427 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:58:15,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:58:15,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1735044701, now seen corresponding path program 1 times
[2024-11-07 08:58:15,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:58:15,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638063449]
[2024-11-07 08:58:15,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:58:15,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:58:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:15,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:58:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:15,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:58:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:15,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 08:58:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:15,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 08:58:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:15,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 08:58:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:15,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 08:58:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:15,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 08:58:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:15,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-07 08:58:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:15,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-07 08:58:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:15,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-07 08:58:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:15,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-07 08:58:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:15,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-11-07 08:58:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:15,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74
[2024-11-07 08:58:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80
[2024-11-07 08:58:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-07 08:58:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91
[2024-11-07 08:58:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96
[2024-11-07 08:58:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-07 08:58:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107
[2024-11-07 08:58:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-07 08:58:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118
[2024-11-07 08:58:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124
[2024-11-07 08:58:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129
[2024-11-07 08:58:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135
[2024-11-07 08:58:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140
[2024-11-07 08:58:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked.
[2024-11-07 08:58:16,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:58:16,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638063449]
[2024-11-07 08:58:16,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638063449] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:58:16,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:58:16,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 08:58:16,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634009119]
[2024-11-07 08:58:16,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:58:16,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 08:58:16,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:58:16,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 08:58:16,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 08:58:16,122 INFO L87 Difference]: Start difference. First operand has 71 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)
[2024-11-07 08:58:16,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:58:16,185 INFO L93 Difference]: Finished difference Result 199 states and 362 transitions.
[2024-11-07 08:58:16,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 08:58:16,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 157
[2024-11-07 08:58:16,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:58:16,194 INFO L225 Difference]: With dead ends: 199
[2024-11-07 08:58:16,196 INFO L226 Difference]: Without dead ends: 131
[2024-11-07 08:58:16,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 08:58:16,202 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 47 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 08:58:16,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 188 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 08:58:16,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states.
[2024-11-07 08:58:16,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129.
[2024-11-07 08:58:16,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 76 states have (on average 1.263157894736842) internal successors, (96), 76 states have internal predecessors, (96), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50)
[2024-11-07 08:58:16,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 196 transitions.
[2024-11-07 08:58:16,264 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 196 transitions. Word has length 157
[2024-11-07 08:58:16,265 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:58:16,266 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 196 transitions.
[2024-11-07 08:58:16,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)
[2024-11-07 08:58:16,266 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 196 transitions.
[2024-11-07 08:58:16,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159
[2024-11-07 08:58:16,270 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:58:16,270 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:16,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 08:58:16,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:58:16,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:58:16,271 INFO L85 PathProgramCache]: Analyzing trace with hash -762444515, now seen corresponding path program 1 times
[2024-11-07 08:58:16,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:58:16,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578737319]
[2024-11-07 08:58:16,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:58:16,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:58:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:58:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:58:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 08:58:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 08:58:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 08:58:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 08:58:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 08:58:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-07 08:58:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-07 08:58:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-07 08:58:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-07 08:58:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-11-07 08:58:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74
[2024-11-07 08:58:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80
[2024-11-07 08:58:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-07 08:58:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91
[2024-11-07 08:58:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96
[2024-11-07 08:58:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-07 08:58:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107
[2024-11-07 08:58:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-07 08:58:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118
[2024-11-07 08:58:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124
[2024-11-07 08:58:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129
[2024-11-07 08:58:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135
[2024-11-07 08:58:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140
[2024-11-07 08:58:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked.
[2024-11-07 08:58:16,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:58:16,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578737319]
[2024-11-07 08:58:16,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578737319] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:58:16,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:58:16,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 08:58:16,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158741598]
[2024-11-07 08:58:16,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:58:16,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 08:58:16,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:58:16,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 08:58:16,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-07 08:58:16,816 INFO L87 Difference]: Start difference. First operand 129 states and 196 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)
[2024-11-07 08:58:17,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:58:17,028 INFO L93 Difference]: Finished difference Result 271 states and 410 transitions.
[2024-11-07 08:58:17,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 08:58:17,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 158
[2024-11-07 08:58:17,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:58:17,032 INFO L225 Difference]: With dead ends: 271
[2024-11-07 08:58:17,032 INFO L226 Difference]: Without dead ends: 145
[2024-11-07 08:58:17,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-11-07 08:58:17,035 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 92 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 08:58:17,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 323 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 08:58:17,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states.
[2024-11-07 08:58:17,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 129.
[2024-11-07 08:58:17,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50)
[2024-11-07 08:58:17,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 195 transitions.
[2024-11-07 08:58:17,062 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 195 transitions. Word has length 158
[2024-11-07 08:58:17,062 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:58:17,062 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 195 transitions.
[2024-11-07 08:58:17,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)
[2024-11-07 08:58:17,063 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 195 transitions.
[2024-11-07 08:58:17,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160
[2024-11-07 08:58:17,064 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:58:17,067 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:17,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 08:58:17,068 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:58:17,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:58:17,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1054943970, now seen corresponding path program 1 times
[2024-11-07 08:58:17,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:58:17,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058067598]
[2024-11-07 08:58:17,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:58:17,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:58:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:17,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:58:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:17,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:58:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:17,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 08:58:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:17,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 08:58:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:17,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 08:58:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:17,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 08:58:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:17,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 08:58:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:17,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-07 08:58:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:17,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-07 08:58:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:17,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-07 08:58:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:17,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-07 08:58:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:17,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-11-07 08:58:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:17,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74
[2024-11-07 08:58:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:17,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80
[2024-11-07 08:58:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:17,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-07 08:58:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:17,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91
[2024-11-07 08:58:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:17,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96
[2024-11-07 08:58:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:17,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-07 08:58:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:17,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107
[2024-11-07 08:58:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:17,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-07 08:58:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:17,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118
[2024-11-07 08:58:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:17,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124
[2024-11-07 08:58:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:17,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129
[2024-11-07 08:58:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:17,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135
[2024-11-07 08:58:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:17,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140
[2024-11-07 08:58:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:17,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked.
[2024-11-07 08:58:17,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:58:17,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058067598]
[2024-11-07 08:58:17,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058067598] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:58:17,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:58:17,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 08:58:17,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537362229]
[2024-11-07 08:58:17,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:58:17,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 08:58:17,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:58:17,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 08:58:17,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 08:58:17,382 INFO L87 Difference]: Start difference. First operand 129 states and 195 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)
[2024-11-07 08:58:17,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:58:17,423 INFO L93 Difference]: Finished difference Result 271 states and 405 transitions.
[2024-11-07 08:58:17,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 08:58:17,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 159
[2024-11-07 08:58:17,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:58:17,425 INFO L225 Difference]: With dead ends: 271
[2024-11-07 08:58:17,425 INFO L226 Difference]: Without dead ends: 145
[2024-11-07 08:58:17,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 08:58:17,426 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 33 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 08:58:17,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 182 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 08:58:17,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states.
[2024-11-07 08:58:17,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144.
[2024-11-07 08:58:17,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 85 states have (on average 1.2) internal successors, (102), 86 states have internal predecessors, (102), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54)
[2024-11-07 08:58:17,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 210 transitions.
[2024-11-07 08:58:17,460 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 210 transitions. Word has length 159
[2024-11-07 08:58:17,460 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:58:17,460 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 210 transitions.
[2024-11-07 08:58:17,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)
[2024-11-07 08:58:17,460 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 210 transitions.
[2024-11-07 08:58:17,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2024-11-07 08:58:17,465 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:58:17,466 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:17,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 08:58:17,466 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:58:17,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:58:17,466 INFO L85 PathProgramCache]: Analyzing trace with hash -725240290, now seen corresponding path program 1 times
[2024-11-07 08:58:17,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:58:17,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514384863]
[2024-11-07 08:58:17,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:58:17,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:58:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-07 08:58:17,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1248343872]
[2024-11-07 08:58:17,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:58:17,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 08:58:17,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:58:17,558 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:58:17,560 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:58:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 08:58:17,934 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 08:58:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 08:58:18,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 08:58:18,059 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 08:58:18,060 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-07 08:58:18,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-11-07 08:58:18,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 08:58:18,265 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2024-11-07 08:58:18,355 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 08:58:18,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:58:18 BoogieIcfgContainer
[2024-11-07 08:58:18,358 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 08:58:18,358 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 08:58:18,358 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 08:58:18,358 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 08:58:18,359 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:58:15" (3/4) ...
[2024-11-07 08:58:18,367 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-07 08:58:18,367 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 08:58:18,368 INFO L158 Benchmark]: Toolchain (without parser) took 4055.97ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 93.5MB in the beginning and 104.5MB in the end (delta: -11.0MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB.
[2024-11-07 08:58:18,368 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:58:18,368 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.00ms. Allocated memory is still 117.4MB. Free memory was 93.3MB in the beginning and 78.6MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 08:58:18,369 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.47ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 74.7MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:58:18,369 INFO L158 Benchmark]: Boogie Preprocessor took 76.79ms. Allocated memory is still 117.4MB. Free memory was 74.5MB in the beginning and 67.5MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 08:58:18,369 INFO L158 Benchmark]: RCFGBuilder took 438.19ms. Allocated memory is still 117.4MB. Free memory was 67.3MB in the beginning and 45.3MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-07 08:58:18,372 INFO L158 Benchmark]: TraceAbstraction took 3044.37ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 44.9MB in the beginning and 104.5MB in the end (delta: -59.6MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB.
[2024-11-07 08:58:18,373 INFO L158 Benchmark]: Witness Printer took 9.34ms. Allocated memory is still 151.0MB. Free memory was 104.5MB in the beginning and 104.5MB in the end (delta: 22.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 08:58:18,374 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.35ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 383.00ms. Allocated memory is still 117.4MB. Free memory was 93.3MB in the beginning and 78.6MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 93.47ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 74.7MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 76.79ms. Allocated memory is still 117.4MB. Free memory was 74.5MB in the beginning and 67.5MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* RCFGBuilder took 438.19ms. Allocated memory is still 117.4MB. Free memory was 67.3MB in the beginning and 45.3MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* TraceAbstraction took 3044.37ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 44.9MB in the beginning and 104.5MB in the end (delta: -59.6MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB.
* Witness Printer took 9.34ms. Allocated memory is still 151.0MB. Free memory was 104.5MB in the beginning and 104.5MB in the end (delta: 22.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 145, overapproximation of someBinaryFLOATComparisonOperation at line 145.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] signed short int var_1_1 = 2;
[L23] unsigned char var_1_2 = 1;
[L24] unsigned char var_1_3 = 0;
[L25] unsigned char var_1_7 = 50;
[L26] unsigned char var_1_8 = 0;
[L27] double var_1_9 = 127.625;
[L28] double var_1_10 = 256.8;
[L29] double var_1_11 = 0.30000000000000004;
[L30] signed long int var_1_12 = -2;
[L31] double var_1_13 = 2.475;
[L32] double var_1_14 = 25.2;
[L33] double var_1_15 = 500.125;
[L34] double var_1_16 = 10.75;
[L35] double var_1_17 = 255.4;
[L36] unsigned char var_1_18 = 1;
[L37] unsigned char var_1_19 = 0;
[L38] unsigned char var_1_20 = 100;
[L39] unsigned char var_1_21 = 128;
[L40] unsigned char var_1_22 = 0;
[L41] unsigned char var_1_23 = 1;
[L42] unsigned char var_1_24 = 8;
[L43] unsigned char var_1_25 = 10;
[L44] float var_1_26 = 16.8;
[L45] unsigned long int var_1_27 = 64;
[L46] unsigned char last_1_var_1_18 = 1;
[L47] unsigned char last_1_var_1_20 = 100;
VAL [isInitial=0, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L149] isInitial = 1
[L150] FCALL initially()
[L151] COND TRUE 1
[L152] CALL updateLastVariables()
[L141] last_1_var_1_18 = var_1_18
[L142] last_1_var_1_20 = var_1_20
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L152] RET updateLastVariables()
[L153] CALL updateVariables()
[L98] var_1_2 = __VERIFIER_nondet_uchar()
[L99] CALL assume_abort_if_not(var_1_2 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L99] RET assume_abort_if_not(var_1_2 >= 0)
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L100] CALL assume_abort_if_not(var_1_2 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L100] RET assume_abort_if_not(var_1_2 <= 1)
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L101] var_1_3 = __VERIFIER_nondet_uchar()
[L102] CALL assume_abort_if_not(var_1_3 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L102] RET assume_abort_if_not(var_1_3 >= 0)
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L103] CALL assume_abort_if_not(var_1_3 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L103] RET assume_abort_if_not(var_1_3 <= 1)
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L104] var_1_8 = __VERIFIER_nondet_uchar()
[L105] CALL assume_abort_if_not(var_1_8 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_9=1021/8]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_9=1021/8]
[L105] RET assume_abort_if_not(var_1_8 >= 0)
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_9=1021/8]
[L106] CALL assume_abort_if_not(var_1_8 <= 254)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L106] RET assume_abort_if_not(var_1_8 <= 254)
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L107] var_1_10 = __VERIFIER_nondet_double()
[L108] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L108] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L109] var_1_11 = __VERIFIER_nondet_double()
[L110] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L110] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L111] var_1_13 = __VERIFIER_nondet_double()
[L112] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L112] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L113] var_1_14 = __VERIFIER_nondet_double()
[L114] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L114] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L115] var_1_15 = __VERIFIER_nondet_double()
[L116] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L116] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L117] var_1_16 = __VERIFIER_nondet_double()
[L118] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L118] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L119] var_1_17 = __VERIFIER_nondet_double()
[L120] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427387900e+12F && var_1_17 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L120] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427387900e+12F && var_1_17 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L121] var_1_19 = __VERIFIER_nondet_uchar()
[L122] CALL assume_abort_if_not(var_1_19 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L122] RET assume_abort_if_not(var_1_19 >= 0)
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L123] CALL assume_abort_if_not(var_1_19 <= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L123] RET assume_abort_if_not(var_1_19 <= 0)
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L124] var_1_21 = __VERIFIER_nondet_uchar()
[L125] CALL assume_abort_if_not(var_1_21 >= 127)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L125] RET assume_abort_if_not(var_1_21 >= 127)
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L126] CALL assume_abort_if_not(var_1_21 <= 254)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L126] RET assume_abort_if_not(var_1_21 <= 254)
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L127] var_1_22 = __VERIFIER_nondet_uchar()
[L128] CALL assume_abort_if_not(var_1_22 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L128] RET assume_abort_if_not(var_1_22 >= 0)
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L129] CALL assume_abort_if_not(var_1_22 <= 127)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L129] RET assume_abort_if_not(var_1_22 <= 127)
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L130] var_1_23 = __VERIFIER_nondet_uchar()
[L131] CALL assume_abort_if_not(var_1_23 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L131] RET assume_abort_if_not(var_1_23 >= 0)
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L132] CALL assume_abort_if_not(var_1_23 <= 127)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L132] RET assume_abort_if_not(var_1_23 <= 127)
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L133] var_1_24 = __VERIFIER_nondet_uchar()
[L134] CALL assume_abort_if_not(var_1_24 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=0, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=0, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L134] RET assume_abort_if_not(var_1_24 >= 0)
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=0, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L135] CALL assume_abort_if_not(var_1_24 <= 127)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L135] RET assume_abort_if_not(var_1_24 <= 127)
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L136] var_1_25 = __VERIFIER_nondet_uchar()
[L137] CALL assume_abort_if_not(var_1_25 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L137] RET assume_abort_if_not(var_1_25 >= 0)
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L138] CALL assume_abort_if_not(var_1_25 <= 127)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L138] RET assume_abort_if_not(var_1_25 <= 127)
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L153] RET updateVariables()
[L154] CALL step()
[L51] signed long int stepLocal_1 = last_1_var_1_20;
[L52] unsigned char stepLocal_0 = last_1_var_1_18;
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_0=1, stepLocal_1=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L53] COND TRUE stepLocal_0 && last_1_var_1_18
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_1=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8]
[L54] COND FALSE !(((((last_1_var_1_20) < ((last_1_var_1_20 * last_1_var_1_20))) ? (last_1_var_1_20) : ((last_1_var_1_20 * last_1_var_1_20)))) > stepLocal_1)
[L57] var_1_7 = var_1_8
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8]
[L62] COND FALSE !(\read(var_1_3))
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8]
[L67] var_1_26 = var_1_16
[L68] var_1_27 = 10u
[L69] unsigned long int stepLocal_2 = var_1_27;
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_2=10, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8]
[L70] COND TRUE stepLocal_2 != (var_1_8 + var_1_7)
[L71] var_1_9 = ((((var_1_10) < (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))) ? (var_1_10) : (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))))
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3]
[L75] COND TRUE var_1_8 >= var_1_7
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3]
[L76] COND FALSE !(var_1_15 >= var_1_26)
[L79] var_1_20 = var_1_24
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=1, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3]
[L84] COND TRUE \read(var_1_18)
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=1, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3]
[L85] COND FALSE !(! var_1_18)
[L88] var_1_1 = (var_1_20 - var_1_20)
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3]
[L93] COND TRUE (var_1_13 - var_1_14) >= (var_1_15 - (var_1_16 + var_1_17))
[L94] var_1_12 = (var_1_20 + var_1_20)
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3]
[L154] RET step()
[L155] CALL, EXPR property()
[L145-L146] return (((((((var_1_18 ? ((! var_1_18) ? (var_1_1 == ((signed short int) (var_1_7 + 5))) : (var_1_1 == ((signed short int) (var_1_20 - var_1_20)))) : (var_1_1 == ((signed short int) var_1_20))) && ((last_1_var_1_18 && last_1_var_1_18) ? ((((((last_1_var_1_20) < ((last_1_var_1_20 * last_1_var_1_20))) ? (last_1_var_1_20) : ((last_1_var_1_20 * last_1_var_1_20)))) > last_1_var_1_20) ? (var_1_7 == ((unsigned char) var_1_8)) : (var_1_7 == ((unsigned char) var_1_8))) : (var_1_7 == ((unsigned char) var_1_8)))) && ((var_1_27 != (var_1_8 + var_1_7)) ? (var_1_9 == ((double) ((((var_1_10) < (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))) ? (var_1_10) : (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6)))))))) : (var_1_9 == ((double) ((((var_1_11) < (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) ? (var_1_11) : (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))))))))) && (((var_1_13 - var_1_14) >= (var_1_15 - (var_1_16 + var_1_17))) ? (var_1_12 == ((signed long int) (var_1_20 + var_1_20))) : 1)) && (var_1_3 ? (var_1_2 ? (var_1_18 == ((unsigned char) (! var_1_19))) : 1) : 1)) && ((var_1_8 >= var_1_7) ? ((var_1_15 >= var_1_26) ? (var_1_20 == ((unsigned char) (var_1_21 - ((((((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) > (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) ? (((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) : (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))))))) : (var_1_20 == ((unsigned char) var_1_24))) : (var_1_20 == ((unsigned char) var_1_22)))) && (var_1_26 == ((float) var_1_16))) && (var_1_27 == ((unsigned long int) 10u))
;
VAL [\result=0, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3]
[L155] RET, EXPR property()
[L155] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3]
[L19] reach_error()
VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 4, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 172 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 172 mSDsluCounter, 693 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 391 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 93 IncrementalHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 302 mSDtfsCounter, 93 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=3, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 19 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 794 NumberOfCodeBlocks, 794 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 471 ConstructedInterpolants, 0 QuantifiedInterpolants, 709 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 3600/3600 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:58:18,420 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-while_file-79.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 6bbbe2cee8f4695a581c4f71225dc72ba731151283bb1ceb687623e1d215afc7
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 08:58:20,574 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 08:58:20,660 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:58:20,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 08:58:20,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 08:58:20,678 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 08:58:20,679 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 08:58:20,679 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 08:58:20,679 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 08:58:20,679 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 08:58:20,680 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 08:58:20,680 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 08:58:20,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 08:58:20,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 08:58:20,680 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 08:58:20,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 08:58:20,680 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 08:58:20,680 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 08:58:20,680 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 08:58:20,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 08:58:20,681 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 08:58:20,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 08:58:20,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 08:58:20,681 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 08:58:20,681 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-07 08:58:20,681 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 08:58:20,681 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-07 08:58:20,681 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 08:58:20,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 08:58:20,681 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 08:58:20,682 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 08:58:20,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 08:58:20,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 08:58:20,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 08:58:20,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:58:20,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 08:58:20,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 08:58:20,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 08:58:20,682 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-11-07 08:58:20,682 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-07 08:58:20,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 08:58:20,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 08:58:20,682 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 08:58:20,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 08:58:20,682 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 -> 6bbbe2cee8f4695a581c4f71225dc72ba731151283bb1ceb687623e1d215afc7
[2024-11-07 08:58:20,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 08:58:20,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 08:58:20,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 08:58:20,948 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 08:58:20,948 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 08:58:20,949 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-while_file-79.i
[2024-11-07 08:58:22,231 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 08:58:22,456 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 08:58:22,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-79.i
[2024-11-07 08:58:22,464 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc773def9/1ba4ead8d64b4c5e91d3a624c16b3417/FLAG8d6399baa
[2024-11-07 08:58:22,802 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc773def9/1ba4ead8d64b4c5e91d3a624c16b3417
[2024-11-07 08:58:22,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 08:58:22,806 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 08:58:22,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 08:58:22,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 08:58:22,810 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 08:58:22,811 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:58:22" (1/1) ...
[2024-11-07 08:58:22,812 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ff534be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:22, skipping insertion in model container
[2024-11-07 08:58:22,812 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:58:22" (1/1) ...
[2024-11-07 08:58:22,829 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 08:58:22,933 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-while_file-79.i[915,928]
[2024-11-07 08:58:22,998 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:58:23,012 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 08:58:23,019 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-while_file-79.i[915,928]
[2024-11-07 08:58:23,037 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:58:23,049 INFO L204 MainTranslator]: Completed translation
[2024-11-07 08:58:23,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:23 WrapperNode
[2024-11-07 08:58:23,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 08:58:23,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 08:58:23,051 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 08:58:23,051 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 08:58:23,055 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:58:23" (1/1) ...
[2024-11-07 08:58:23,065 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:58:23" (1/1) ...
[2024-11-07 08:58:23,098 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 163
[2024-11-07 08:58:23,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 08:58:23,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 08:58:23,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 08:58:23,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 08:58:23,106 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:23" (1/1) ...
[2024-11-07 08:58:23,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:23" (1/1) ...
[2024-11-07 08:58:23,114 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:23" (1/1) ...
[2024-11-07 08:58:23,132 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:58:23,132 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:23" (1/1) ...
[2024-11-07 08:58:23,132 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:23" (1/1) ...
[2024-11-07 08:58:23,147 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:23" (1/1) ...
[2024-11-07 08:58:23,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:23" (1/1) ...
[2024-11-07 08:58:23,155 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:23" (1/1) ...
[2024-11-07 08:58:23,156 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:23" (1/1) ...
[2024-11-07 08:58:23,159 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 08:58:23,160 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 08:58:23,160 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 08:58:23,160 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 08:58:23,163 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:23" (1/1) ...
[2024-11-07 08:58:23,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:58:23,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:58:23,192 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:58:23,195 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:58:23,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 08:58:23,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-07 08:58:23,212 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 08:58:23,212 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 08:58:23,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 08:58:23,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 08:58:23,278 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 08:58:23,280 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 08:58:31,093 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live.
[2024-11-07 08:58:31,093 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 08:58:31,101 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 08:58:31,103 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 08:58:31,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:58:31 BoogieIcfgContainer
[2024-11-07 08:58:31,104 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 08:58:31,107 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 08:58:31,107 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 08:58:31,110 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 08:58:31,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:58:22" (1/3) ...
[2024-11-07 08:58:31,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403b6487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:58:31, skipping insertion in model container
[2024-11-07 08:58:31,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:23" (2/3) ...
[2024-11-07 08:58:31,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403b6487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:58:31, skipping insertion in model container
[2024-11-07 08:58:31,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:58:31" (3/3) ...
[2024-11-07 08:58:31,114 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-79.i
[2024-11-07 08:58:31,125 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 08:58:31,127 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 08:58:31,171 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 08:58:31,179 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;@35d36172, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 08:58:31,180 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 08:58:31,183 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25)
[2024-11-07 08:58:31,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158
[2024-11-07 08:58:31,192 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:58:31,193 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:31,193 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:58:31,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:58:31,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1735044701, now seen corresponding path program 1 times
[2024-11-07 08:58:31,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:58:31,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312851363]
[2024-11-07 08:58:31,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:58:31,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 08:58:31,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:58:31,207 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 08:58:31,209 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:58:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:31,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 08:58:31,605 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:58:32,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked.
[2024-11-07 08:58:32,598 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 08:58:32,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 08:58:32,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312851363]
[2024-11-07 08:58:32,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [312851363] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:58:32,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:58:32,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 08:58:32,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265492954]
[2024-11-07 08:58:32,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:58:32,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 08:58:32,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 08:58:32,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 08:58:32,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-07 08:58:32,634 INFO L87 Difference]: Start difference. First operand has 71 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)
[2024-11-07 08:58:37,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 08:58:37,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:58:37,543 INFO L93 Difference]: Finished difference Result 213 states and 385 transitions.
[2024-11-07 08:58:37,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 08:58:37,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 157
[2024-11-07 08:58:37,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:58:37,550 INFO L225 Difference]: With dead ends: 213
[2024-11-07 08:58:37,550 INFO L226 Difference]: Without dead ends: 145
[2024-11-07 08:58:37,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-11-07 08:58:37,553 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 89 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 53 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time
[2024-11-07 08:58:37,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 323 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 74 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time]
[2024-11-07 08:58:37,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states.
[2024-11-07 08:58:37,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 129.
[2024-11-07 08:58:37,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50)
[2024-11-07 08:58:37,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 195 transitions.
[2024-11-07 08:58:37,602 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 195 transitions. Word has length 157
[2024-11-07 08:58:37,602 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:58:37,603 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 195 transitions.
[2024-11-07 08:58:37,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)
[2024-11-07 08:58:37,603 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 195 transitions.
[2024-11-07 08:58:37,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160
[2024-11-07 08:58:37,605 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:58:37,605 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:37,622 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:58:37,809 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:58:37,810 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:58:37,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:58:37,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1054943970, now seen corresponding path program 1 times
[2024-11-07 08:58:37,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:58:37,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934113889]
[2024-11-07 08:58:37,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:58:37,811 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:58:37,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:58:37,815 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:58:37,816 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:58:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:38,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-07 08:58:38,161 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:58:38,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked.
[2024-11-07 08:58:38,212 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 08:58:38,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 08:58:38,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934113889]
[2024-11-07 08:58:38,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1934113889] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:58:38,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:58:38,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 08:58:38,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320252046]
[2024-11-07 08:58:38,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:58:38,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 08:58:38,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 08:58:38,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 08:58:38,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 08:58:38,215 INFO L87 Difference]: Start difference. First operand 129 states and 195 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)
[2024-11-07 08:58:42,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 08:58:42,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:58:42,394 INFO L93 Difference]: Finished difference Result 271 states and 405 transitions.
[2024-11-07 08:58:42,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 08:58:42,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 159
[2024-11-07 08:58:42,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:58:42,397 INFO L225 Difference]: With dead ends: 271
[2024-11-07 08:58:42,397 INFO L226 Difference]: Without dead ends: 145
[2024-11-07 08:58:42,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 08:58:42,398 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 33 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time
[2024-11-07 08:58:42,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 181 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time]
[2024-11-07 08:58:42,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states.
[2024-11-07 08:58:42,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144.
[2024-11-07 08:58:42,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 85 states have (on average 1.2) internal successors, (102), 86 states have internal predecessors, (102), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54)
[2024-11-07 08:58:42,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 210 transitions.
[2024-11-07 08:58:42,417 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 210 transitions. Word has length 159
[2024-11-07 08:58:42,417 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:58:42,417 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 210 transitions.
[2024-11-07 08:58:42,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)
[2024-11-07 08:58:42,418 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 210 transitions.
[2024-11-07 08:58:42,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2024-11-07 08:58:42,419 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:58:42,419 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:42,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0
[2024-11-07 08:58:42,623 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:58:42,623 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:58:42,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:58:42,624 INFO L85 PathProgramCache]: Analyzing trace with hash -725240290, now seen corresponding path program 1 times
[2024-11-07 08:58:42,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:58:42,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948267065]
[2024-11-07 08:58:42,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:58:42,624 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:58:42,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:58:42,627 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:58:42,634 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:58:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:58:43,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 29 conjuncts are in the unsatisfiable core
[2024-11-07 08:58:43,050 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:59:50,030 WARN L286 SmtUtils]: Spent 5.94s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)