./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-85.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_fillercode_fillercodestructure_normal_file-85.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', 'c060c00346e1591ea2cd610d4a2b6cad35d564494a5a2cb9d3710997ed918424']
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_fillercode_fillercodestructure_normal_file-85.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 c060c00346e1591ea2cd610d4a2b6cad35d564494a5a2cb9d3710997ed918424
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 07:31:40,340 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 07:31:40,424 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-07 07:31:40,433 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 07:31:40,435 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 07:31:40,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 07:31:40,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 07:31:40,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 07:31:40,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 07:31:40,465 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 07:31:40,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 07:31:40,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 07:31:40,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 07:31:40,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 07:31:40,467 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 07:31:40,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 07:31:40,467 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 07:31:40,467 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 07:31:40,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 07:31:40,469 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 07:31:40,469 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 07:31:40,469 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 07:31:40,469 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 07:31:40,469 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 07:31:40,469 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 07:31:40,469 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 07:31:40,469 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 07:31:40,469 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 07:31:40,469 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 07:31:40,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 07:31:40,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 07:31:40,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 07:31:40,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 07:31:40,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 07:31:40,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 07:31:40,470 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 07:31:40,470 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 07:31:40,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 07:31:40,470 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 07:31:40,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 07:31:40,470 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 07:31:40,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 07:31:40,470 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 -> c060c00346e1591ea2cd610d4a2b6cad35d564494a5a2cb9d3710997ed918424
[2024-11-07 07:31:40,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 07:31:40,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 07:31:40,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 07:31:40,768 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 07:31:40,769 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 07:31:40,770 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-85.i
[2024-11-07 07:31:42,090 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 07:31:42,346 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 07:31:42,347 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-85.i
[2024-11-07 07:31:42,357 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/97755d153/76e9cb834c534fbe8cde993123ec07ea/FLAGf85497e24
[2024-11-07 07:31:42,375 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/97755d153/76e9cb834c534fbe8cde993123ec07ea
[2024-11-07 07:31:42,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 07:31:42,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 07:31:42,382 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 07:31:42,382 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 07:31:42,388 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 07:31:42,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:31:42" (1/1) ...
[2024-11-07 07:31:42,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4390cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:42, skipping insertion in model container
[2024-11-07 07:31:42,390 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:31:42" (1/1) ...
[2024-11-07 07:31:42,406 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 07:31:42,539 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_fillercode_fillercodestructure_normal_file-85.i[913,926]
[2024-11-07 07:31:42,604 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 07:31:42,613 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 07:31:42,626 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_fillercode_fillercodestructure_normal_file-85.i[913,926]
[2024-11-07 07:31:42,654 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 07:31:42,673 INFO L204 MainTranslator]: Completed translation
[2024-11-07 07:31:42,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:42 WrapperNode
[2024-11-07 07:31:42,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 07:31:42,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 07:31:42,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 07:31:42,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 07:31:42,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:42" (1/1) ...
[2024-11-07 07:31:42,688 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:42" (1/1) ...
[2024-11-07 07:31:42,727 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124
[2024-11-07 07:31:42,728 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 07:31:42,729 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 07:31:42,729 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 07:31:42,730 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 07:31:42,736 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:42" (1/1) ...
[2024-11-07 07:31:42,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:42" (1/1) ...
[2024-11-07 07:31:42,738 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:42" (1/1) ...
[2024-11-07 07:31:42,754 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 07:31:42,754 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:42" (1/1) ...
[2024-11-07 07:31:42,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:42" (1/1) ...
[2024-11-07 07:31:42,764 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:42" (1/1) ...
[2024-11-07 07:31:42,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:42" (1/1) ...
[2024-11-07 07:31:42,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:42" (1/1) ...
[2024-11-07 07:31:42,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:42" (1/1) ...
[2024-11-07 07:31:42,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 07:31:42,776 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 07:31:42,777 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 07:31:42,777 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 07:31:42,778 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:42" (1/1) ...
[2024-11-07 07:31:42,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 07:31:42,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 07:31:42,812 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 07:31:42,819 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 07:31:42,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 07:31:42,837 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 07:31:42,837 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 07:31:42,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 07:31:42,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 07:31:42,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 07:31:42,910 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 07:31:42,912 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 07:31:43,175 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live.
[2024-11-07 07:31:43,175 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 07:31:43,184 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 07:31:43,185 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 07:31:43,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:31:43 BoogieIcfgContainer
[2024-11-07 07:31:43,186 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 07:31:43,197 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 07:31:43,198 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 07:31:43,202 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 07:31:43,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:31:42" (1/3) ...
[2024-11-07 07:31:43,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b285563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:31:43, skipping insertion in model container
[2024-11-07 07:31:43,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:42" (2/3) ...
[2024-11-07 07:31:43,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b285563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:31:43, skipping insertion in model container
[2024-11-07 07:31:43,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:31:43" (3/3) ...
[2024-11-07 07:31:43,206 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-85.i
[2024-11-07 07:31:43,220 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 07:31:43,220 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 07:31:43,275 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 07:31:43,284 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;@2c79d799, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 07:31:43,284 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 07:31:43,289 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2024-11-07 07:31:43,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102
[2024-11-07 07:31:43,299 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 07:31:43,300 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:31:43,300 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 07:31:43,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 07:31:43,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1458547587, now seen corresponding path program 1 times
[2024-11-07 07:31:43,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 07:31:43,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499370414]
[2024-11-07 07:31:43,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 07:31:43,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 07:31:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:43,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 07:31:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:43,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 07:31:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:43,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 07:31:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:43,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 07:31:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:43,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-07 07:31:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:43,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 07:31:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:43,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-07 07:31:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:43,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-07 07:31:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:43,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-07 07:31:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:43,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 07:31:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:43,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 07:31:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:43,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 07:31:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:43,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 07:31:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:43,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-07 07:31:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:43,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 07:31:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:43,648 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2024-11-07 07:31:43,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 07:31:43,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499370414]
[2024-11-07 07:31:43,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499370414] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 07:31:43,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 07:31:43,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 07:31:43,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779105144]
[2024-11-07 07:31:43,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 07:31:43,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 07:31:43,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 07:31:43,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 07:31:43,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 07:31:43,679 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15)
[2024-11-07 07:31:43,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 07:31:43,704 INFO L93 Difference]: Finished difference Result 101 states and 169 transitions.
[2024-11-07 07:31:43,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 07:31:43,706 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101
[2024-11-07 07:31:43,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 07:31:43,713 INFO L225 Difference]: With dead ends: 101
[2024-11-07 07:31:43,713 INFO L226 Difference]: Without dead ends: 50
[2024-11-07 07:31:43,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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 07:31:43,720 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 07:31:43,722 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 07:31:43,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states.
[2024-11-07 07:31:43,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50.
[2024-11-07 07:31:43,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2024-11-07 07:31:43,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions.
[2024-11-07 07:31:43,767 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 101
[2024-11-07 07:31:43,768 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 07:31:43,768 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions.
[2024-11-07 07:31:43,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15)
[2024-11-07 07:31:43,769 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions.
[2024-11-07 07:31:43,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102
[2024-11-07 07:31:43,772 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 07:31:43,772 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:31:43,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 07:31:43,773 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 07:31:43,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 07:31:43,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1039911609, now seen corresponding path program 1 times
[2024-11-07 07:31:43,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 07:31:43,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431606496]
[2024-11-07 07:31:43,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 07:31:43,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 07:31:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:44,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 07:31:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:44,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 07:31:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:44,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 07:31:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:44,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 07:31:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:44,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-07 07:31:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:44,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 07:31:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:44,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-07 07:31:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:44,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-07 07:31:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:44,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-07 07:31:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:44,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 07:31:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:44,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 07:31:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:44,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 07:31:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:44,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 07:31:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:44,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-07 07:31:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:45,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 07:31:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:45,026 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2024-11-07 07:31:45,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 07:31:45,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431606496]
[2024-11-07 07:31:45,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431606496] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 07:31:45,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 07:31:45,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 07:31:45,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221385505]
[2024-11-07 07:31:45,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 07:31:45,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 07:31:45,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 07:31:45,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 07:31:45,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 07:31:45,032 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-07 07:31:45,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 07:31:45,412 INFO L93 Difference]: Finished difference Result 159 states and 233 transitions.
[2024-11-07 07:31:45,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 07:31:45,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101
[2024-11-07 07:31:45,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 07:31:45,416 INFO L225 Difference]: With dead ends: 159
[2024-11-07 07:31:45,416 INFO L226 Difference]: Without dead ends: 112
[2024-11-07 07:31:45,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-11-07 07:31:45,417 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 89 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 07:31:45,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 223 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 07:31:45,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states.
[2024-11-07 07:31:45,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 88.
[2024-11-07 07:31:45,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 55 states have internal predecessors, (70), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30)
[2024-11-07 07:31:45,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 130 transitions.
[2024-11-07 07:31:45,460 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 130 transitions. Word has length 101
[2024-11-07 07:31:45,460 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 07:31:45,460 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 130 transitions.
[2024-11-07 07:31:45,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-07 07:31:45,461 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 130 transitions.
[2024-11-07 07:31:45,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102
[2024-11-07 07:31:45,464 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 07:31:45,464 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:31:45,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 07:31:45,465 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 07:31:45,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 07:31:45,465 INFO L85 PathProgramCache]: Analyzing trace with hash 735095753, now seen corresponding path program 1 times
[2024-11-07 07:31:45,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 07:31:45,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003536803]
[2024-11-07 07:31:45,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 07:31:45,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 07:31:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:45,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 07:31:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:45,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 07:31:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:45,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 07:31:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:45,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 07:31:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:45,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-07 07:31:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:45,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 07:31:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:45,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-07 07:31:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:45,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-07 07:31:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:45,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-07 07:31:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:45,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 07:31:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:45,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 07:31:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:45,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 07:31:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:45,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 07:31:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:45,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-07 07:31:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:45,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 07:31:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2024-11-07 07:31:45,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 07:31:45,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003536803]
[2024-11-07 07:31:45,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003536803] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 07:31:45,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 07:31:45,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 07:31:45,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73149600]
[2024-11-07 07:31:45,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 07:31:45,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 07:31:45,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 07:31:45,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 07:31:45,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 07:31:45,995 INFO L87 Difference]: Start difference. First operand 88 states and 130 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-07 07:31:46,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 07:31:46,292 INFO L93 Difference]: Finished difference Result 155 states and 227 transitions.
[2024-11-07 07:31:46,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 07:31:46,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101
[2024-11-07 07:31:46,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 07:31:46,295 INFO L225 Difference]: With dead ends: 155
[2024-11-07 07:31:46,295 INFO L226 Difference]: Without dead ends: 102
[2024-11-07 07:31:46,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-07 07:31:46,296 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 56 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 07:31:46,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 219 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 07:31:46,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states.
[2024-11-07 07:31:46,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 88.
[2024-11-07 07:31:46,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 55 states have internal predecessors, (69), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30)
[2024-11-07 07:31:46,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 129 transitions.
[2024-11-07 07:31:46,333 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 129 transitions. Word has length 101
[2024-11-07 07:31:46,333 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 07:31:46,333 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 129 transitions.
[2024-11-07 07:31:46,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-07 07:31:46,333 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 129 transitions.
[2024-11-07 07:31:46,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2024-11-07 07:31:46,335 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 07:31:46,335 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:31:46,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 07:31:46,335 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 07:31:46,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 07:31:46,336 INFO L85 PathProgramCache]: Analyzing trace with hash -2046157833, now seen corresponding path program 1 times
[2024-11-07 07:31:46,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 07:31:46,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345395775]
[2024-11-07 07:31:46,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 07:31:46,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 07:31:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:46,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 07:31:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:46,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 07:31:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:46,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 07:31:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:46,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 07:31:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:46,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-07 07:31:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:46,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 07:31:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:46,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-07 07:31:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:46,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-07 07:31:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:47,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-07 07:31:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:47,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 07:31:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:47,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 07:31:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:47,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 07:31:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:47,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 07:31:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:47,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-07 07:31:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:47,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 07:31:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:47,103 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked.
[2024-11-07 07:31:47,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 07:31:47,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345395775]
[2024-11-07 07:31:47,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345395775] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 07:31:47,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012417724]
[2024-11-07 07:31:47,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 07:31:47,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 07:31:47,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 07:31:47,107 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 07:31:47,108 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 07:31:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:47,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-07 07:31:47,244 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 07:31:47,404 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 134 proven. 6 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked.
[2024-11-07 07:31:47,404 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 07:31:47,641 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked.
[2024-11-07 07:31:47,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012417724] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 07:31:47,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 07:31:47,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15
[2024-11-07 07:31:47,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981954837]
[2024-11-07 07:31:47,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 07:31:47,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-11-07 07:31:47,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 07:31:47,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-11-07 07:31:47,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210
[2024-11-07 07:31:47,648 INFO L87 Difference]: Start difference. First operand 88 states and 129 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33)
[2024-11-07 07:31:48,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 07:31:48,958 INFO L93 Difference]: Finished difference Result 242 states and 337 transitions.
[2024-11-07 07:31:48,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states.
[2024-11-07 07:31:48,960 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) Word has length 102
[2024-11-07 07:31:48,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 07:31:48,962 INFO L225 Difference]: With dead ends: 242
[2024-11-07 07:31:48,964 INFO L226 Difference]: Without dead ends: 193
[2024-11-07 07:31:48,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 227 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=345, Invalid=1215, Unknown=0, NotChecked=0, Total=1560
[2024-11-07 07:31:48,969 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 371 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-07 07:31:48,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 473 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-07 07:31:48,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states.
[2024-11-07 07:31:49,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 98.
[2024-11-07 07:31:49,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 63 states have internal predecessors, (76), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30)
[2024-11-07 07:31:49,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions.
[2024-11-07 07:31:49,030 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 102
[2024-11-07 07:31:49,030 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 07:31:49,030 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 136 transitions.
[2024-11-07 07:31:49,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33)
[2024-11-07 07:31:49,030 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions.
[2024-11-07 07:31:49,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2024-11-07 07:31:49,034 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 07:31:49,034 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:31:49,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-11-07 07:31:49,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 07:31:49,235 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 07:31:49,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 07:31:49,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1366099463, now seen corresponding path program 1 times
[2024-11-07 07:31:49,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 07:31:49,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057684777]
[2024-11-07 07:31:49,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 07:31:49,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 07:31:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-07 07:31:49,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [109560642]
[2024-11-07 07:31:49,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 07:31:49,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 07:31:49,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 07:31:49,317 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 07:31:49,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-07 07:31:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 07:31:49,541 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 07:31:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 07:31:49,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 07:31:49,653 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 07:31:49,654 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-07 07:31:49,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-07 07:31:49,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 07:31:49,860 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2024-11-07 07:31:49,945 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 07:31:49,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:31:49 BoogieIcfgContainer
[2024-11-07 07:31:49,952 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 07:31:49,953 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 07:31:49,953 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 07:31:49,953 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 07:31:49,954 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:31:43" (3/4) ...
[2024-11-07 07:31:49,956 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-07 07:31:49,957 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 07:31:49,957 INFO L158 Benchmark]: Toolchain (without parser) took 7577.88ms. Allocated memory was 100.7MB in the beginning and 159.4MB in the end (delta: 58.7MB). Free memory was 77.1MB in the beginning and 83.4MB in the end (delta: -6.3MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB.
[2024-11-07 07:31:49,957 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 07:31:49,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.57ms. Allocated memory is still 100.7MB. Free memory was 76.9MB in the beginning and 63.1MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 07:31:49,958 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.92ms. Allocated memory is still 100.7MB. Free memory was 63.1MB in the beginning and 60.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 07:31:49,958 INFO L158 Benchmark]: Boogie Preprocessor took 46.70ms. Allocated memory is still 100.7MB. Free memory was 60.4MB in the beginning and 56.5MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 07:31:49,958 INFO L158 Benchmark]: RCFGBuilder took 409.85ms. Allocated memory is still 100.7MB. Free memory was 56.5MB in the beginning and 38.9MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 07:31:49,959 INFO L158 Benchmark]: TraceAbstraction took 6755.16ms. Allocated memory was 100.7MB in the beginning and 159.4MB in the end (delta: 58.7MB). Free memory was 76.3MB in the beginning and 83.4MB in the end (delta: -7.1MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB.
[2024-11-07 07:31:49,959 INFO L158 Benchmark]: Witness Printer took 3.68ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 83.4MB in the end (delta: 24.5kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 07:31:49,960 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.30ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 293.57ms. Allocated memory is still 100.7MB. Free memory was 76.9MB in the beginning and 63.1MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 52.92ms. Allocated memory is still 100.7MB. Free memory was 63.1MB in the beginning and 60.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 46.70ms. Allocated memory is still 100.7MB. Free memory was 60.4MB in the beginning and 56.5MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 409.85ms. Allocated memory is still 100.7MB. Free memory was 56.5MB in the beginning and 38.9MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* TraceAbstraction took 6755.16ms. Allocated memory was 100.7MB in the beginning and 159.4MB in the end (delta: 58.7MB). Free memory was 76.3MB in the beginning and 83.4MB in the end (delta: -7.1MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB.
* Witness Printer took 3.68ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 83.4MB in the end (delta: 24.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 someBinaryFLOATComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 118.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] unsigned long int var_1_1 = 1000;
[L23] unsigned char var_1_5 = 1;
[L24] unsigned char var_1_6 = 0;
[L25] float var_1_7 = 0.6;
[L26] unsigned long int var_1_8 = 32;
[L27] unsigned long int var_1_9 = 32;
[L28] float var_1_11 = 5.5;
[L29] unsigned long int var_1_12 = 128;
[L30] unsigned char var_1_13 = 16;
[L31] unsigned char var_1_14 = 0;
[L32] unsigned long int var_1_15 = 8;
[L33] unsigned char var_1_16 = 0;
[L34] unsigned char var_1_17 = 0;
[L35] double var_1_18 = 1.8;
[L36] double var_1_19 = 4.5;
[L37] double var_1_20 = 15.5;
[L38] unsigned long int last_1_var_1_1 = 1000;
[L39] unsigned char last_1_var_1_5 = 1;
[L40] unsigned long int last_1_var_1_12 = 128;
[L41] unsigned char last_1_var_1_13 = 16;
[L42] unsigned long int last_1_var_1_15 = 8;
VAL [isInitial=0, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32]
[L122] isInitial = 1
[L123] FCALL initially()
[L124] COND TRUE 1
[L125] CALL updateLastVariables()
[L111] last_1_var_1_1 = var_1_1
[L112] last_1_var_1_5 = var_1_5
[L113] last_1_var_1_12 = var_1_12
[L114] last_1_var_1_13 = var_1_13
[L115] last_1_var_1_15 = var_1_15
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32]
[L125] RET updateLastVariables()
[L126] CALL updateVariables()
[L86] var_1_6 = __VERIFIER_nondet_uchar()
[L87] CALL assume_abort_if_not(var_1_6 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32]
[L87] RET assume_abort_if_not(var_1_6 >= 0)
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32]
[L88] CALL assume_abort_if_not(var_1_6 <= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32]
[L88] RET assume_abort_if_not(var_1_6 <= 0)
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32]
[L89] var_1_8 = __VERIFIER_nondet_ulong()
[L90] CALL assume_abort_if_not(var_1_8 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32]
[L90] RET assume_abort_if_not(var_1_8 >= 0)
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32]
[L91] CALL assume_abort_if_not(var_1_8 <= 4294967295)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32]
[L91] RET assume_abort_if_not(var_1_8 <= 4294967295)
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32]
[L92] CALL assume_abort_if_not(var_1_8 != 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=32]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=32]
[L92] RET assume_abort_if_not(var_1_8 != 0)
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=32]
[L93] var_1_9 = __VERIFIER_nondet_ulong()
[L94] CALL assume_abort_if_not(var_1_9 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34]
[L94] RET assume_abort_if_not(var_1_9 >= 0)
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34]
[L95] CALL assume_abort_if_not(var_1_9 <= 4294967295)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34]
[L95] RET assume_abort_if_not(var_1_9 <= 4294967295)
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34]
[L96] CALL assume_abort_if_not(var_1_9 != 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L96] RET assume_abort_if_not(var_1_9 != 0)
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L97] var_1_11 = __VERIFIER_nondet_float()
[L98] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L98] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L99] var_1_14 = __VERIFIER_nondet_uchar()
[L100] CALL assume_abort_if_not(var_1_14 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L100] RET assume_abort_if_not(var_1_14 >= 0)
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L101] CALL assume_abort_if_not(var_1_14 <= 254)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L101] RET assume_abort_if_not(var_1_14 <= 254)
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L102] var_1_17 = __VERIFIER_nondet_uchar()
[L103] CALL assume_abort_if_not(var_1_17 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L103] RET assume_abort_if_not(var_1_17 >= 0)
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L104] CALL assume_abort_if_not(var_1_17 <= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L104] RET assume_abort_if_not(var_1_17 <= 0)
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L105] var_1_19 = __VERIFIER_nondet_double()
[L106] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L106] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L107] var_1_20 = __VERIFIER_nondet_double()
[L108] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L108] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L126] RET updateVariables()
[L127] CALL step()
[L46] signed long int stepLocal_1 = last_1_var_1_13;
[L47] signed long int stepLocal_0 = last_1_var_1_13;
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_1=16, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L48] COND TRUE stepLocal_1 < ((- last_1_var_1_12) * 64)
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L49] COND TRUE \read(last_1_var_1_5)
[L50] var_1_1 = ((((last_1_var_1_12) < 0 ) ? -(last_1_var_1_12) : (last_1_var_1_12)))
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L59] unsigned long int stepLocal_2 = last_1_var_1_15 + last_1_var_1_1;
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_2=1008, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L60] COND TRUE last_1_var_1_13 <= stepLocal_2
[L61] var_1_5 = ((last_1_var_1_15 == last_1_var_1_13) && var_1_6)
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L65] unsigned char stepLocal_3 = var_1_5;
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_3=0, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L66] COND FALSE !(stepLocal_3 || var_1_17)
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L69] var_1_13 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))
[L70] var_1_16 = (var_1_6 && var_1_17)
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=254, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L71] COND FALSE !(\read(var_1_5))
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=254, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1]
[L74] COND FALSE !((var_1_15 + (var_1_15 * var_1_13)) <= ((32u / var_1_8) / var_1_9))
[L79] var_1_7 = var_1_11
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=34, var_1_9=1]
[L81] COND TRUE var_1_7 <= (- (32.8f + var_1_7))
[L82] var_1_12 = last_1_var_1_12
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=34, var_1_9=1]
[L127] RET step()
[L128] CALL, EXPR property()
[L118-L119] return ((((((((last_1_var_1_13 < ((- last_1_var_1_12) * 64)) ? (last_1_var_1_5 ? (var_1_1 == ((unsigned long int) ((((last_1_var_1_12) < 0 ) ? -(last_1_var_1_12) : (last_1_var_1_12))))) : ((-10000000 < last_1_var_1_13) ? (var_1_1 == ((unsigned long int) (((((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))) < 0 ) ? -((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))) : ((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))))))) : (var_1_1 == ((unsigned long int) 50u)))) : 1) && ((last_1_var_1_13 <= (last_1_var_1_15 + last_1_var_1_1)) ? (var_1_5 == ((unsigned char) ((last_1_var_1_15 == last_1_var_1_13) && var_1_6))) : (var_1_5 == ((unsigned char) var_1_6)))) && (((var_1_15 + (var_1_15 * var_1_13)) <= ((32u / var_1_8) / var_1_9)) ? ((1.25f < var_1_18) ? (var_1_7 == ((float) 1000000.1f)) : 1) : (var_1_7 == ((float) var_1_11)))) && ((var_1_7 <= (- (32.8f + var_1_7))) ? (var_1_12 == ((unsigned long int) last_1_var_1_12)) : 1)) && (var_1_13 == ((unsigned char) ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) && (var_1_5 ? (var_1_15 == ((unsigned long int) ((((var_1_1) > ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) ? (var_1_1) : ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))))))))) : 1)) && (var_1_16 == ((unsigned char) (var_1_6 && var_1_17)))) && ((var_1_5 || var_1_17) ? (var_1_18 == ((double) ((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) + var_1_20) - 63.6))) : 1)
;
VAL [\result=0, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=34, var_1_9=1]
[L128] RET, EXPR property()
[L128] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=34, var_1_9=1]
[L19] reach_error()
VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=34, var_1_9=1]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 5, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 529 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 516 mSDsluCounter, 988 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 730 mSDsCounter, 261 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 561 IncrementalHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 261 mSolverCounterUnsat, 258 mSDtfsCounter, 561 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 391 GetRequests, 340 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=4, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 133 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 711 NumberOfCodeBlocks, 711 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 603 ConstructedInterpolants, 0 QuantifiedInterpolants, 3246 SizeOfPredicates, 3 NumberOfNonLiveVariables, 262 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 2502/2520 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 07:31:49,983 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_fillercode_fillercodestructure_normal_file-85.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 c060c00346e1591ea2cd610d4a2b6cad35d564494a5a2cb9d3710997ed918424
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 07:31:52,217 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 07:31:52,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-07 07:31:52,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 07:31:52,365 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 07:31:52,393 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 07:31:52,396 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 07:31:52,396 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 07:31:52,397 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 07:31:52,397 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 07:31:52,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 07:31:52,398 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 07:31:52,398 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 07:31:52,398 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 07:31:52,398 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 07:31:52,399 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 07:31:52,399 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 07:31:52,399 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 07:31:52,399 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 07:31:52,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 07:31:52,399 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 07:31:52,400 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 07:31:52,400 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 07:31:52,400 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 07:31:52,400 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-07 07:31:52,400 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 07:31:52,400 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-07 07:31:52,400 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 07:31:52,401 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 07:31:52,401 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 07:31:52,401 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 07:31:52,401 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 07:31:52,401 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 07:31:52,401 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 07:31:52,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 07:31:52,402 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 07:31:52,402 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 07:31:52,402 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 07:31:52,402 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-11-07 07:31:52,402 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-07 07:31:52,402 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 07:31:52,403 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 07:31:52,403 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 07:31:52,403 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 07:31:52,403 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 -> c060c00346e1591ea2cd610d4a2b6cad35d564494a5a2cb9d3710997ed918424
[2024-11-07 07:31:52,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 07:31:52,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 07:31:52,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 07:31:52,829 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 07:31:52,832 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 07:31:52,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-85.i
[2024-11-07 07:31:54,106 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 07:31:54,315 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 07:31:54,316 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-85.i
[2024-11-07 07:31:54,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/80fdeaaf1/6397b42203974bd997063585695f1dac/FLAG9488a82a2
[2024-11-07 07:31:54,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/80fdeaaf1/6397b42203974bd997063585695f1dac
[2024-11-07 07:31:54,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 07:31:54,348 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 07:31:54,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 07:31:54,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 07:31:54,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 07:31:54,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:31:54" (1/1) ...
[2024-11-07 07:31:54,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f1a1903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:54, skipping insertion in model container
[2024-11-07 07:31:54,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:31:54" (1/1) ...
[2024-11-07 07:31:54,374 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 07:31:54,502 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_fillercode_fillercodestructure_normal_file-85.i[913,926]
[2024-11-07 07:31:54,573 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 07:31:54,594 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 07:31:54,604 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_fillercode_fillercodestructure_normal_file-85.i[913,926]
[2024-11-07 07:31:54,643 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 07:31:54,662 INFO L204 MainTranslator]: Completed translation
[2024-11-07 07:31:54,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:54 WrapperNode
[2024-11-07 07:31:54,665 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 07:31:54,666 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 07:31:54,667 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 07:31:54,667 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 07:31:54,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:54" (1/1) ...
[2024-11-07 07:31:54,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:54" (1/1) ...
[2024-11-07 07:31:54,704 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124
[2024-11-07 07:31:54,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 07:31:54,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 07:31:54,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 07:31:54,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 07:31:54,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:54" (1/1) ...
[2024-11-07 07:31:54,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:54" (1/1) ...
[2024-11-07 07:31:54,719 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:54" (1/1) ...
[2024-11-07 07:31:54,730 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 07:31:54,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:54" (1/1) ...
[2024-11-07 07:31:54,731 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:54" (1/1) ...
[2024-11-07 07:31:54,741 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:54" (1/1) ...
[2024-11-07 07:31:54,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:54" (1/1) ...
[2024-11-07 07:31:54,750 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:54" (1/1) ...
[2024-11-07 07:31:54,751 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:54" (1/1) ...
[2024-11-07 07:31:54,756 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 07:31:54,758 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 07:31:54,758 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 07:31:54,758 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 07:31:54,759 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:54" (1/1) ...
[2024-11-07 07:31:54,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 07:31:54,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 07:31:54,791 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 07:31:54,798 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 07:31:54,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 07:31:54,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-07 07:31:54,816 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 07:31:54,816 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 07:31:54,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 07:31:54,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 07:31:54,900 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 07:31:54,902 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 07:31:57,640 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live.
[2024-11-07 07:31:57,641 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 07:31:57,652 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 07:31:57,653 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 07:31:57,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:31:57 BoogieIcfgContainer
[2024-11-07 07:31:57,654 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 07:31:57,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 07:31:57,657 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 07:31:57,662 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 07:31:57,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:31:54" (1/3) ...
[2024-11-07 07:31:57,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc3f949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:31:57, skipping insertion in model container
[2024-11-07 07:31:57,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:54" (2/3) ...
[2024-11-07 07:31:57,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc3f949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:31:57, skipping insertion in model container
[2024-11-07 07:31:57,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:31:57" (3/3) ...
[2024-11-07 07:31:57,667 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-85.i
[2024-11-07 07:31:57,682 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 07:31:57,683 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 07:31:57,776 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 07:31:57,790 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;@4f7efe6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 07:31:57,791 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 07:31:57,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2024-11-07 07:31:57,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102
[2024-11-07 07:31:57,805 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 07:31:57,806 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:31:57,806 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 07:31:57,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 07:31:57,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1458547587, now seen corresponding path program 1 times
[2024-11-07 07:31:57,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 07:31:57,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089970834]
[2024-11-07 07:31:57,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 07:31:57,824 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 07:31:57,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 07:31:57,828 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 07:31:57,829 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 07:31:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:58,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-07 07:31:58,170 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 07:31:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked.
[2024-11-07 07:31:58,213 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 07:31:58,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 07:31:58,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089970834]
[2024-11-07 07:31:58,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089970834] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 07:31:58,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 07:31:58,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 07:31:58,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071089480]
[2024-11-07 07:31:58,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 07:31:58,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 07:31:58,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 07:31:58,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 07:31:58,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 07:31:58,239 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)
[2024-11-07 07:31:58,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 07:31:58,260 INFO L93 Difference]: Finished difference Result 101 states and 169 transitions.
[2024-11-07 07:31:58,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 07:31:58,261 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101
[2024-11-07 07:31:58,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 07:31:58,266 INFO L225 Difference]: With dead ends: 101
[2024-11-07 07:31:58,266 INFO L226 Difference]: Without dead ends: 50
[2024-11-07 07:31:58,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 100 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 07:31:58,271 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 07:31:58,271 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 07:31:58,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states.
[2024-11-07 07:31:58,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50.
[2024-11-07 07:31:58,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2024-11-07 07:31:58,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions.
[2024-11-07 07:31:58,302 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 101
[2024-11-07 07:31:58,302 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 07:31:58,302 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions.
[2024-11-07 07:31:58,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)
[2024-11-07 07:31:58,303 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions.
[2024-11-07 07:31:58,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102
[2024-11-07 07:31:58,306 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 07:31:58,306 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:31:58,319 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 07:31:58,506 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 07:31:58,507 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 07:31:58,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 07:31:58,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1039911609, now seen corresponding path program 1 times
[2024-11-07 07:31:58,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 07:31:58,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055889846]
[2024-11-07 07:31:58,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 07:31:58,509 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 07:31:58,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 07:31:58,511 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 07:31:58,512 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 07:31:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:31:58,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 07:31:58,849 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 07:31:59,471 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2024-11-07 07:31:59,472 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 07:31:59,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 07:31:59,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055889846]
[2024-11-07 07:31:59,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055889846] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 07:31:59,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 07:31:59,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 07:31:59,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091531022]
[2024-11-07 07:31:59,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 07:31:59,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 07:31:59,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 07:31:59,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 07:31:59,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-07 07:31:59,476 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-07 07:32:02,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 07:32:02,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 07:32:02,316 INFO L93 Difference]: Finished difference Result 97 states and 143 transitions.
[2024-11-07 07:32:02,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 07:32:02,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101
[2024-11-07 07:32:02,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 07:32:02,351 INFO L225 Difference]: With dead ends: 97
[2024-11-07 07:32:02,352 INFO L226 Difference]: Without dead ends: 50
[2024-11-07 07:32:02,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-11-07 07:32:02,353 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 66 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time
[2024-11-07 07:32:02,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 100 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time]
[2024-11-07 07:32:02,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states.
[2024-11-07 07:32:02,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50.
[2024-11-07 07:32:02,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2024-11-07 07:32:02,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions.
[2024-11-07 07:32:02,364 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 101
[2024-11-07 07:32:02,366 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 07:32:02,366 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions.
[2024-11-07 07:32:02,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-07 07:32:02,366 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions.
[2024-11-07 07:32:02,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2024-11-07 07:32:02,368 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 07:32:02,368 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:32:02,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0
[2024-11-07 07:32:02,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 07:32:02,569 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 07:32:02,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 07:32:02,569 INFO L85 PathProgramCache]: Analyzing trace with hash 473802101, now seen corresponding path program 1 times
[2024-11-07 07:32:02,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 07:32:02,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368713155]
[2024-11-07 07:32:02,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 07:32:02,570 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 07:32:02,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 07:32:02,573 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 07:32:02,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2024-11-07 07:32:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:32:02,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-11-07 07:32:02,886 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 07:32:04,517 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 134 proven. 6 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked.
[2024-11-07 07:32:04,518 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 07:32:05,329 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked.
[2024-11-07 07:32:05,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 07:32:05,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368713155]
[2024-11-07 07:32:05,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368713155] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 07:32:05,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 07:32:05,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14
[2024-11-07 07:32:05,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839082003]
[2024-11-07 07:32:05,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 07:32:05,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-11-07 07:32:05,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 07:32:05,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-11-07 07:32:05,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182
[2024-11-07 07:32:05,333 INFO L87 Difference]: Start difference. First operand 50 states and 72 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30)
[2024-11-07 07:32:09,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 07:32:12,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 07:32:13,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 07:32:13,054 INFO L93 Difference]: Finished difference Result 207 states and 298 transitions.
[2024-11-07 07:32:13,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2024-11-07 07:32:13,055 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 102
[2024-11-07 07:32:13,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 07:32:13,058 INFO L225 Difference]: With dead ends: 207
[2024-11-07 07:32:13,058 INFO L226 Difference]: Without dead ends: 160
[2024-11-07 07:32:13,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600
[2024-11-07 07:32:13,059 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 362 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time
[2024-11-07 07:32:13,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 401 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time]
[2024-11-07 07:32:13,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states.
[2024-11-07 07:32:13,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 124.
[2024-11-07 07:32:13,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 79 states have internal predecessors, (96), 41 states have call successors, (41), 4 states have call predecessors, (41), 4 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41)
[2024-11-07 07:32:13,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 178 transitions.
[2024-11-07 07:32:13,097 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 178 transitions. Word has length 102
[2024-11-07 07:32:13,099 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 07:32:13,099 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 178 transitions.
[2024-11-07 07:32:13,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30)
[2024-11-07 07:32:13,099 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 178 transitions.
[2024-11-07 07:32:13,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2024-11-07 07:32:13,102 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 07:32:13,102 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:32:13,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0
[2024-11-07 07:32:13,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 07:32:13,303 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 07:32:13,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 07:32:13,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1366099463, now seen corresponding path program 1 times
[2024-11-07 07:32:13,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 07:32:13,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785588266]
[2024-11-07 07:32:13,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 07:32:13,305 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 07:32:13,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 07:32:13,307 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 07:32:13,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2024-11-07 07:32:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 07:32:13,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 27 conjuncts are in the unsatisfiable core
[2024-11-07 07:32:13,633 INFO L278 TraceCheckSpWp]: Computing forward predicates...