./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-90.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 4f9af400
extending candidate: java
['java']
extending candidate: /usr/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/oracle-jdk-bin-*/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/openjdk-*/bin/java
['java', '/usr/bin/java']
extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java
['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java']
['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-90.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', 'ea7df308032d06b1304a4a33893d142fbc642677e172fa30f17dc86e231db193']
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-90.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 ea7df308032d06b1304a4a33893d142fbc642677e172fa30f17dc86e231db193
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 08:59:48,754 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 08:59:48,861 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:59:48,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 08:59:48,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 08:59:48,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 08:59:48,889 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 08:59:48,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 08:59:48,890 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 08:59:48,890 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 08:59:48,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 08:59:48,891 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 08:59:48,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 08:59:48,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 08:59:48,891 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 08:59:48,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 08:59:48,893 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 08:59:48,893 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 08:59:48,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 08:59:48,893 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 08:59:48,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 08:59:48,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 08:59:48,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 08:59:48,894 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 08:59:48,894 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 08:59:48,894 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 08:59:48,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 08:59:48,894 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 08:59:48,894 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 08:59:48,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 08:59:48,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 08:59:48,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 08:59:48,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:59:48,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 08:59:48,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 08:59:48,895 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 08:59:48,895 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 08:59:48,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 08:59:48,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 08:59:48,895 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 08:59:48,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 08:59:48,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 08:59:48,895 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 -> ea7df308032d06b1304a4a33893d142fbc642677e172fa30f17dc86e231db193
[2024-11-07 08:59:49,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 08:59:49,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 08:59:49,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 08:59:49,241 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 08:59:49,241 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 08:59:49,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-90.i
[2024-11-07 08:59:50,521 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 08:59:50,797 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 08:59:50,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-90.i
[2024-11-07 08:59:50,810 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/053482964/93b7b9e3a0a54d0ab64769aace647c0a/FLAGb6334f826
[2024-11-07 08:59:51,094 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/053482964/93b7b9e3a0a54d0ab64769aace647c0a
[2024-11-07 08:59:51,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 08:59:51,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 08:59:51,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 08:59:51,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 08:59:51,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 08:59:51,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:59:51" (1/1) ...
[2024-11-07 08:59:51,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70817d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:51, skipping insertion in model container
[2024-11-07 08:59:51,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:59:51" (1/1) ...
[2024-11-07 08:59:51,118 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 08:59:51,243 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-90.i[915,928]
[2024-11-07 08:59:51,289 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:59:51,302 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 08:59:51,315 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-90.i[915,928]
[2024-11-07 08:59:51,334 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:59:51,355 INFO L204 MainTranslator]: Completed translation
[2024-11-07 08:59:51,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:51 WrapperNode
[2024-11-07 08:59:51,356 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 08:59:51,357 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 08:59:51,358 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 08:59:51,358 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 08:59:51,363 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:59:51" (1/1) ...
[2024-11-07 08:59:51,375 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:59:51" (1/1) ...
[2024-11-07 08:59:51,418 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 150
[2024-11-07 08:59:51,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 08:59:51,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 08:59:51,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 08:59:51,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 08:59:51,438 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:51" (1/1) ...
[2024-11-07 08:59:51,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:51" (1/1) ...
[2024-11-07 08:59:51,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:51" (1/1) ...
[2024-11-07 08:59:51,462 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:59:51,462 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:51" (1/1) ...
[2024-11-07 08:59:51,463 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:51" (1/1) ...
[2024-11-07 08:59:51,472 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:51" (1/1) ...
[2024-11-07 08:59:51,476 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:51" (1/1) ...
[2024-11-07 08:59:51,479 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:51" (1/1) ...
[2024-11-07 08:59:51,480 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:51" (1/1) ...
[2024-11-07 08:59:51,487 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 08:59:51,487 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 08:59:51,488 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 08:59:51,488 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 08:59:51,493 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:51" (1/1) ...
[2024-11-07 08:59:51,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:59:51,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:59:51,526 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:59:51,529 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:59:51,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 08:59:51,551 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 08:59:51,552 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 08:59:51,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 08:59:51,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 08:59:51,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 08:59:51,637 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 08:59:51,638 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 08:59:51,959 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live.
[2024-11-07 08:59:51,960 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 08:59:51,968 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 08:59:51,968 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 08:59:51,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:59:51 BoogieIcfgContainer
[2024-11-07 08:59:51,968 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 08:59:51,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 08:59:51,971 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 08:59:51,975 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 08:59:51,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:59:51" (1/3) ...
[2024-11-07 08:59:51,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74548a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:59:51, skipping insertion in model container
[2024-11-07 08:59:51,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:51" (2/3) ...
[2024-11-07 08:59:51,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74548a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:59:51, skipping insertion in model container
[2024-11-07 08:59:51,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:59:51" (3/3) ...
[2024-11-07 08:59:51,978 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-90.i
[2024-11-07 08:59:51,991 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 08:59:51,991 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 08:59:52,037 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 08:59:52,047 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;@72b5cee4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 08:59:52,047 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 08:59:52,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 45 states have internal predecessors, (64), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2024-11-07 08:59:52,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2024-11-07 08:59:52,061 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:59:52,062 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:52,063 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:59:52,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:59:52,066 INFO L85 PathProgramCache]: Analyzing trace with hash -415182279, now seen corresponding path program 1 times
[2024-11-07 08:59:52,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:59:52,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83493822]
[2024-11-07 08:59:52,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:59:52,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:59:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:53,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:59:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:53,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:59:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:53,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-07 08:59:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:53,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 08:59:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:53,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-07 08:59:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:53,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31
[2024-11-07 08:59:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:53,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-07 08:59:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:53,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-07 08:59:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:53,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-07 08:59:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:53,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53
[2024-11-07 08:59:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:53,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 08:59:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:53,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64
[2024-11-07 08:59:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:53,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 08:59:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:53,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75
[2024-11-07 08:59:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:53,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 08:59:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:53,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-07 08:59:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:53,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 08:59:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:53,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-07 08:59:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:53,375 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2024-11-07 08:59:53,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:59:53,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83493822]
[2024-11-07 08:59:53,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83493822] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:59:53,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:59:53,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 08:59:53,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443507342]
[2024-11-07 08:59:53,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:59:53,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 08:59:53,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:59:53,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 08:59:53,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 08:59:53,406 INFO L87 Difference]: Start difference. First operand has 65 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 45 states have internal predecessors, (64), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-07 08:59:53,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:59:53,705 INFO L93 Difference]: Finished difference Result 182 states and 327 transitions.
[2024-11-07 08:59:53,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 08:59:53,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118
[2024-11-07 08:59:53,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:59:53,718 INFO L225 Difference]: With dead ends: 182
[2024-11-07 08:59:53,719 INFO L226 Difference]: Without dead ends: 120
[2024-11-07 08:59:53,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-07 08:59:53,727 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 62 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 08:59:53,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 240 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 08:59:53,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states.
[2024-11-07 08:59:53,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111.
[2024-11-07 08:59:53,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 72 states have internal predecessors, (100), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36)
[2024-11-07 08:59:53,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 172 transitions.
[2024-11-07 08:59:53,805 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 172 transitions. Word has length 118
[2024-11-07 08:59:53,806 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:59:53,807 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 172 transitions.
[2024-11-07 08:59:53,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-07 08:59:53,808 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 172 transitions.
[2024-11-07 08:59:53,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2024-11-07 08:59:53,810 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:59:53,811 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:53,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 08:59:53,813 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:59:53,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:59:53,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1924515900, now seen corresponding path program 1 times
[2024-11-07 08:59:53,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:59:53,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197370663]
[2024-11-07 08:59:53,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:59:53,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:59:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:59:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:59:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-07 08:59:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 08:59:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-07 08:59:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31
[2024-11-07 08:59:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-07 08:59:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-07 08:59:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-07 08:59:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53
[2024-11-07 08:59:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 08:59:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64
[2024-11-07 08:59:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 08:59:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75
[2024-11-07 08:59:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 08:59:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-07 08:59:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 08:59:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-07 08:59:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,150 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2024-11-07 08:59:54,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:59:54,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197370663]
[2024-11-07 08:59:54,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197370663] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:59:54,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:59:54,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 08:59:54,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019188130]
[2024-11-07 08:59:54,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:59:54,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 08:59:54,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:59:54,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 08:59:54,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 08:59:54,156 INFO L87 Difference]: Start difference. First operand 111 states and 172 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-07 08:59:54,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:59:54,340 INFO L93 Difference]: Finished difference Result 254 states and 392 transitions.
[2024-11-07 08:59:54,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 08:59:54,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120
[2024-11-07 08:59:54,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:59:54,343 INFO L225 Difference]: With dead ends: 254
[2024-11-07 08:59:54,343 INFO L226 Difference]: Without dead ends: 182
[2024-11-07 08:59:54,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-07 08:59:54,348 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 92 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 08:59:54,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 254 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 08:59:54,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states.
[2024-11-07 08:59:54,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 172.
[2024-11-07 08:59:54,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 114 states have (on average 1.368421052631579) internal successors, (156), 114 states have internal predecessors, (156), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54)
[2024-11-07 08:59:54,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 264 transitions.
[2024-11-07 08:59:54,402 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 264 transitions. Word has length 120
[2024-11-07 08:59:54,402 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:59:54,403 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 264 transitions.
[2024-11-07 08:59:54,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-07 08:59:54,403 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 264 transitions.
[2024-11-07 08:59:54,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2024-11-07 08:59:54,407 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:59:54,407 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:54,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 08:59:54,407 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:59:54,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:59:54,408 INFO L85 PathProgramCache]: Analyzing trace with hash 879350649, now seen corresponding path program 1 times
[2024-11-07 08:59:54,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:59:54,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744095707]
[2024-11-07 08:59:54,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:59:54,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:59:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:59:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:59:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-07 08:59:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 08:59:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-07 08:59:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31
[2024-11-07 08:59:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-07 08:59:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-07 08:59:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-07 08:59:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53
[2024-11-07 08:59:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 08:59:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64
[2024-11-07 08:59:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 08:59:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75
[2024-11-07 08:59:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 08:59:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-07 08:59:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 08:59:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-07 08:59:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:54,872 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 48 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked.
[2024-11-07 08:59:54,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:59:54,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744095707]
[2024-11-07 08:59:54,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744095707] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 08:59:54,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012206735]
[2024-11-07 08:59:54,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:59:54,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 08:59:54,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:59:54,876 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:59:54,877 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:59:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:59:55,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-07 08:59:55,011 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:59:55,435 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 383 proven. 48 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked.
[2024-11-07 08:59:55,437 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 08:59:55,796 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 51 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked.
[2024-11-07 08:59:55,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012206735] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 08:59:55,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 08:59:55,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 15
[2024-11-07 08:59:55,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206718795]
[2024-11-07 08:59:55,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 08:59:55,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-11-07 08:59:55,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:59:55,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-11-07 08:59:55,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210
[2024-11-07 08:59:55,799 INFO L87 Difference]: Start difference. First operand 172 states and 264 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 6 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39)
[2024-11-07 08:59:56,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:59:56,127 INFO L93 Difference]: Finished difference Result 342 states and 498 transitions.
[2024-11-07 08:59:56,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2024-11-07 08:59:56,128 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 6 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) Word has length 122
[2024-11-07 08:59:56,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:59:56,133 INFO L225 Difference]: With dead ends: 342
[2024-11-07 08:59:56,133 INFO L226 Difference]: Without dead ends: 214
[2024-11-07 08:59:56,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420
[2024-11-07 08:59:56,135 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 206 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 08:59:56,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 165 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 08:59:56,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states.
[2024-11-07 08:59:56,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 196.
[2024-11-07 08:59:56,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 132 states have (on average 1.2954545454545454) internal successors, (171), 132 states have internal predecessors, (171), 54 states have call successors, (54), 9 states have call predecessors, (54), 9 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54)
[2024-11-07 08:59:56,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 279 transitions.
[2024-11-07 08:59:56,183 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 279 transitions. Word has length 122
[2024-11-07 08:59:56,184 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:59:56,184 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 279 transitions.
[2024-11-07 08:59:56,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 6 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39)
[2024-11-07 08:59:56,184 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 279 transitions.
[2024-11-07 08:59:56,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2024-11-07 08:59:56,193 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:59:56,193 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:56,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-11-07 08:59:56,394 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:59:56,395 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:59:56,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:59:56,396 INFO L85 PathProgramCache]: Analyzing trace with hash 292544635, now seen corresponding path program 1 times
[2024-11-07 08:59:56,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:59:56,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431894431]
[2024-11-07 08:59:56,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:59:56,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:59:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-07 08:59:56,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [473107036]
[2024-11-07 08:59:56,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:59:56,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 08:59:56,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:59:56,485 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 08:59:56,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-07 08:59:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 08:59:56,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 08:59:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 08:59:57,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 08:59:57,117 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 08:59:57,118 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-07 08:59:57,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-07 08:59:57,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 08:59:57,323 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2024-11-07 08:59:57,430 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 08:59:57,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:59:57 BoogieIcfgContainer
[2024-11-07 08:59:57,433 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 08:59:57,434 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 08:59:57,434 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 08:59:57,434 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 08:59:57,435 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:59:51" (3/4) ...
[2024-11-07 08:59:57,437 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-07 08:59:57,437 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 08:59:57,438 INFO L158 Benchmark]: Toolchain (without parser) took 6341.21ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 91.8MB in the beginning and 88.5MB in the end (delta: 3.3MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB.
[2024-11-07 08:59:57,438 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:59:57,439 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.21ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 78.4MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 08:59:57,439 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.85ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 76.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:59:57,439 INFO L158 Benchmark]: Boogie Preprocessor took 60.40ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 73.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:59:57,440 INFO L158 Benchmark]: RCFGBuilder took 480.99ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 54.5MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 08:59:57,440 INFO L158 Benchmark]: TraceAbstraction took 5462.08ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 54.0MB in the beginning and 88.6MB in the end (delta: -34.6MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB.
[2024-11-07 08:59:57,440 INFO L158 Benchmark]: Witness Printer took 3.73ms. Allocated memory is still 159.4MB. Free memory was 88.6MB in the beginning and 88.5MB in the end (delta: 57.7kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:59:57,442 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.39ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 258.21ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 78.4MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 68.85ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 76.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 60.40ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 73.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 480.99ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 54.5MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* TraceAbstraction took 5462.08ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 54.0MB in the beginning and 88.6MB in the end (delta: -34.6MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB.
* Witness Printer took 3.73ms. Allocated memory is still 159.4MB. Free memory was 88.6MB in the beginning and 88.5MB in the end (delta: 57.7kB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of bitwiseOr at line 128.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] signed long int var_1_1 = -32;
[L23] signed long int var_1_3 = 10;
[L24] signed long int var_1_4 = 64;
[L25] unsigned short int var_1_11 = 64;
[L26] unsigned short int var_1_12 = 8;
[L27] unsigned short int var_1_13 = 5;
[L28] signed short int var_1_14 = 8;
[L29] unsigned short int var_1_15 = 62763;
[L30] unsigned long int var_1_16 = 25;
[L31] float var_1_18 = 63.25;
[L32] unsigned char var_1_20 = 0;
[L33] float var_1_21 = 7.8;
[L34] float var_1_22 = 32.1;
[L35] unsigned char var_1_23 = 0;
[L36] signed long int var_1_24 = -16;
[L37] signed long int last_1_var_1_1 = -32;
[L38] unsigned short int last_1_var_1_11 = 64;
[L39] signed short int last_1_var_1_14 = 8;
[L40] unsigned long int last_1_var_1_16 = 25;
[L41] float last_1_var_1_18 = 63.25;
VAL [isInitial=0, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=10, var_1_4=64]
[L132] isInitial = 1
[L133] FCALL initially()
[L134] COND TRUE 1
[L135] CALL updateLastVariables()
[L121] last_1_var_1_1 = var_1_1
[L122] last_1_var_1_11 = var_1_11
[L123] last_1_var_1_14 = var_1_14
[L124] last_1_var_1_16 = var_1_16
[L125] last_1_var_1_18 = var_1_18
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=10, var_1_4=64]
[L135] RET updateLastVariables()
[L136] CALL updateVariables()
[L92] var_1_3 = __VERIFIER_nondet_long()
[L93] CALL assume_abort_if_not(var_1_3 >= -2147483648)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64]
[L93] RET assume_abort_if_not(var_1_3 >= -2147483648)
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64]
[L94] CALL assume_abort_if_not(var_1_3 <= 2147483647)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64]
[L94] RET assume_abort_if_not(var_1_3 <= 2147483647)
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64]
[L95] CALL assume_abort_if_not(var_1_3 != 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64]
[L95] RET assume_abort_if_not(var_1_3 != 0)
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64]
[L96] var_1_4 = __VERIFIER_nondet_long()
[L97] CALL assume_abort_if_not(var_1_4 >= -2147483648)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L97] RET assume_abort_if_not(var_1_4 >= -2147483648)
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L98] CALL assume_abort_if_not(var_1_4 <= 2147483647)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L98] RET assume_abort_if_not(var_1_4 <= 2147483647)
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L99] CALL assume_abort_if_not(var_1_4 != 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L99] RET assume_abort_if_not(var_1_4 != 0)
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L100] var_1_12 = __VERIFIER_nondet_ushort()
[L101] CALL assume_abort_if_not(var_1_12 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L101] RET assume_abort_if_not(var_1_12 >= 0)
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L102] CALL assume_abort_if_not(var_1_12 <= 16384)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L102] RET assume_abort_if_not(var_1_12 <= 16384)
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L103] var_1_13 = __VERIFIER_nondet_ushort()
[L104] CALL assume_abort_if_not(var_1_13 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L104] RET assume_abort_if_not(var_1_13 >= 0)
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L105] CALL assume_abort_if_not(var_1_13 <= 16383)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L105] RET assume_abort_if_not(var_1_13 <= 16383)
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L106] var_1_15 = __VERIFIER_nondet_ushort()
[L107] CALL assume_abort_if_not(var_1_15 >= 32767)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L107] RET assume_abort_if_not(var_1_15 >= 32767)
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L108] CALL assume_abort_if_not(var_1_15 <= 65535)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L108] RET assume_abort_if_not(var_1_15 <= 65535)
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L109] var_1_20 = __VERIFIER_nondet_uchar()
[L110] CALL assume_abort_if_not(var_1_20 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L110] RET assume_abort_if_not(var_1_20 >= 0)
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L111] CALL assume_abort_if_not(var_1_20 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L111] RET assume_abort_if_not(var_1_20 <= 1)
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L112] var_1_21 = __VERIFIER_nondet_float()
[L113] CALL assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L113] RET assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L114] var_1_22 = __VERIFIER_nondet_float()
[L115] CALL assume_abort_if_not((var_1_22 >= -461168.6018427382800e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L115] RET assume_abort_if_not((var_1_22 >= -461168.6018427382800e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L116] var_1_23 = __VERIFIER_nondet_uchar()
[L117] CALL assume_abort_if_not(var_1_23 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L117] RET assume_abort_if_not(var_1_23 >= 0)
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L118] CALL assume_abort_if_not(var_1_23 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L118] RET assume_abort_if_not(var_1_23 <= 1)
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L136] RET updateVariables()
[L137] CALL step()
[L45] EXPR last_1_var_1_1 | last_1_var_1_16
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L45] COND FALSE !((last_1_var_1_14 / ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) <= (last_1_var_1_1 | last_1_var_1_16))
[L52] var_1_1 = last_1_var_1_11
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=64, var_1_20=1, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-2]
[L54] COND FALSE !((- (- last_1_var_1_18)) != last_1_var_1_18)
[L61] var_1_24 = last_1_var_1_14
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=64, var_1_20=1, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2]
[L63] COND FALSE !(((var_1_15 - var_1_12) + var_1_24) < var_1_24)
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=64, var_1_20=1, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2]
[L66] unsigned short int stepLocal_0 = var_1_13;
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, stepLocal_0=-65535, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=64, var_1_20=1, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2]
[L67] COND FALSE !(var_1_24 < stepLocal_0)
[L78] var_1_18 = var_1_21
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2]
[L80] COND TRUE var_1_18 != (var_1_18 + var_1_18)
[L81] var_1_11 = ((var_1_12 + var_1_13) + 32)
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=33, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2]
[L83] COND FALSE !(((var_1_1 * var_1_4) + var_1_1) > var_1_1)
[L88] var_1_16 = 0u
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=33, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2]
[L137] RET step()
[L138] CALL, EXPR property()
[L128] EXPR last_1_var_1_1 | last_1_var_1_16
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=33, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2]
[L128-L129] return (((((((last_1_var_1_14 / ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) <= (last_1_var_1_1 | last_1_var_1_16)) ? (((last_1_var_1_18 * last_1_var_1_18) < last_1_var_1_18) ? (var_1_1 == ((signed long int) last_1_var_1_11)) : (var_1_1 == ((signed long int) last_1_var_1_11))) : (var_1_1 == ((signed long int) last_1_var_1_11))) && ((var_1_18 != (var_1_18 + var_1_18)) ? (var_1_11 == ((unsigned short int) ((var_1_12 + var_1_13) + 32))) : 1)) && ((((var_1_15 - var_1_12) + var_1_24) < var_1_24) ? (var_1_14 == ((signed short int) var_1_12)) : 1)) && ((((var_1_1 * var_1_4) + var_1_1) > var_1_1) ? ((var_1_14 < var_1_1) ? (var_1_16 == ((unsigned long int) var_1_12)) : 1) : (var_1_16 == ((unsigned long int) 0u)))) && ((var_1_24 < var_1_13) ? (var_1_20 ? (var_1_18 == ((float) (((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) + var_1_22))) : (var_1_23 ? (var_1_18 == ((float) (var_1_22 + var_1_21))) : (var_1_18 == ((float) -0.75f)))) : (var_1_18 == ((float) var_1_21)))) && (((- (- last_1_var_1_18)) != last_1_var_1_18) ? ((var_1_12 <= ((((last_1_var_1_14) > ((- last_1_var_1_14))) ? (last_1_var_1_14) : ((- last_1_var_1_14))))) ? (var_1_24 == ((signed long int) -50)) : (var_1_24 == ((signed long int) last_1_var_1_14))) : (var_1_24 == ((signed long int) last_1_var_1_14)))
;
[L138] RET, EXPR property()
[L138] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=33, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2]
[L19] reach_error()
VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=33, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 368 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 360 mSDsluCounter, 659 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 416 mSDsCounter, 180 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 215 IncrementalHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 180 mSolverCounterUnsat, 243 mSDtfsCounter, 215 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 375 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=3, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 37 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 726 NumberOfCodeBlocks, 726 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 599 ConstructedInterpolants, 0 QuantifiedInterpolants, 2568 SizeOfPredicates, 3 NumberOfNonLiveVariables, 296 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 2913/3060 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:59:57,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-90.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 ea7df308032d06b1304a4a33893d142fbc642677e172fa30f17dc86e231db193
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 08:59:59,672 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 08:59:59,778 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:59:59,786 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 08:59:59,787 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 08:59:59,810 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 08:59:59,811 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 08:59:59,812 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 08:59:59,812 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 08:59:59,812 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 08:59:59,813 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 08:59:59,813 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 08:59:59,813 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 08:59:59,813 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 08:59:59,814 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 08:59:59,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 08:59:59,814 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 08:59:59,814 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 08:59:59,814 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 08:59:59,814 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 08:59:59,814 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 08:59:59,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 08:59:59,814 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 08:59:59,814 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 08:59:59,814 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-07 08:59:59,814 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 08:59:59,814 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-07 08:59:59,814 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 08:59:59,814 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 08:59:59,814 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 08:59:59,815 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 08:59:59,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 08:59:59,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 08:59:59,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 08:59:59,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:59:59,815 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 08:59:59,815 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 08:59:59,816 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 08:59:59,816 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-11-07 08:59:59,816 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-07 08:59:59,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 08:59:59,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 08:59:59,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 08:59:59,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 08:59:59,818 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 -> ea7df308032d06b1304a4a33893d142fbc642677e172fa30f17dc86e231db193
[2024-11-07 09:00:00,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 09:00:00,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 09:00:00,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 09:00:00,150 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 09:00:00,150 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 09:00:00,153 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-90.i
[2024-11-07 09:00:01,497 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 09:00:01,743 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 09:00:01,744 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-90.i
[2024-11-07 09:00:01,758 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/93e52ccd1/b1df918cb80c40539ff49d19030cffa3/FLAG10308e693
[2024-11-07 09:00:01,780 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/93e52ccd1/b1df918cb80c40539ff49d19030cffa3
[2024-11-07 09:00:01,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 09:00:01,786 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 09:00:01,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 09:00:01,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 09:00:01,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 09:00:01,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:00:01" (1/1) ...
[2024-11-07 09:00:01,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a16983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:01, skipping insertion in model container
[2024-11-07 09:00:01,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:00:01" (1/1) ...
[2024-11-07 09:00:01,810 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 09:00:01,952 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-90.i[915,928]
[2024-11-07 09:00:02,014 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 09:00:02,035 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 09:00:02,049 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-90.i[915,928]
[2024-11-07 09:00:02,082 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 09:00:02,103 INFO L204 MainTranslator]: Completed translation
[2024-11-07 09:00:02,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:02 WrapperNode
[2024-11-07 09:00:02,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 09:00:02,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 09:00:02,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 09:00:02,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 09:00:02,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:02" (1/1) ...
[2024-11-07 09:00:02,129 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:02" (1/1) ...
[2024-11-07 09:00:02,161 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130
[2024-11-07 09:00:02,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 09:00:02,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 09:00:02,164 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 09:00:02,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 09:00:02,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:02" (1/1) ...
[2024-11-07 09:00:02,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:02" (1/1) ...
[2024-11-07 09:00:02,178 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:02" (1/1) ...
[2024-11-07 09:00:02,194 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 09:00:02,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:02" (1/1) ...
[2024-11-07 09:00:02,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:02" (1/1) ...
[2024-11-07 09:00:02,207 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:02" (1/1) ...
[2024-11-07 09:00:02,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:02" (1/1) ...
[2024-11-07 09:00:02,212 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:02" (1/1) ...
[2024-11-07 09:00:02,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:02" (1/1) ...
[2024-11-07 09:00:02,215 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 09:00:02,216 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 09:00:02,216 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 09:00:02,216 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 09:00:02,220 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:02" (1/1) ...
[2024-11-07 09:00:02,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 09:00:02,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 09:00:02,260 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 09:00:02,265 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 09:00:02,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 09:00:02,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-07 09:00:02,290 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 09:00:02,290 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 09:00:02,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 09:00:02,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 09:00:02,384 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 09:00:02,386 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 09:00:03,222 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live.
[2024-11-07 09:00:03,223 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 09:00:03,236 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 09:00:03,237 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 09:00:03,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:00:03 BoogieIcfgContainer
[2024-11-07 09:00:03,238 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 09:00:03,241 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 09:00:03,241 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 09:00:03,248 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 09:00:03,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:00:01" (1/3) ...
[2024-11-07 09:00:03,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c683f2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:00:03, skipping insertion in model container
[2024-11-07 09:00:03,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:02" (2/3) ...
[2024-11-07 09:00:03,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c683f2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:00:03, skipping insertion in model container
[2024-11-07 09:00:03,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:00:03" (3/3) ...
[2024-11-07 09:00:03,252 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-90.i
[2024-11-07 09:00:03,268 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 09:00:03,268 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 09:00:03,348 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 09:00:03,359 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;@2acf98f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 09:00:03,361 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 09:00:03,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2024-11-07 09:00:03,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2024-11-07 09:00:03,377 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 09:00:03,378 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:00:03,378 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 09:00:03,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 09:00:03,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1081310934, now seen corresponding path program 1 times
[2024-11-07 09:00:03,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 09:00:03,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158704371]
[2024-11-07 09:00:03,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 09:00:03,399 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 09:00:03,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 09:00:03,403 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 09:00:03,406 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 09:00:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:00:03,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-07 09:00:03,705 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 09:00:03,755 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked.
[2024-11-07 09:00:03,755 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 09:00:03,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 09:00:03,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158704371]
[2024-11-07 09:00:03,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [158704371] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 09:00:03,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 09:00:03,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 09:00:03,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92171084]
[2024-11-07 09:00:03,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 09:00:03,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 09:00:03,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 09:00:03,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 09:00:03,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 09:00:03,783 INFO L87 Difference]: Start difference. First operand has 58 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18)
[2024-11-07 09:00:03,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 09:00:03,802 INFO L93 Difference]: Finished difference Result 109 states and 190 transitions.
[2024-11-07 09:00:03,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 09:00:03,804 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115
[2024-11-07 09:00:03,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 09:00:03,809 INFO L225 Difference]: With dead ends: 109
[2024-11-07 09:00:03,810 INFO L226 Difference]: Without dead ends: 54
[2024-11-07 09:00:03,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 09:00:03,814 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 09:00:03,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 09:00:03,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states.
[2024-11-07 09:00:03,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54.
[2024-11-07 09:00:03,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2024-11-07 09:00:03,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 82 transitions.
[2024-11-07 09:00:03,853 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 82 transitions. Word has length 115
[2024-11-07 09:00:03,853 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 09:00:03,853 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 82 transitions.
[2024-11-07 09:00:03,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18)
[2024-11-07 09:00:03,854 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 82 transitions.
[2024-11-07 09:00:03,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2024-11-07 09:00:03,858 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 09:00:03,858 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:00:03,869 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 09:00:04,059 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 09:00:04,059 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 09:00:04,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 09:00:04,060 INFO L85 PathProgramCache]: Analyzing trace with hash -513398942, now seen corresponding path program 1 times
[2024-11-07 09:00:04,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 09:00:04,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007601836]
[2024-11-07 09:00:04,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 09:00:04,061 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 09:00:04,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 09:00:04,064 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 09:00:04,065 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 09:00:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:00:04,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-11-07 09:00:04,348 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 09:00:05,381 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 383 proven. 48 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked.
[2024-11-07 09:00:05,383 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 09:00:05,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 09:00:05,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007601836]
[2024-11-07 09:00:05,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007601836] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 09:00:05,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1309089562]
[2024-11-07 09:00:05,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 09:00:05,716 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt
[2024-11-07 09:00:05,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4
[2024-11-07 09:00:05,720 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null)
[2024-11-07 09:00:05,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process
[2024-11-07 09:00:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:00:06,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 7 conjuncts are in the unsatisfiable core
[2024-11-07 09:00:06,644 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 09:00:07,819 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 213 proven. 9 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked.
[2024-11-07 09:00:07,819 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 09:00:11,052 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 42 proven. 9 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked.
[2024-11-07 09:00:11,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1309089562] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 09:00:11,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 09:00:11,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 20
[2024-11-07 09:00:11,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616520707]
[2024-11-07 09:00:11,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 09:00:11,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2024-11-07 09:00:11,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 09:00:11,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2024-11-07 09:00:11,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506
[2024-11-07 09:00:11,059 INFO L87 Difference]: Start difference. First operand 54 states and 82 transitions. Second operand has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 7 states have call successors, (54), 6 states have call predecessors, (54), 10 states have return successors, (54), 7 states have call predecessors, (54), 7 states have call successors, (54)
[2024-11-07 09:00:43,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 09:00:43,737 INFO L93 Difference]: Finished difference Result 560 states and 794 transitions.
[2024-11-07 09:00:43,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states.
[2024-11-07 09:00:43,740 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 7 states have call successors, (54), 6 states have call predecessors, (54), 10 states have return successors, (54), 7 states have call predecessors, (54), 7 states have call successors, (54) Word has length 115
[2024-11-07 09:00:43,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 09:00:43,748 INFO L225 Difference]: With dead ends: 560
[2024-11-07 09:00:43,748 INFO L226 Difference]: Without dead ends: 509
[2024-11-07 09:00:43,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3392 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=2110, Invalid=7592, Unknown=0, NotChecked=0, Total=9702
[2024-11-07 09:00:43,754 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 1256 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 686 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 686 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time
[2024-11-07 09:00:43,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1271 Valid, 322 Invalid, 1288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [686 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 13.1s Time]
[2024-11-07 09:00:43,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states.
[2024-11-07 09:00:43,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 147.
[2024-11-07 09:00:43,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 97 states have (on average 1.3195876288659794) internal successors, (128), 98 states have internal predecessors, (128), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42)
[2024-11-07 09:00:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 212 transitions.
[2024-11-07 09:00:43,808 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 212 transitions. Word has length 115
[2024-11-07 09:00:43,809 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 09:00:43,809 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 212 transitions.
[2024-11-07 09:00:43,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 7 states have call successors, (54), 6 states have call predecessors, (54), 10 states have return successors, (54), 7 states have call predecessors, (54), 7 states have call successors, (54)
[2024-11-07 09:00:43,809 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 212 transitions.
[2024-11-07 09:00:43,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2024-11-07 09:00:43,811 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 09:00:43,811 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:00:43,824 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 09:00:44,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0
[2024-11-07 09:00:44,212 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,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt
[2024-11-07 09:00:44,213 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 09:00:44,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 09:00:44,213 INFO L85 PathProgramCache]: Analyzing trace with hash 109401126, now seen corresponding path program 1 times
[2024-11-07 09:00:44,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 09:00:44,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832262834]
[2024-11-07 09:00:44,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 09:00:44,214 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 09:00:44,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 09:00:44,217 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 09:00:44,218 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 09:00:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 09:00:44,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 30 conjuncts are in the unsatisfiable core
[2024-11-07 09:00:44,577 INFO L278 TraceCheckSpWp]: Computing forward predicates...