./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 4f9af400
extending candidate: java
['java']
extending candidate: /usr/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/oracle-jdk-bin-*/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/openjdk-*/bin/java
['java', '/usr/bin/java']
extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java
['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java']
['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.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', 'a669ebd5fed72ed6e42c2671940b4f9ab523443b9c3d9ff6be31e4f909568725']
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.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 a669ebd5fed72ed6e42c2671940b4f9ab523443b9c3d9ff6be31e4f909568725
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 08:18:22,262 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 08:18:22,338 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:18:22,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 08:18:22,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 08:18:22,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 08:18:22,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 08:18:22,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 08:18:22,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 08:18:22,376 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 08:18:22,376 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 08:18:22,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 08:18:22,377 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 08:18:22,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 08:18:22,378 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 08:18:22,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 08:18:22,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 08:18:22,378 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 08:18:22,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 08:18:22,378 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 08:18:22,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 08:18:22,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 08:18:22,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 08:18:22,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 08:18:22,379 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 08:18:22,379 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 08:18:22,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 08:18:22,380 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 08:18:22,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 08:18:22,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 08:18:22,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 08:18:22,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 08:18:22,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:18:22,381 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 08:18:22,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 08:18:22,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 08:18:22,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 08:18:22,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 08:18:22,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 08:18:22,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 08:18:22,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 08:18:22,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 08:18:22,382 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 -> a669ebd5fed72ed6e42c2671940b4f9ab523443b9c3d9ff6be31e4f909568725
[2024-11-07 08:18:22,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 08:18:22,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 08:18:22,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 08:18:22,640 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 08:18:22,641 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 08:18:22,642 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.i
[2024-11-07 08:18:23,889 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 08:18:24,189 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 08:18:24,191 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.i
[2024-11-07 08:18:24,199 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27f1e9d20/48f377a79a8445568924188edcce54ef/FLAGa9b5921c4
[2024-11-07 08:18:24,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27f1e9d20/48f377a79a8445568924188edcce54ef
[2024-11-07 08:18:24,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 08:18:24,485 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 08:18:24,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 08:18:24,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 08:18:24,489 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 08:18:24,490 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:18:24" (1/1) ...
[2024-11-07 08:18:24,490 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1be15267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:24, skipping insertion in model container
[2024-11-07 08:18:24,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:18:24" (1/1) ...
[2024-11-07 08:18:24,503 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 08:18:24,612 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.i[915,928]
[2024-11-07 08:18:24,653 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:18:24,663 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 08:18:24,672 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.i[915,928]
[2024-11-07 08:18:24,696 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:18:24,710 INFO L204 MainTranslator]: Completed translation
[2024-11-07 08:18:24,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:24 WrapperNode
[2024-11-07 08:18:24,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 08:18:24,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 08:18:24,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 08:18:24,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 08:18:24,718 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:18:24" (1/1) ...
[2024-11-07 08:18:24,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:18:24" (1/1) ...
[2024-11-07 08:18:24,770 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97
[2024-11-07 08:18:24,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 08:18:24,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 08:18:24,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 08:18:24,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 08:18:24,785 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:24" (1/1) ...
[2024-11-07 08:18:24,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:24" (1/1) ...
[2024-11-07 08:18:24,788 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:24" (1/1) ...
[2024-11-07 08:18:24,807 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:18:24,808 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:24" (1/1) ...
[2024-11-07 08:18:24,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:24" (1/1) ...
[2024-11-07 08:18:24,817 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:24" (1/1) ...
[2024-11-07 08:18:24,823 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:24" (1/1) ...
[2024-11-07 08:18:24,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:24" (1/1) ...
[2024-11-07 08:18:24,825 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:24" (1/1) ...
[2024-11-07 08:18:24,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 08:18:24,833 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 08:18:24,833 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 08:18:24,833 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 08:18:24,834 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:24" (1/1) ...
[2024-11-07 08:18:24,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:18:24,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:18:24,870 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:18:24,876 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:18:24,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 08:18:24,895 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 08:18:24,895 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 08:18:24,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 08:18:24,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 08:18:24,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 08:18:24,968 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 08:18:24,970 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 08:18:25,160 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live.
[2024-11-07 08:18:25,160 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 08:18:25,168 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 08:18:25,168 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 08:18:25,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:18:25 BoogieIcfgContainer
[2024-11-07 08:18:25,168 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 08:18:25,170 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 08:18:25,170 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 08:18:25,175 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 08:18:25,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:18:24" (1/3) ...
[2024-11-07 08:18:25,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab25ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:18:25, skipping insertion in model container
[2024-11-07 08:18:25,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:24" (2/3) ...
[2024-11-07 08:18:25,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab25ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:18:25, skipping insertion in model container
[2024-11-07 08:18:25,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:18:25" (3/3) ...
[2024-11-07 08:18:25,179 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-21.i
[2024-11-07 08:18:25,191 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 08:18:25,192 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 08:18:25,230 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 08:18:25,239 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;@324cd290, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 08:18:25,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 08:18:25,244 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 31 states have internal predecessors, (41), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2024-11-07 08:18:25,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2024-11-07 08:18:25,250 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:18:25,251 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:25,251 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:18:25,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:18:25,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1615810170, now seen corresponding path program 1 times
[2024-11-07 08:18:25,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:18:25,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146922560]
[2024-11-07 08:18:25,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:18:25,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:18:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:18:25,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:18:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:18:25,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:18:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:18:25,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 08:18:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:18:25,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 08:18:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:18:25,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 08:18:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:18:25,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-07 08:18:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:18:25,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-07 08:18:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:18:25,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-07 08:18:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:18:25,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-07 08:18:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:18:25,680 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked.
[2024-11-07 08:18:25,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:18:25,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146922560]
[2024-11-07 08:18:25,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146922560] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:18:25,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:18:25,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 08:18:25,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819986804]
[2024-11-07 08:18:25,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:18:25,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 08:18:25,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:18:25,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 08:18:25,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 08:18:25,723 INFO L87 Difference]: Start difference. First operand has 42 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 31 states have internal predecessors, (41), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9)
[2024-11-07 08:18:25,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:18:25,762 INFO L93 Difference]: Finished difference Result 81 states and 124 transitions.
[2024-11-07 08:18:25,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 08:18:25,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64
[2024-11-07 08:18:25,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:18:25,769 INFO L225 Difference]: With dead ends: 81
[2024-11-07 08:18:25,771 INFO L226 Difference]: Without dead ends: 38
[2024-11-07 08:18:25,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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:18:25,777 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 08:18:25,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 08:18:25,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states.
[2024-11-07 08:18:25,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38.
[2024-11-07 08:18:25,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2024-11-07 08:18:25,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions.
[2024-11-07 08:18:25,810 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 64
[2024-11-07 08:18:25,811 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:18:25,812 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions.
[2024-11-07 08:18:25,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9)
[2024-11-07 08:18:25,813 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions.
[2024-11-07 08:18:25,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2024-11-07 08:18:25,815 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:18:25,815 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:25,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 08:18:25,816 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:18:25,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:18:25,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1673068472, now seen corresponding path program 1 times
[2024-11-07 08:18:25,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:18:25,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296356019]
[2024-11-07 08:18:25,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:18:25,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:18:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:18:27,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:18:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:18:27,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:18:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:18:27,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 08:18:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:18:27,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 08:18:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:18:27,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 08:18:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:18:27,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-07 08:18:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:18:27,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-07 08:18:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:18:27,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-07 08:18:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:18:27,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-07 08:18:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:18:27,590 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked.
[2024-11-07 08:18:27,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:18:27,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296356019]
[2024-11-07 08:18:27,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296356019] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:18:27,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:18:27,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 08:18:27,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135712132]
[2024-11-07 08:18:27,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:18:27,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 08:18:27,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:18:27,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 08:18:27,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-11-07 08:18:27,593 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9)
[2024-11-07 08:18:28,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:18:28,594 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions.
[2024-11-07 08:18:28,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 08:18:28,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64
[2024-11-07 08:18:28,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:18:28,596 INFO L225 Difference]: With dead ends: 80
[2024-11-07 08:18:28,597 INFO L226 Difference]: Without dead ends: 78
[2024-11-07 08:18:28,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-11-07 08:18:28,599 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 42 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 08:18:28,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 332 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 08:18:28,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states.
[2024-11-07 08:18:28,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71.
[2024-11-07 08:18:28,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-07 08:18:28,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions.
[2024-11-07 08:18:28,620 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 64
[2024-11-07 08:18:28,621 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:18:28,621 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions.
[2024-11-07 08:18:28,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9)
[2024-11-07 08:18:28,621 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions.
[2024-11-07 08:18:28,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2024-11-07 08:18:28,623 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:18:28,623 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:28,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 08:18:28,625 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:18:28,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:18:28,627 INFO L85 PathProgramCache]: Analyzing trace with hash -752053712, now seen corresponding path program 1 times
[2024-11-07 08:18:28,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:18:28,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980308610]
[2024-11-07 08:18:28,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:18:28,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:18:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-07 08:18:28,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [897106351]
[2024-11-07 08:18:28,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:18:28,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 08:18:28,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:18:28,697 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:18:28,700 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:18:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 08:18:28,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 08:18:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 08:18:28,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 08:18:28,891 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 08:18:28,892 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-07 08:18:28,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-07 08:18:29,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 08:18:29,097 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2024-11-07 08:18:29,157 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 08:18:29,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:18:29 BoogieIcfgContainer
[2024-11-07 08:18:29,162 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 08:18:29,163 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 08:18:29,164 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 08:18:29,164 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 08:18:29,165 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:18:25" (3/4) ...
[2024-11-07 08:18:29,167 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-07 08:18:29,167 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 08:18:29,168 INFO L158 Benchmark]: Toolchain (without parser) took 4682.63ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 76.8MB in the beginning and 77.0MB in the end (delta: -229.0kB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB.
[2024-11-07 08:18:29,170 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 83.9MB. Free memory is still 46.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:18:29,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.52ms. Allocated memory is still 100.7MB. Free memory was 76.6MB in the beginning and 64.1MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 08:18:29,171 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.44ms. Allocated memory is still 100.7MB. Free memory was 64.1MB in the beginning and 62.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 08:18:29,171 INFO L158 Benchmark]: Boogie Preprocessor took 60.71ms. Allocated memory is still 100.7MB. Free memory was 62.0MB in the beginning and 59.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:18:29,171 INFO L158 Benchmark]: RCFGBuilder took 335.42ms. Allocated memory is still 100.7MB. Free memory was 59.6MB in the beginning and 45.6MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 08:18:29,171 INFO L158 Benchmark]: TraceAbstraction took 3992.20ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 45.0MB in the beginning and 77.0MB in the end (delta: -32.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:18:29,173 INFO L158 Benchmark]: Witness Printer took 4.04ms. Allocated memory is still 125.8MB. Free memory was 77.0MB in the beginning and 77.0MB in the end (delta: 22.6kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:18:29,174 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.30ms. Allocated memory is still 83.9MB. Free memory is still 46.6MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 224.52ms. Allocated memory is still 100.7MB. Free memory was 76.6MB in the beginning and 64.1MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 59.44ms. Allocated memory is still 100.7MB. Free memory was 64.1MB in the beginning and 62.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 60.71ms. Allocated memory is still 100.7MB. Free memory was 62.0MB in the beginning and 59.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 335.42ms. Allocated memory is still 100.7MB. Free memory was 59.6MB in the beginning and 45.6MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* TraceAbstraction took 3992.20ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 45.0MB in the beginning and 77.0MB in the end (delta: -32.0MB). There was no memory consumed. Max. memory is 16.1GB.
* Witness Printer took 4.04ms. Allocated memory is still 125.8MB. Free memory was 77.0MB in the beginning and 77.0MB in the end (delta: 22.6kB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 85.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] unsigned short int var_1_1 = 32;
[L23] unsigned char var_1_7 = 1;
[L24] signed char var_1_8 = -32;
[L25] signed char var_1_9 = -8;
[L26] unsigned char var_1_10 = 2;
[L27] double var_1_11 = 15.6;
[L28] double var_1_12 = 15.4;
[L29] double var_1_13 = 32.2;
[L30] unsigned char var_1_14 = 5;
[L31] unsigned short int last_1_var_1_1 = 32;
[L32] signed char last_1_var_1_8 = -32;
[L33] unsigned char last_1_var_1_10 = 2;
VAL [isInitial=0, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=-8]
[L89] isInitial = 1
[L90] FCALL initially()
[L91] int k_loop;
[L92] k_loop = 0
VAL [isInitial=1, k_loop=0, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=-8]
[L92] COND TRUE k_loop < 1
[L93] CALL updateLastVariables()
[L80] last_1_var_1_1 = var_1_1
[L81] last_1_var_1_8 = var_1_8
[L82] last_1_var_1_10 = var_1_10
VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=-8]
[L93] RET updateLastVariables()
[L94] CALL updateVariables()
[L63] var_1_7 = __VERIFIER_nondet_uchar()
[L64] CALL assume_abort_if_not(var_1_7 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_8=-32, var_1_9=-8]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_8=-32, var_1_9=-8]
[L64] RET assume_abort_if_not(var_1_7 >= 0)
VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_8=-32, var_1_9=-8]
[L65] CALL assume_abort_if_not(var_1_7 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=-8]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=-8]
[L65] RET assume_abort_if_not(var_1_7 <= 1)
VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=-8]
[L66] var_1_9 = __VERIFIER_nondet_char()
[L67] CALL assume_abort_if_not(var_1_9 >= -126)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0]
[L67] RET assume_abort_if_not(var_1_9 >= -126)
VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0]
[L68] CALL assume_abort_if_not(var_1_9 <= 126)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0]
[L68] RET assume_abort_if_not(var_1_9 <= 126)
VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0]
[L69] var_1_11 = __VERIFIER_nondet_double()
[L70] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0]
[L70] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0]
[L71] var_1_12 = __VERIFIER_nondet_double()
[L72] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0]
[L72] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0]
[L73] var_1_13 = __VERIFIER_nondet_double()
[L74] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && 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_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0]
[L74] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && 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_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0]
[L75] var_1_14 = __VERIFIER_nondet_uchar()
[L76] CALL assume_abort_if_not(var_1_14 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0]
[L76] RET assume_abort_if_not(var_1_14 >= 0)
VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0]
[L77] CALL assume_abort_if_not(var_1_14 <= 254)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=0, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=0, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0]
[L77] RET assume_abort_if_not(var_1_14 <= 254)
VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=0, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0]
[L94] RET updateVariables()
[L95] CALL step()
[L37] signed long int stepLocal_2 = (((last_1_var_1_8) < (last_1_var_1_8)) ? (last_1_var_1_8) : (last_1_var_1_8));
[L38] unsigned char stepLocal_1 = var_1_7;
VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_1=1, stepLocal_2=-32, var_1_10=2, var_1_14=0, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0]
[L39] COND TRUE ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) <= var_1_13
VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_1=1, stepLocal_2=-32, var_1_10=2, var_1_14=0, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0]
[L40] COND FALSE !(stepLocal_1 && (last_1_var_1_8 >= var_1_9))
VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_2=-32, var_1_10=2, var_1_14=0, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0]
[L48] signed long int stepLocal_0 = ((((- last_1_var_1_10)) > (last_1_var_1_10)) ? ((- last_1_var_1_10)) : (last_1_var_1_10));
VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_0=2, stepLocal_2=-32, var_1_10=2, var_1_14=0, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0]
[L49] COND FALSE !(last_1_var_1_10 < stepLocal_0)
[L52] var_1_8 = var_1_9
VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_2=-32, var_1_10=2, var_1_14=0, var_1_1=32, var_1_7=1, var_1_8=0, var_1_9=0]
[L54] COND FALSE !((var_1_10 + ((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10)))) < (var_1_10 * var_1_8))
[L59] var_1_1 = var_1_10
VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_2=-32, var_1_10=2, var_1_14=0, var_1_1=2, var_1_7=1, var_1_8=0, var_1_9=0]
[L95] RET step()
[L96] CALL, EXPR property()
[L85-L86] return ((((var_1_10 + ((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10)))) < (var_1_10 * var_1_8)) ? (var_1_7 ? (var_1_1 == ((unsigned short int) var_1_10)) : 1) : (var_1_1 == ((unsigned short int) var_1_10))) && ((last_1_var_1_10 < (((((- last_1_var_1_10)) > (last_1_var_1_10)) ? ((- last_1_var_1_10)) : (last_1_var_1_10)))) ? (var_1_8 == ((signed char) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_8 == ((signed char) var_1_9)))) && ((((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) <= var_1_13) ? ((var_1_7 && (last_1_var_1_8 >= var_1_9)) ? ((last_1_var_1_1 <= ((((last_1_var_1_8) < (last_1_var_1_8)) ? (last_1_var_1_8) : (last_1_var_1_8)))) ? (var_1_10 == ((unsigned char) var_1_14)) : 1) : 1) : (var_1_10 == ((unsigned char) var_1_14)))
;
VAL [\result=0, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=0, var_1_1=2, var_1_7=1, var_1_8=0, var_1_9=0]
[L96] RET, EXPR property()
[L96] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=0, var_1_1=2, var_1_7=1, var_1_8=0, var_1_9=0]
[L19] reach_error()
VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=0, var_1_1=2, var_1_7=1, var_1_8=0, var_1_9=0]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 3, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 435 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 311 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 108 IncrementalHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 124 mSDtfsCounter, 108 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=2, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 244 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 288/288 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:18:29,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.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 a669ebd5fed72ed6e42c2671940b4f9ab523443b9c3d9ff6be31e4f909568725
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 08:18:31,291 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 08:18:31,379 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:18:31,385 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 08:18:31,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 08:18:31,427 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 08:18:31,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 08:18:31,430 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 08:18:31,430 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 08:18:31,431 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 08:18:31,431 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 08:18:31,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 08:18:31,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 08:18:31,432 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 08:18:31,432 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 08:18:31,433 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 08:18:31,433 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 08:18:31,433 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 08:18:31,433 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 08:18:31,434 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 08:18:31,434 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 08:18:31,434 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 08:18:31,434 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 08:18:31,434 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 08:18:31,435 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-07 08:18:31,435 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 08:18:31,435 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-07 08:18:31,435 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 08:18:31,435 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 08:18:31,435 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 08:18:31,435 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 08:18:31,435 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 08:18:31,436 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 08:18:31,436 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 08:18:31,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:18:31,436 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 08:18:31,437 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 08:18:31,437 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 08:18:31,437 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-11-07 08:18:31,437 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-07 08:18:31,437 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 08:18:31,437 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 08:18:31,437 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 08:18:31,438 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 08:18:31,438 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 -> a669ebd5fed72ed6e42c2671940b4f9ab523443b9c3d9ff6be31e4f909568725
[2024-11-07 08:18:31,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 08:18:31,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 08:18:31,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 08:18:31,737 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 08:18:31,737 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 08:18:31,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.i
[2024-11-07 08:18:33,127 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 08:18:33,361 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 08:18:33,363 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.i
[2024-11-07 08:18:33,371 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec4b61ce0/f487a79ef76841d9827035432ca72402/FLAG628d6b0d8
[2024-11-07 08:18:33,390 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec4b61ce0/f487a79ef76841d9827035432ca72402
[2024-11-07 08:18:33,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 08:18:33,394 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 08:18:33,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 08:18:33,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 08:18:33,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 08:18:33,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:18:33" (1/1) ...
[2024-11-07 08:18:33,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d71c6a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:33, skipping insertion in model container
[2024-11-07 08:18:33,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:18:33" (1/1) ...
[2024-11-07 08:18:33,420 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 08:18:33,553 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.i[915,928]
[2024-11-07 08:18:33,602 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:18:33,619 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 08:18:33,629 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.i[915,928]
[2024-11-07 08:18:33,650 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:18:33,667 INFO L204 MainTranslator]: Completed translation
[2024-11-07 08:18:33,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:33 WrapperNode
[2024-11-07 08:18:33,668 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 08:18:33,670 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 08:18:33,670 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 08:18:33,670 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 08:18:33,677 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:18:33" (1/1) ...
[2024-11-07 08:18:33,692 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:18:33" (1/1) ...
[2024-11-07 08:18:33,718 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96
[2024-11-07 08:18:33,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 08:18:33,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 08:18:33,723 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 08:18:33,723 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 08:18:33,731 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:33" (1/1) ...
[2024-11-07 08:18:33,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:33" (1/1) ...
[2024-11-07 08:18:33,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:33" (1/1) ...
[2024-11-07 08:18:33,750 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:18:33,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:33" (1/1) ...
[2024-11-07 08:18:33,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:33" (1/1) ...
[2024-11-07 08:18:33,762 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:33" (1/1) ...
[2024-11-07 08:18:33,768 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:33" (1/1) ...
[2024-11-07 08:18:33,770 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:33" (1/1) ...
[2024-11-07 08:18:33,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:33" (1/1) ...
[2024-11-07 08:18:33,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 08:18:33,777 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 08:18:33,780 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 08:18:33,780 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 08:18:33,781 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:33" (1/1) ...
[2024-11-07 08:18:33,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:18:33,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:18:33,815 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:18:33,822 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:18:33,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 08:18:33,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-07 08:18:33,842 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 08:18:33,843 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 08:18:33,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 08:18:33,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 08:18:33,920 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 08:18:33,922 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 08:18:34,165 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live.
[2024-11-07 08:18:34,165 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 08:18:34,173 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 08:18:34,174 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 08:18:34,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:18:34 BoogieIcfgContainer
[2024-11-07 08:18:34,175 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 08:18:34,178 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 08:18:34,178 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 08:18:34,183 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 08:18:34,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:18:33" (1/3) ...
[2024-11-07 08:18:34,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613ab79c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:18:34, skipping insertion in model container
[2024-11-07 08:18:34,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:33" (2/3) ...
[2024-11-07 08:18:34,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613ab79c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:18:34, skipping insertion in model container
[2024-11-07 08:18:34,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:18:34" (3/3) ...
[2024-11-07 08:18:34,186 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-21.i
[2024-11-07 08:18:34,205 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 08:18:34,206 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 08:18:34,256 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 08:18:34,266 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;@761610d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 08:18:34,267 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 08:18:34,272 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 31 states have internal predecessors, (41), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2024-11-07 08:18:34,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2024-11-07 08:18:34,280 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:18:34,281 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:34,281 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:18:34,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:18:34,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1615810170, now seen corresponding path program 1 times
[2024-11-07 08:18:34,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:18:34,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561492720]
[2024-11-07 08:18:34,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:18:34,300 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:18:34,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:18:34,303 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:18:34,323 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:18:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:18:34,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 08:18:34,473 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:18:34,721 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked.
[2024-11-07 08:18:34,721 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 08:18:34,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 08:18:34,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561492720]
[2024-11-07 08:18:34,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561492720] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:18:34,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:18:34,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 08:18:34,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120756126]
[2024-11-07 08:18:34,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:18:34,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 08:18:34,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 08:18:34,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 08:18:34,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-07 08:18:34,743 INFO L87 Difference]: Start difference. First operand has 42 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 31 states have internal predecessors, (41), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9)
[2024-11-07 08:18:35,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:18:35,019 INFO L93 Difference]: Finished difference Result 136 states and 210 transitions.
[2024-11-07 08:18:35,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 08:18:35,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64
[2024-11-07 08:18:35,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:18:35,027 INFO L225 Difference]: With dead ends: 136
[2024-11-07 08:18:35,027 INFO L226 Difference]: Without dead ends: 85
[2024-11-07 08:18:35,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 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:18:35,031 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 59 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 08:18:35,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 189 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 08:18:35,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states.
[2024-11-07 08:18:35,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73.
[2024-11-07 08:18:35,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2024-11-07 08:18:35,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions.
[2024-11-07 08:18:35,086 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 64
[2024-11-07 08:18:35,086 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:18:35,086 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions.
[2024-11-07 08:18:35,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9)
[2024-11-07 08:18:35,087 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions.
[2024-11-07 08:18:35,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2024-11-07 08:18:35,088 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:18:35,088 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:35,094 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:18:35,289 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:18:35,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:18:35,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:18:35,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1673068472, now seen corresponding path program 1 times
[2024-11-07 08:18:35,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:18:35,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814087759]
[2024-11-07 08:18:35,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:18:35,291 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:18:35,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:18:35,295 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:18:35,296 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:18:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:18:35,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-07 08:18:35,406 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:19:03,463 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked.
[2024-11-07 08:19:03,464 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 08:19:03,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 08:19:03,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [814087759]
[2024-11-07 08:19:03,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [814087759] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:19:03,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:19:03,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-07 08:19:03,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850206266]
[2024-11-07 08:19:03,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:19:03,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-07 08:19:03,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 08:19:03,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-07 08:19:03,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-11-07 08:19:03,469 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9)
[2024-11-07 08:19:03,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:19:03,870 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions.
[2024-11-07 08:19:03,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-07 08:19:03,872 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64
[2024-11-07 08:19:03,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:19:03,873 INFO L225 Difference]: With dead ends: 129
[2024-11-07 08:19:03,873 INFO L226 Difference]: Without dead ends: 127
[2024-11-07 08:19:03,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132
[2024-11-07 08:19:03,875 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 60 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 08:19:03,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 246 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 08:19:03,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states.
[2024-11-07 08:19:03,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 103.
[2024-11-07 08:19:03,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 72 states have internal predecessors, (89), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27)
[2024-11-07 08:19:03,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 143 transitions.
[2024-11-07 08:19:03,893 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 143 transitions. Word has length 64
[2024-11-07 08:19:03,893 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:19:03,894 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 143 transitions.
[2024-11-07 08:19:03,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9)
[2024-11-07 08:19:03,894 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 143 transitions.
[2024-11-07 08:19:03,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2024-11-07 08:19:03,895 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:19:03,895 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:03,901 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:19:04,096 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:19:04,096 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:19:04,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:19:04,097 INFO L85 PathProgramCache]: Analyzing trace with hash -752053712, now seen corresponding path program 1 times
[2024-11-07 08:19:04,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:19:04,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904141733]
[2024-11-07 08:19:04,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:19:04,097 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:19:04,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:19:04,099 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:19:04,100 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:19:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:19:04,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-07 08:19:04,204 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:19:27,352 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked.
[2024-11-07 08:19:27,352 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 08:19:27,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 08:19:27,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904141733]
[2024-11-07 08:19:27,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904141733] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:19:27,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:19:27,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-07 08:19:27,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982270900]
[2024-11-07 08:19:27,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:19:27,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-07 08:19:27,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 08:19:27,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-07 08:19:27,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-11-07 08:19:27,354 INFO L87 Difference]: Start difference. First operand 103 states and 143 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9)
[2024-11-07 08:19:28,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:19:28,256 INFO L93 Difference]: Finished difference Result 127 states and 168 transitions.
[2024-11-07 08:19:28,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-07 08:19:28,257 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 65
[2024-11-07 08:19:28,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:19:28,290 INFO L225 Difference]: With dead ends: 127
[2024-11-07 08:19:28,290 INFO L226 Difference]: Without dead ends: 125
[2024-11-07 08:19:28,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156
[2024-11-07 08:19:28,291 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 63 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-07 08:19:28,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 268 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-07 08:19:28,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states.
[2024-11-07 08:19:28,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 113.
[2024-11-07 08:19:28,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 81 states have internal predecessors, (99), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27)
[2024-11-07 08:19:28,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 153 transitions.
[2024-11-07 08:19:28,314 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 153 transitions. Word has length 65
[2024-11-07 08:19:28,314 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:19:28,314 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 153 transitions.
[2024-11-07 08:19:28,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9)
[2024-11-07 08:19:28,314 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 153 transitions.
[2024-11-07 08:19:28,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2024-11-07 08:19:28,316 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:19:28,316 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:28,321 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 (4)] Ended with exit code 0
[2024-11-07 08:19:28,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:19:28,517 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:19:28,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:19:28,517 INFO L85 PathProgramCache]: Analyzing trace with hash 89954773, now seen corresponding path program 1 times
[2024-11-07 08:19:28,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:19:28,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244466838]
[2024-11-07 08:19:28,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:19:28,518 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:19:28,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:19:28,520 INFO L229 MonitoredProcess]: Starting monitored process 5 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:19:28,521 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 (5)] Waiting until timeout for monitored process
[2024-11-07 08:19:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:19:28,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-07 08:19:28,614 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:19:51,350 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked.
[2024-11-07 08:19:51,350 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 08:19:51,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 08:19:51,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244466838]
[2024-11-07 08:19:51,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [244466838] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:19:51,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:19:51,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-11-07 08:19:51,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860265558]
[2024-11-07 08:19:51,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:19:51,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-07 08:19:51,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 08:19:51,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-07 08:19:51,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2024-11-07 08:19:51,353 INFO L87 Difference]: Start difference. First operand 113 states and 153 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9)
[2024-11-07 08:19:51,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:19:51,712 INFO L93 Difference]: Finished difference Result 142 states and 184 transitions.
[2024-11-07 08:19:51,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-07 08:19:51,714 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 65
[2024-11-07 08:19:51,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:19:51,715 INFO L225 Difference]: With dead ends: 142
[2024-11-07 08:19:51,716 INFO L226 Difference]: Without dead ends: 140
[2024-11-07 08:19:51,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156
[2024-11-07 08:19:51,717 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 68 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 08:19:51,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 238 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 08:19:51,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states.
[2024-11-07 08:19:51,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 114.
[2024-11-07 08:19:51,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 82 states have internal predecessors, (101), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27)
[2024-11-07 08:19:51,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions.
[2024-11-07 08:19:51,738 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 65
[2024-11-07 08:19:51,738 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:19:51,739 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions.
[2024-11-07 08:19:51,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9)
[2024-11-07 08:19:51,739 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions.
[2024-11-07 08:19:51,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2024-11-07 08:19:51,740 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:19:51,741 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:51,746 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 (5)] Ended with exit code 0
[2024-11-07 08:19:51,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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:19:51,941 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:19:51,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:19:51,942 INFO L85 PathProgramCache]: Analyzing trace with hash 91801815, now seen corresponding path program 1 times
[2024-11-07 08:19:51,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:19:51,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593526311]
[2024-11-07 08:19:51,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:19:51,942 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:19:51,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:19:51,944 INFO L229 MonitoredProcess]: Starting monitored process 6 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:19:51,945 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 (6)] Waiting until timeout for monitored process
[2024-11-07 08:19:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:19:52,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-07 08:19:52,045 INFO L278 TraceCheckSpWp]: Computing forward predicates...