./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-38.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 4f9af400
extending candidate: java
['java']
extending candidate: /usr/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/oracle-jdk-bin-*/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/openjdk-*/bin/java
['java', '/usr/bin/java']
extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java
['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java']
['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-38.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', '8ecb8a86c5100f100392f33b5049e59f5466347bbc0a9c9e82d59cb07a715797']
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-38.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 8ecb8a86c5100f100392f33b5049e59f5466347bbc0a9c9e82d59cb07a715797
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 08:30:46,999 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 08:30:47,152 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:30:47,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 08:30:47,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 08:30:47,196 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 08:30:47,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 08:30:47,197 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 08:30:47,197 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 08:30:47,197 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 08:30:47,198 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 08:30:47,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 08:30:47,198 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 08:30:47,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 08:30:47,199 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 08:30:47,199 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 08:30:47,199 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 08:30:47,199 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 08:30:47,199 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 08:30:47,199 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 08:30:47,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 08:30:47,200 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 08:30:47,200 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 08:30:47,200 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 08:30:47,200 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 08:30:47,200 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 08:30:47,200 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 08:30:47,200 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 08:30:47,200 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 08:30:47,200 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 08:30:47,200 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 08:30:47,200 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 08:30:47,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:30:47,202 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 08:30:47,202 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 08:30:47,203 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 08:30:47,203 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 08:30:47,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 08:30:47,203 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 08:30:47,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 08:30:47,204 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 08:30:47,204 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 08:30:47,204 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 -> 8ecb8a86c5100f100392f33b5049e59f5466347bbc0a9c9e82d59cb07a715797
[2024-11-07 08:30:47,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 08:30:47,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 08:30:47,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 08:30:47,519 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 08:30:47,519 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 08:30:47,520 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-38.i
[2024-11-07 08:30:48,847 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 08:30:49,062 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 08:30:49,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-38.i
[2024-11-07 08:30:49,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/053720f85/a042856705cb41fba2ab1c7f31659003/FLAG77751962e
[2024-11-07 08:30:49,082 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/053720f85/a042856705cb41fba2ab1c7f31659003
[2024-11-07 08:30:49,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 08:30:49,085 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 08:30:49,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 08:30:49,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 08:30:49,090 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 08:30:49,091 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:30:49" (1/1) ...
[2024-11-07 08:30:49,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc5a444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:30:49, skipping insertion in model container
[2024-11-07 08:30:49,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:30:49" (1/1) ...
[2024-11-07 08:30:49,113 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 08:30:49,238 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-38.i[915,928]
[2024-11-07 08:30:49,291 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:30:49,299 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 08:30:49,307 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-38.i[915,928]
[2024-11-07 08:30:49,326 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:30:49,340 INFO L204 MainTranslator]: Completed translation
[2024-11-07 08:30:49,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:30:49 WrapperNode
[2024-11-07 08:30:49,341 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 08:30:49,342 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 08:30:49,342 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 08:30:49,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 08:30:49,348 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:30:49" (1/1) ...
[2024-11-07 08:30:49,356 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:30:49" (1/1) ...
[2024-11-07 08:30:49,410 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116
[2024-11-07 08:30:49,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 08:30:49,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 08:30:49,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 08:30:49,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 08:30:49,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:30:49" (1/1) ...
[2024-11-07 08:30:49,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:30:49" (1/1) ...
[2024-11-07 08:30:49,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:30:49" (1/1) ...
[2024-11-07 08:30:49,456 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:30:49,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:30:49" (1/1) ...
[2024-11-07 08:30:49,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:30:49" (1/1) ...
[2024-11-07 08:30:49,470 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:30:49" (1/1) ...
[2024-11-07 08:30:49,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:30:49" (1/1) ...
[2024-11-07 08:30:49,483 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:30:49" (1/1) ...
[2024-11-07 08:30:49,484 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:30:49" (1/1) ...
[2024-11-07 08:30:49,491 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 08:30:49,492 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 08:30:49,492 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 08:30:49,492 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 08:30:49,493 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:30:49" (1/1) ...
[2024-11-07 08:30:49,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:30:49,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:30:49,530 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:30:49,538 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:30:49,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 08:30:49,558 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 08:30:49,558 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 08:30:49,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 08:30:49,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 08:30:49,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 08:30:49,642 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 08:30:49,644 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 08:30:49,907 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live.
[2024-11-07 08:30:49,909 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 08:30:49,922 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 08:30:49,922 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 08:30:49,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:30:49 BoogieIcfgContainer
[2024-11-07 08:30:49,923 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 08:30:49,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 08:30:49,927 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 08:30:49,931 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 08:30:49,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:30:49" (1/3) ...
[2024-11-07 08:30:49,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b95f975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:30:49, skipping insertion in model container
[2024-11-07 08:30:49,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:30:49" (2/3) ...
[2024-11-07 08:30:49,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b95f975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:30:49, skipping insertion in model container
[2024-11-07 08:30:49,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:30:49" (3/3) ...
[2024-11-07 08:30:49,935 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-38.i
[2024-11-07 08:30:49,947 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 08:30:49,948 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 08:30:50,001 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 08:30:50,012 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;@652ea91a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 08:30:50,012 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 08:30:50,017 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 32 states have (on average 1.25) internal successors, (40), 33 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-07 08:30:50,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2024-11-07 08:30:50,027 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:30:50,028 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:50,028 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:30:50,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:30:50,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1048086186, now seen corresponding path program 1 times
[2024-11-07 08:30:50,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:30:50,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387329721]
[2024-11-07 08:30:50,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:30:50,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:30:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:50,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:30:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:50,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:30:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:50,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 08:30:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:50,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 08:30:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:50,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 08:30:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:50,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 08:30:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:50,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 08:30:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:50,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 08:30:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:50,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 08:30:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:50,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-07 08:30:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:50,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-07 08:30:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:50,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-07 08:30:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:50,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-07 08:30:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:50,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-07 08:30:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:50,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84
[2024-11-07 08:30:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:50,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-07 08:30:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:50,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95
[2024-11-07 08:30:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:50,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100
[2024-11-07 08:30:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:50,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106
[2024-11-07 08:30:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:50,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111
[2024-11-07 08:30:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:50,501 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked.
[2024-11-07 08:30:50,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:30:50,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387329721]
[2024-11-07 08:30:50,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387329721] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:30:50,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:30:50,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 08:30:50,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269832152]
[2024-11-07 08:30:50,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:30:50,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 08:30:50,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:30:50,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 08:30:50,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 08:30:50,536 INFO L87 Difference]: Start difference. First operand has 55 states, 32 states have (on average 1.25) internal successors, (40), 33 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20)
[2024-11-07 08:30:50,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:30:50,560 INFO L93 Difference]: Finished difference Result 103 states and 174 transitions.
[2024-11-07 08:30:50,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 08:30:50,563 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 124
[2024-11-07 08:30:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:30:50,568 INFO L225 Difference]: With dead ends: 103
[2024-11-07 08:30:50,569 INFO L226 Difference]: Without dead ends: 51
[2024-11-07 08:30:50,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 08:30:50,574 INFO L432 NwaCegarLoop]: 73 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, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 08:30:50,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 08:30:50,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2024-11-07 08:30:50,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51.
[2024-11-07 08:30:50,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-07 08:30:50,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions.
[2024-11-07 08:30:50,623 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 124
[2024-11-07 08:30:50,623 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:30:50,623 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions.
[2024-11-07 08:30:50,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20)
[2024-11-07 08:30:50,625 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions.
[2024-11-07 08:30:50,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2024-11-07 08:30:50,630 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:30:50,630 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:50,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 08:30:50,631 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:30:50,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:30:50,632 INFO L85 PathProgramCache]: Analyzing trace with hash 531958366, now seen corresponding path program 1 times
[2024-11-07 08:30:50,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:30:50,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815232492]
[2024-11-07 08:30:50,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:30:50,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:30:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:51,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:30:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:51,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:30:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:51,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 08:30:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:51,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 08:30:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:51,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 08:30:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:51,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 08:30:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:51,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 08:30:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:51,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 08:30:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:51,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 08:30:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:51,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-07 08:30:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:51,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-07 08:30:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:51,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-07 08:30:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:51,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-07 08:30:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:51,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-07 08:30:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:51,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84
[2024-11-07 08:30:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:51,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-07 08:30:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:51,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95
[2024-11-07 08:30:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:51,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100
[2024-11-07 08:30:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:51,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106
[2024-11-07 08:30:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:51,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111
[2024-11-07 08:30:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:51,917 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 96 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked.
[2024-11-07 08:30:51,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:30:51,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815232492]
[2024-11-07 08:30:51,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815232492] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 08:30:51,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101904502]
[2024-11-07 08:30:51,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:30:51,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 08:30:51,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:30:51,924 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:30:51,930 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:30:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:30:52,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-07 08:30:52,135 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:30:52,999 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 272 proven. 96 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked.
[2024-11-07 08:30:53,002 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 08:30:53,431 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 99 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked.
[2024-11-07 08:30:53,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101904502] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 08:30:53,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 08:30:53,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 16
[2024-11-07 08:30:53,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700546880]
[2024-11-07 08:30:53,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 08:30:53,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2024-11-07 08:30:53,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:30:53,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2024-11-07 08:30:53,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240
[2024-11-07 08:30:53,438 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 4 states have call successors, (39), 3 states have call predecessors, (39), 7 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41)
[2024-11-07 08:30:53,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:30:53,943 INFO L93 Difference]: Finished difference Result 113 states and 155 transitions.
[2024-11-07 08:30:53,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2024-11-07 08:30:53,944 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 4 states have call successors, (39), 3 states have call predecessors, (39), 7 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) Word has length 124
[2024-11-07 08:30:53,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:30:53,946 INFO L225 Difference]: With dead ends: 113
[2024-11-07 08:30:53,946 INFO L226 Difference]: Without dead ends: 65
[2024-11-07 08:30:53,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 278 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552
[2024-11-07 08:30:53,948 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 21 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 08:30:53,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 196 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 08:30:53,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states.
[2024-11-07 08:30:53,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59.
[2024-11-07 08:30:53,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-07 08:30:53,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions.
[2024-11-07 08:30:53,970 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 124
[2024-11-07 08:30:53,971 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:30:53,972 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions.
[2024-11-07 08:30:53,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 4 states have call successors, (39), 3 states have call predecessors, (39), 7 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41)
[2024-11-07 08:30:53,972 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions.
[2024-11-07 08:30:53,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2024-11-07 08:30:53,976 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:30:53,976 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:53,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-07 08:30:54,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 08:30:54,177 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:30:54,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:30:54,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1988001568, now seen corresponding path program 1 times
[2024-11-07 08:30:54,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:30:54,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679748655]
[2024-11-07 08:30:54,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:30:54,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:30:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 08:30:54,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 08:30:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 08:30:54,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 08:30:54,378 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 08:30:54,379 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-07 08:30:54,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 08:30:54,384 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2024-11-07 08:30:54,469 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 08:30:54,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:30:54 BoogieIcfgContainer
[2024-11-07 08:30:54,472 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 08:30:54,473 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 08:30:54,473 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 08:30:54,473 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 08:30:54,474 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:30:49" (3/4) ...
[2024-11-07 08:30:54,478 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-07 08:30:54,479 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 08:30:54,480 INFO L158 Benchmark]: Toolchain (without parser) took 5394.47ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 91.9MB in the beginning and 127.5MB in the end (delta: -35.7MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB.
[2024-11-07 08:30:54,482 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:30:54,482 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.85ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 78.8MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 08:30:54,482 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.10ms. Allocated memory is still 117.4MB. Free memory was 78.8MB in the beginning and 76.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:30:54,482 INFO L158 Benchmark]: Boogie Preprocessor took 79.50ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 72.6MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:30:54,483 INFO L158 Benchmark]: RCFGBuilder took 431.31ms. Allocated memory is still 117.4MB. Free memory was 72.6MB in the beginning and 56.6MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 08:30:54,483 INFO L158 Benchmark]: TraceAbstraction took 4547.26ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 56.1MB in the beginning and 127.6MB in the end (delta: -71.4MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:30:54,483 INFO L158 Benchmark]: Witness Printer took 5.93ms. Allocated memory is still 176.2MB. Free memory was 127.6MB in the beginning and 127.5MB in the end (delta: 63.5kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:30:54,485 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.32ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 254.85ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 78.8MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 69.10ms. Allocated memory is still 117.4MB. Free memory was 78.8MB in the beginning and 76.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 79.50ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 72.6MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 431.31ms. Allocated memory is still 117.4MB. Free memory was 72.6MB in the beginning and 56.6MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* TraceAbstraction took 4547.26ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 56.1MB in the beginning and 127.6MB in the end (delta: -71.4MB). There was no memory consumed. Max. memory is 16.1GB.
* Witness Printer took 5.93ms. Allocated memory is still 176.2MB. Free memory was 127.6MB in the beginning and 127.5MB in the end (delta: 63.5kB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryArithmeticDOUBLEoperation at line 46.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] unsigned short int var_1_1 = 0;
[L23] unsigned short int var_1_2 = 56507;
[L24] unsigned short int var_1_3 = 52902;
[L25] unsigned short int var_1_4 = 8;
[L26] unsigned long int var_1_5 = 16;
[L27] unsigned long int var_1_6 = 1771558822;
[L28] double var_1_7 = 7.25;
[L29] double var_1_8 = 31.2;
[L30] double var_1_9 = 32.71;
[L31] double var_1_10 = 0.4;
[L32] double var_1_11 = 7.75;
[L33] unsigned short int var_1_12 = 32;
[L34] unsigned char var_1_13 = 0;
[L35] unsigned short int var_1_14 = 20114;
[L36] unsigned short int var_1_15 = 32;
[L37] unsigned short int var_1_16 = 16773;
VAL [isInitial=0, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=56507, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100]
[L98] isInitial = 1
[L99] FCALL initially()
[L100] COND TRUE 1
[L101] FCALL updateLastVariables()
[L102] CALL updateVariables()
[L58] var_1_2 = __VERIFIER_nondet_ushort()
[L59] CALL assume_abort_if_not(var_1_2 >= 32767)
VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100]
[L59] RET assume_abort_if_not(var_1_2 >= 32767)
VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100]
[L60] CALL assume_abort_if_not(var_1_2 <= 65534)
VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100]
[L60] RET assume_abort_if_not(var_1_2 <= 65534)
VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100]
[L61] var_1_3 = __VERIFIER_nondet_ushort()
[L62] CALL assume_abort_if_not(var_1_3 >= 32767)
VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100]
[L62] RET assume_abort_if_not(var_1_3 >= 32767)
VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100]
[L63] CALL assume_abort_if_not(var_1_3 <= 65534)
VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100]
[L63] RET assume_abort_if_not(var_1_3 <= 65534)
VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100]
[L64] var_1_4 = __VERIFIER_nondet_ushort()
[L65] CALL assume_abort_if_not(var_1_4 >= 0)
VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100]
[L65] RET assume_abort_if_not(var_1_4 >= 0)
VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100]
[L66] CALL assume_abort_if_not(var_1_4 <= 32767)
VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100]
[L66] RET assume_abort_if_not(var_1_4 <= 32767)
VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100]
[L67] var_1_6 = __VERIFIER_nondet_ulong()
[L68] CALL assume_abort_if_not(var_1_6 >= 1610612735)
VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100]
[L68] RET assume_abort_if_not(var_1_6 >= 1610612735)
VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100]
[L69] CALL assume_abort_if_not(var_1_6 <= 2147483647)
VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100]
[L69] RET assume_abort_if_not(var_1_6 <= 2147483647)
VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100]
[L70] var_1_8 = __VERIFIER_nondet_double()
[L71] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_9=3271/100]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_9=3271/100]
[L71] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F ))
VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_9=3271/100]
[L72] var_1_9 = __VERIFIER_nondet_double()
[L73] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L73] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F ))
VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L74] var_1_10 = __VERIFIER_nondet_double()
[L75] CALL assume_abort_if_not((var_1_10 >= -115292.1504606845700e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 1152921.504606845700e+12F && var_1_10 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L75] RET assume_abort_if_not((var_1_10 >= -115292.1504606845700e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 1152921.504606845700e+12F && var_1_10 >= 1.0e-20F ))
VAL [isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L76] var_1_11 = __VERIFIER_nondet_double()
[L77] CALL assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L77] RET assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F ))
VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L78] var_1_13 = __VERIFIER_nondet_uchar()
[L79] CALL assume_abort_if_not(var_1_13 >= 0)
VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L79] RET assume_abort_if_not(var_1_13 >= 0)
VAL [isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L80] CALL assume_abort_if_not(var_1_13 <= 1)
VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L80] RET assume_abort_if_not(var_1_13 <= 1)
VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L81] var_1_14 = __VERIFIER_nondet_ushort()
[L82] CALL assume_abort_if_not(var_1_14 >= 16383)
VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L82] RET assume_abort_if_not(var_1_14 >= 16383)
VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L83] CALL assume_abort_if_not(var_1_14 <= 32767)
VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L83] RET assume_abort_if_not(var_1_14 <= 32767)
VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L84] var_1_15 = __VERIFIER_nondet_ushort()
[L85] CALL assume_abort_if_not(var_1_15 >= 0)
VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L85] RET assume_abort_if_not(var_1_15 >= 0)
VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L86] CALL assume_abort_if_not(var_1_15 <= 16383)
VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L86] RET assume_abort_if_not(var_1_15 <= 16383)
VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L87] var_1_16 = __VERIFIER_nondet_ushort()
[L88] CALL assume_abort_if_not(var_1_16 >= 16384)
VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L88] RET assume_abort_if_not(var_1_16 >= 16384)
VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L89] CALL assume_abort_if_not(var_1_16 <= 32767)
VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L89] RET assume_abort_if_not(var_1_16 <= 32767)
VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L102] RET updateVariables()
[L103] CALL step()
[L41] var_1_1 = (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) - var_1_4)
[L42] unsigned short int stepLocal_0 = var_1_4;
VAL [isInitial=1, stepLocal_0=32767, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L43] COND FALSE !(stepLocal_0 > var_1_2)
VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4]
[L46] var_1_7 = (var_1_8 + (var_1_9 + (var_1_10 + var_1_11)))
VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735]
[L47] COND TRUE ! var_1_13
[L48] var_1_12 = (var_1_3 - (var_1_14 - var_1_15))
VAL [isInitial=1, var_1_12=65073, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735]
[L103] RET step()
[L104] CALL, EXPR property()
[L94-L95] return (((var_1_1 == ((unsigned short int) (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) - var_1_4))) && ((var_1_4 > var_1_2) ? (var_1_5 == ((unsigned long int) (((var_1_6 - var_1_3) + 2144048120u) - var_1_2))) : 1)) && (var_1_7 == ((double) (var_1_8 + (var_1_9 + (var_1_10 + var_1_11)))))) && ((! var_1_13) ? (var_1_12 == ((unsigned short int) (var_1_3 - (var_1_14 - var_1_15)))) : (var_1_13 ? (var_1_12 == ((unsigned short int) ((27636 + var_1_16) - (((((16853 - 10)) > (var_1_14)) ? ((16853 - 10)) : (var_1_14)))))) : (var_1_12 == ((unsigned short int) var_1_3))))
;
VAL [\result=0, isInitial=1, var_1_12=65073, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735]
[L104] RET, EXPR property()
[L104] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, var_1_12=65073, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735]
[L19] reach_error()
VAL [isInitial=1, var_1_12=65073, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 269 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 146 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 326 IncrementalHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 123 mSDtfsCounter, 326 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 364 GetRequests, 340 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 496 NumberOfCodeBlocks, 496 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 492 ConstructedInterpolants, 0 QuantifiedInterpolants, 1903 SizeOfPredicates, 3 NumberOfNonLiveVariables, 276 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 2749/3040 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:30:54,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-38.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 8ecb8a86c5100f100392f33b5049e59f5466347bbc0a9c9e82d59cb07a715797
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 08:30:56,944 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 08:30:57,083 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:30:57,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 08:30:57,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 08:30:57,113 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 08:30:57,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 08:30:57,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 08:30:57,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 08:30:57,114 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 08:30:57,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 08:30:57,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 08:30:57,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 08:30:57,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 08:30:57,115 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 08:30:57,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 08:30:57,115 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 08:30:57,116 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 08:30:57,117 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 08:30:57,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 08:30:57,117 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 08:30:57,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 08:30:57,118 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 08:30:57,118 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 08:30:57,118 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-07 08:30:57,118 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 08:30:57,119 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-07 08:30:57,119 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 08:30:57,119 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 08:30:57,119 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 08:30:57,119 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 08:30:57,119 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 08:30:57,119 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 08:30:57,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 08:30:57,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:30:57,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 08:30:57,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 08:30:57,120 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 08:30:57,120 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-11-07 08:30:57,121 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-07 08:30:57,121 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 08:30:57,121 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 08:30:57,121 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 08:30:57,121 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 08:30:57,121 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 -> 8ecb8a86c5100f100392f33b5049e59f5466347bbc0a9c9e82d59cb07a715797
[2024-11-07 08:30:57,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 08:30:57,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 08:30:57,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 08:30:57,446 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 08:30:57,447 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 08:30:57,447 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-38.i
[2024-11-07 08:30:58,953 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 08:30:59,210 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 08:30:59,212 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-38.i
[2024-11-07 08:30:59,223 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6946b6c1/d43ed855d9324cbbad8c5d5b7fec3027/FLAG61e6b6711
[2024-11-07 08:30:59,246 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6946b6c1/d43ed855d9324cbbad8c5d5b7fec3027
[2024-11-07 08:30:59,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 08:30:59,251 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 08:30:59,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 08:30:59,254 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 08:30:59,258 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 08:30:59,259 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:30:59" (1/1) ...
[2024-11-07 08:30:59,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a6444e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:30:59, skipping insertion in model container
[2024-11-07 08:30:59,260 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:30:59" (1/1) ...
[2024-11-07 08:30:59,281 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 08:30:59,413 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-38.i[915,928]
[2024-11-07 08:30:59,475 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:30:59,494 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 08:30:59,508 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-38.i[915,928]
[2024-11-07 08:30:59,527 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:30:59,546 INFO L204 MainTranslator]: Completed translation
[2024-11-07 08:30:59,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:30:59 WrapperNode
[2024-11-07 08:30:59,547 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 08:30:59,548 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 08:30:59,548 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 08:30:59,548 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 08:30:59,556 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:30:59" (1/1) ...
[2024-11-07 08:30:59,566 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:30:59" (1/1) ...
[2024-11-07 08:30:59,593 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116
[2024-11-07 08:30:59,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 08:30:59,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 08:30:59,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 08:30:59,598 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 08:30:59,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:30:59" (1/1) ...
[2024-11-07 08:30:59,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:30:59" (1/1) ...
[2024-11-07 08:30:59,615 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:30:59" (1/1) ...
[2024-11-07 08:30:59,635 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:30:59,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:30:59" (1/1) ...
[2024-11-07 08:30:59,636 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:30:59" (1/1) ...
[2024-11-07 08:30:59,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:30:59" (1/1) ...
[2024-11-07 08:30:59,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:30:59" (1/1) ...
[2024-11-07 08:30:59,660 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:30:59" (1/1) ...
[2024-11-07 08:30:59,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:30:59" (1/1) ...
[2024-11-07 08:30:59,664 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 08:30:59,668 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 08:30:59,668 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 08:30:59,668 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 08:30:59,669 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:30:59" (1/1) ...
[2024-11-07 08:30:59,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:30:59,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:30:59,711 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:30:59,719 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:30:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 08:30:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-07 08:30:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 08:30:59,741 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 08:30:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 08:30:59,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 08:30:59,835 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 08:30:59,837 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 08:31:07,221 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live.
[2024-11-07 08:31:07,222 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 08:31:07,233 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 08:31:07,233 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 08:31:07,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:31:07 BoogieIcfgContainer
[2024-11-07 08:31:07,234 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 08:31:07,236 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 08:31:07,236 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 08:31:07,241 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 08:31:07,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:30:59" (1/3) ...
[2024-11-07 08:31:07,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bcd1c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:31:07, skipping insertion in model container
[2024-11-07 08:31:07,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:30:59" (2/3) ...
[2024-11-07 08:31:07,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bcd1c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:31:07, skipping insertion in model container
[2024-11-07 08:31:07,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:31:07" (3/3) ...
[2024-11-07 08:31:07,244 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-38.i
[2024-11-07 08:31:07,257 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 08:31:07,258 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 08:31:07,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 08:31:07,322 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;@33ebd078, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 08:31:07,322 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 08:31:07,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 32 states have (on average 1.25) internal successors, (40), 33 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-07 08:31:07,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2024-11-07 08:31:07,365 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:31:07,366 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:07,366 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:31:07,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:31:07,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1048086186, now seen corresponding path program 1 times
[2024-11-07 08:31:07,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:31:07,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883801707]
[2024-11-07 08:31:07,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:31:07,379 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 08:31:07,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:31:07,382 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 08:31:07,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2024-11-07 08:31:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:31:07,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-07 08:31:07,731 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:31:07,782 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked.
[2024-11-07 08:31:07,783 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 08:31:07,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 08:31:07,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883801707]
[2024-11-07 08:31:07,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883801707] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:31:07,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:31:07,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 08:31:07,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133188488]
[2024-11-07 08:31:07,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:31:07,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 08:31:07,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 08:31:07,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 08:31:07,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 08:31:07,806 INFO L87 Difference]: Start difference. First operand has 55 states, 32 states have (on average 1.25) internal successors, (40), 33 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20)
[2024-11-07 08:31:07,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:31:07,832 INFO L93 Difference]: Finished difference Result 103 states and 174 transitions.
[2024-11-07 08:31:07,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 08:31:07,834 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 124
[2024-11-07 08:31:07,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:31:07,841 INFO L225 Difference]: With dead ends: 103
[2024-11-07 08:31:07,842 INFO L226 Difference]: Without dead ends: 51
[2024-11-07 08:31:07,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 08:31:07,851 INFO L432 NwaCegarLoop]: 73 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, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 08:31:07,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 08:31:07,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2024-11-07 08:31:07,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51.
[2024-11-07 08:31:07,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-07 08:31:07,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions.
[2024-11-07 08:31:07,904 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 124
[2024-11-07 08:31:07,905 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:31:07,906 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions.
[2024-11-07 08:31:07,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20)
[2024-11-07 08:31:07,907 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions.
[2024-11-07 08:31:07,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2024-11-07 08:31:07,911 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:31:07,912 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:07,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0
[2024-11-07 08:31:08,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 08:31:08,113 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:31:08,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:31:08,114 INFO L85 PathProgramCache]: Analyzing trace with hash 531958366, now seen corresponding path program 1 times
[2024-11-07 08:31:08,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:31:08,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744129718]
[2024-11-07 08:31:08,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:31:08,115 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 08:31:08,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:31:08,118 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 08:31:08,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2024-11-07 08:31:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:31:08,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 40 conjuncts are in the unsatisfiable core
[2024-11-07 08:31:08,866 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:31:36,856 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 410 proven. 231 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked.
[2024-11-07 08:31:36,857 INFO L311 TraceCheckSpWp]: Computing backward predicates...