./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-72.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', '18ef0dddc7c7969694de0928e4b6cb2e80de650c7da321f655a1a1a02ed063b0'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-72.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 18ef0dddc7c7969694de0928e4b6cb2e80de650c7da321f655a1a1a02ed063b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:34:59,943 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:35:00,022 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 08:35:00,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:35:00,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:35:00,047 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:35:00,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:35:00,049 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:35:00,050 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:35:00,050 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:35:00,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:35:00,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:35:00,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:35:00,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:35:00,051 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:35:00,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:35:00,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:35:00,052 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:35:00,052 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:35:00,052 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:35:00,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:35:00,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:35:00,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:35:00,052 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:35:00,052 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:35:00,052 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:35:00,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:35:00,053 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:35:00,053 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:35:00,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:35:00,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:35:00,053 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:35:00,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:35:00,053 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:35:00,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:35:00,054 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:35:00,054 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:35:00,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:35:00,054 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:35:00,054 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:35:00,054 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:35:00,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:35:00,055 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 -> 18ef0dddc7c7969694de0928e4b6cb2e80de650c7da321f655a1a1a02ed063b0 [2024-11-07 08:35:00,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:35:00,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:35:00,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:35:00,275 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:35:00,275 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:35:00,277 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-72.i [2024-11-07 08:35:01,391 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:35:01,596 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:35:01,598 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-72.i [2024-11-07 08:35:01,606 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4af7f5d97/1e6d7ca7acd14c88a2ae12d493869e40/FLAG2b5873715 [2024-11-07 08:35:01,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4af7f5d97/1e6d7ca7acd14c88a2ae12d493869e40 [2024-11-07 08:35:01,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:35:01,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:35:01,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:35:01,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:35:01,969 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:35:01,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:35:01" (1/1) ... [2024-11-07 08:35:01,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745287ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:01, skipping insertion in model container [2024-11-07 08:35:01,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:35:01" (1/1) ... [2024-11-07 08:35:01,987 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:35:02,073 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-72.i[915,928] [2024-11-07 08:35:02,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:35:02,122 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:35:02,130 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-72.i[915,928] [2024-11-07 08:35:02,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:35:02,157 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:35:02,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:02 WrapperNode [2024-11-07 08:35:02,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:35:02,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:35:02,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:35:02,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:35:02,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:02" (1/1) ... [2024-11-07 08:35:02,169 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:02" (1/1) ... [2024-11-07 08:35:02,191 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2024-11-07 08:35:02,192 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:35:02,193 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:35:02,193 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:35:02,193 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:35:02,200 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:02" (1/1) ... [2024-11-07 08:35:02,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:02" (1/1) ... [2024-11-07 08:35:02,202 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:02" (1/1) ... [2024-11-07 08:35:02,220 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 08:35:02,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:02" (1/1) ... [2024-11-07 08:35:02,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:02" (1/1) ... [2024-11-07 08:35:02,228 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:02" (1/1) ... [2024-11-07 08:35:02,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:02" (1/1) ... [2024-11-07 08:35:02,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:02" (1/1) ... [2024-11-07 08:35:02,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:02" (1/1) ... [2024-11-07 08:35:02,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:35:02,240 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:35:02,240 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:35:02,240 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:35:02,241 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:02" (1/1) ... [2024-11-07 08:35:02,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:35:02,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:35:02,268 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 08:35:02,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 08:35:02,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:35:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:35:02,287 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:35:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:35:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:35:02,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:35:02,343 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:35:02,344 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:35:02,493 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 08:35:02,493 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:35:02,500 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:35:02,500 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:35:02,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:35:02 BoogieIcfgContainer [2024-11-07 08:35:02,501 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:35:02,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:35:02,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:35:02,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:35:02,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:35:01" (1/3) ... [2024-11-07 08:35:02,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b50a378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:35:02, skipping insertion in model container [2024-11-07 08:35:02,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:02" (2/3) ... [2024-11-07 08:35:02,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b50a378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:35:02, skipping insertion in model container [2024-11-07 08:35:02,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:35:02" (3/3) ... [2024-11-07 08:35:02,507 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-72.i [2024-11-07 08:35:02,517 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:35:02,517 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:35:02,550 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:35:02,557 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;@1febcb28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:35:02,558 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:35:02,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 08:35:02,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 08:35:02,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:35:02,572 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:35:02,573 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:35:02,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:35:02,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1442101837, now seen corresponding path program 1 times [2024-11-07 08:35:02,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:35:02,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120004336] [2024-11-07 08:35:02,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:35:02,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:35:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:35:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 08:35:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 08:35:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 08:35:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 08:35:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 08:35:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 08:35:02,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 08:35:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 08:35:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 08:35:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 08:35:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 08:35:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 08:35:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:35:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 08:35:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:35:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 08:35:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:35:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 08:35:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:35:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 08:35:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:35:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 08:35:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 08:35:02,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:35:02,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120004336] [2024-11-07 08:35:02,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120004336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:35:02,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:35:02,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:35:02,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41411540] [2024-11-07 08:35:02,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:35:02,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:35:02,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:35:02,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:35:02,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:35:02,884 INFO L87 Difference]: Start difference. First operand has 62 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 08:35:02,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:35:02,903 INFO L93 Difference]: Finished difference Result 117 states and 199 transitions. [2024-11-07 08:35:02,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:35:02,904 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2024-11-07 08:35:02,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:35:02,909 INFO L225 Difference]: With dead ends: 117 [2024-11-07 08:35:02,909 INFO L226 Difference]: Without dead ends: 58 [2024-11-07 08:35:02,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:35:02,913 INFO L432 NwaCegarLoop]: 84 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, 84 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:35:02,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:35:02,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-07 08:35:02,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-07 08:35:02,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 08:35:02,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2024-11-07 08:35:02,947 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 143 [2024-11-07 08:35:02,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:35:02,947 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2024-11-07 08:35:02,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 08:35:02,948 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2024-11-07 08:35:02,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 08:35:02,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:35:02,950 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:35:02,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:35:02,951 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:35:02,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:35:02,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1696472987, now seen corresponding path program 1 times [2024-11-07 08:35:02,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:35:02,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494434113] [2024-11-07 08:35:02,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:35:02,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:35:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:03,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:35:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:03,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 08:35:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:03,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 08:35:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:03,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 08:35:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:03,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 08:35:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:03,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 08:35:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:03,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 08:35:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:03,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 08:35:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:03,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 08:35:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:03,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 08:35:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:03,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 08:35:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:03,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 08:35:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:03,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 08:35:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:03,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:35:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:03,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 08:35:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:03,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:35:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:03,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 08:35:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:03,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:35:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:03,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 08:35:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:03,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:35:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:03,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 08:35:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:03,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:35:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:03,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 08:35:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:03,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-07 08:35:03,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:35:03,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494434113] [2024-11-07 08:35:03,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494434113] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:35:03,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965411159] [2024-11-07 08:35:03,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:35:03,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:35:03,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:35:03,386 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:35:03,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 08:35:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:03,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 08:35:03,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:35:03,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 33 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-11-07 08:35:03,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:35:03,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-07 08:35:03,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965411159] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:35:03,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 08:35:03,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-07 08:35:03,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606792591] [2024-11-07 08:35:03,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 08:35:03,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 08:35:03,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:35:03,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 08:35:03,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:35:03,897 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-07 08:35:04,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:35:04,075 INFO L93 Difference]: Finished difference Result 121 states and 172 transitions. [2024-11-07 08:35:04,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 08:35:04,076 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 143 [2024-11-07 08:35:04,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:35:04,078 INFO L225 Difference]: With dead ends: 121 [2024-11-07 08:35:04,078 INFO L226 Difference]: Without dead ends: 66 [2024-11-07 08:35:04,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 328 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 08:35:04,079 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 60 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:35:04,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 119 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:35:04,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-07 08:35:04,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2024-11-07 08:35:04,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 08:35:04,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2024-11-07 08:35:04,092 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 143 [2024-11-07 08:35:04,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:35:04,093 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2024-11-07 08:35:04,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-07 08:35:04,093 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2024-11-07 08:35:04,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 08:35:04,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:35:04,095 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:35:04,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 08:35:04,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:35:04,296 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:35:04,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:35:04,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1789147683, now seen corresponding path program 1 times [2024-11-07 08:35:04,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:35:04,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725280278] [2024-11-07 08:35:04,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:35:04,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:35:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:35:04,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 08:35:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:35:04,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 08:35:04,414 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 08:35:04,415 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:35:04,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:35:04,418 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 08:35:04,483 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:35:04,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:35:04 BoogieIcfgContainer [2024-11-07 08:35:04,489 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:35:04,489 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:35:04,489 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:35:04,489 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:35:04,490 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:35:02" (3/4) ... [2024-11-07 08:35:04,491 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 08:35:04,492 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:35:04,493 INFO L158 Benchmark]: Toolchain (without parser) took 2527.30ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 91.0MB in the beginning and 71.2MB in the end (delta: 19.8MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. [2024-11-07 08:35:04,493 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:35:04,493 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.51ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 78.1MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:35:04,493 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.11ms. Allocated memory is still 117.4MB. Free memory was 78.1MB in the beginning and 76.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:35:04,494 INFO L158 Benchmark]: Boogie Preprocessor took 46.50ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 74.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:35:04,494 INFO L158 Benchmark]: RCFGBuilder took 261.15ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 59.3MB in the end (delta: 14.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:35:04,494 INFO L158 Benchmark]: TraceAbstraction took 1986.41ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 58.6MB in the beginning and 71.2MB in the end (delta: -12.6MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2024-11-07 08:35:04,494 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 167.8MB. Free memory is still 71.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:35:04,495 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.19ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.51ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 78.1MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.11ms. Allocated memory is still 117.4MB. Free memory was 78.1MB in the beginning and 76.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.50ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 74.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 261.15ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 59.3MB in the end (delta: 14.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1986.41ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 58.6MB in the beginning and 71.2MB in the end (delta: -12.6MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 167.8MB. Free memory is still 71.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] double var_1_2 = 128.875; [L24] double var_1_3 = 24.5; [L25] double var_1_4 = 8.2; [L26] double var_1_5 = 10.05; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 1; [L30] unsigned char var_1_9 = 0; [L31] unsigned long int var_1_10 = 2; [L32] signed char var_1_11 = -16; [L33] signed char var_1_12 = -2; [L34] signed char var_1_13 = -10; [L35] signed char var_1_14 = 4; [L36] double var_1_15 = 256.4; [L37] float var_1_16 = 0.25; [L38] double var_1_17 = 100000000000.2; [L39] double var_1_18 = 50.5; [L40] double var_1_19 = 9.5; VAL [isInitial=0, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_2=1031/8, var_1_3=49/2, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] FCALL updateLastVariables() [L110] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_3=49/2, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_3=49/2, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L61] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_3=49/2, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L62] var_1_3 = __VERIFIER_nondet_double() [L63] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L63] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L64] var_1_4 = __VERIFIER_nondet_double() [L65] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L65] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L66] var_1_5 = __VERIFIER_nondet_double() [L67] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L67] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L68] var_1_6 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_7=0, var_1_8=1, var_1_9=0] [L69] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_7=0, var_1_8=1, var_1_9=0] [L70] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L70] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L71] var_1_7 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_8=1, var_1_9=0] [L72] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_8=1, var_1_9=0] [L73] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L73] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L74] var_1_8 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_9=0] [L75] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L76] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L77] var_1_9 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0] [L78] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0] [L79] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L79] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L80] var_1_12 = __VERIFIER_nondet_char() [L81] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L81] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L82] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L82] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L83] var_1_13 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L84] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L85] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L86] var_1_14 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L87] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L88] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L89] var_1_16 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L90] RET assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_16 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L91] RET assume_abort_if_not(var_1_16 != 0.0F) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L92] var_1_17 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L93] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L94] var_1_18 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L95] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L96] var_1_19 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L97] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L110] RET updateVariables() [L111] CALL step() [L44] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L47] var_1_11 = (((((var_1_12 + var_1_13)) < ((10 - var_1_14))) ? ((var_1_12 + var_1_13)) : ((10 - var_1_14)))) VAL [isInitial=1, var_1_10=2, var_1_11=4, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L48] COND FALSE !((var_1_2 + (var_1_3 / var_1_16)) == var_1_5) VAL [isInitial=1, var_1_10=2, var_1_11=4, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L55] COND TRUE var_1_15 < (((((var_1_15) < (var_1_15)) ? (var_1_15) : (var_1_15))) * var_1_15) [L56] var_1_1 = (var_1_6 && ((var_1_7 || var_1_8) && var_1_9)) VAL [isInitial=1, var_1_10=2, var_1_11=4, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_1=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L111] RET step() [L112] CALL, EXPR property() [L102-L103] return ((((var_1_15 < (((((var_1_15) < (var_1_15)) ? (var_1_15) : (var_1_15))) * var_1_15)) ? (var_1_1 == ((unsigned char) (var_1_6 && ((var_1_7 || var_1_8) && var_1_9)))) : 1) && (var_1_9 ? (var_1_10 == ((unsigned long int) 2u)) : 1)) && (var_1_11 == ((signed char) (((((var_1_12 + var_1_13)) < ((10 - var_1_14))) ? ((var_1_12 + var_1_13)) : ((10 - var_1_14))))))) && (((var_1_2 + (var_1_3 / var_1_16)) == var_1_5) ? ((var_1_3 >= var_1_4) ? (var_1_15 == ((double) (var_1_17 - (((((var_1_18 + var_1_19)) < (9.9999999999995E12)) ? ((var_1_18 + var_1_19)) : (9.9999999999995E12)))))) : (var_1_15 == ((double) var_1_17))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=2, var_1_11=4, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_1=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_11=4, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_1=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_11=4, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_1=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 203 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 128 IncrementalHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 140 mSDtfsCounter, 128 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 409 GetRequests, 399 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 572 NumberOfCodeBlocks, 572 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 568 ConstructedInterpolants, 0 QuantifiedInterpolants, 1030 SizeOfPredicates, 1 NumberOfNonLiveVariables, 313 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 3949/4048 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 08:35:04,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-72.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 18ef0dddc7c7969694de0928e4b6cb2e80de650c7da321f655a1a1a02ed063b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:35:06,213 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:35:06,289 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 08:35:06,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:35:06,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:35:06,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:35:06,313 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:35:06,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:35:06,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:35:06,313 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:35:06,313 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:35:06,313 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:35:06,314 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:35:06,314 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:35:06,314 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:35:06,314 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:35:06,314 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:35:06,314 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:35:06,314 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:35:06,314 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:35:06,314 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:35:06,314 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:35:06,314 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:35:06,315 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 08:35:06,315 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 08:35:06,315 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:35:06,315 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 08:35:06,315 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:35:06,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:35:06,315 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:35:06,315 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:35:06,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:35:06,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:35:06,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:35:06,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:35:06,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:35:06,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:35:06,316 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:35:06,316 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 08:35:06,316 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 08:35:06,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:35:06,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:35:06,316 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:35:06,316 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:35:06,316 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 -> 18ef0dddc7c7969694de0928e4b6cb2e80de650c7da321f655a1a1a02ed063b0 [2024-11-07 08:35:06,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:35:06,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:35:06,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:35:06,629 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:35:06,629 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:35:06,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-72.i [2024-11-07 08:35:07,705 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:35:07,896 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:35:07,897 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-72.i [2024-11-07 08:35:07,904 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0bb9db6cd/9528bf8ca6d84db1b4c9bd163e04d9db/FLAG1cc651b18 [2024-11-07 08:35:08,268 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0bb9db6cd/9528bf8ca6d84db1b4c9bd163e04d9db [2024-11-07 08:35:08,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:35:08,271 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:35:08,272 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:35:08,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:35:08,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:35:08,275 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:35:08" (1/1) ... [2024-11-07 08:35:08,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21ff63c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:08, skipping insertion in model container [2024-11-07 08:35:08,276 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:35:08" (1/1) ... [2024-11-07 08:35:08,289 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:35:08,389 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-72.i[915,928] [2024-11-07 08:35:08,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:35:08,445 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:35:08,454 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-72.i[915,928] [2024-11-07 08:35:08,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:35:08,497 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:35:08,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:08 WrapperNode [2024-11-07 08:35:08,499 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:35:08,500 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:35:08,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:35:08,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:35:08,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:08" (1/1) ... [2024-11-07 08:35:08,519 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:08" (1/1) ... [2024-11-07 08:35:08,542 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2024-11-07 08:35:08,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:35:08,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:35:08,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:35:08,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:35:08,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:08" (1/1) ... [2024-11-07 08:35:08,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:08" (1/1) ... [2024-11-07 08:35:08,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:08" (1/1) ... [2024-11-07 08:35:08,570 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 08:35:08,570 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:08" (1/1) ... [2024-11-07 08:35:08,570 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:08" (1/1) ... [2024-11-07 08:35:08,576 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:08" (1/1) ... [2024-11-07 08:35:08,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:08" (1/1) ... [2024-11-07 08:35:08,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:08" (1/1) ... [2024-11-07 08:35:08,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:08" (1/1) ... [2024-11-07 08:35:08,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:35:08,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:35:08,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:35:08,587 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:35:08,588 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:08" (1/1) ... [2024-11-07 08:35:08,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:35:08,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:35:08,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 08:35:08,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 08:35:08,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:35:08,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 08:35:08,628 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:35:08,628 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:35:08,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:35:08,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:35:08,693 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:35:08,695 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:35:22,792 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 08:35:22,792 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:35:22,799 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:35:22,800 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:35:22,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:35:22 BoogieIcfgContainer [2024-11-07 08:35:22,800 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:35:22,802 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:35:22,802 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:35:22,807 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:35:22,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:35:08" (1/3) ... [2024-11-07 08:35:22,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab1b0b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:35:22, skipping insertion in model container [2024-11-07 08:35:22,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:08" (2/3) ... [2024-11-07 08:35:22,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab1b0b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:35:22, skipping insertion in model container [2024-11-07 08:35:22,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:35:22" (3/3) ... [2024-11-07 08:35:22,809 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-72.i [2024-11-07 08:35:22,819 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:35:22,819 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:35:22,880 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:35:22,889 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;@3ddfec1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:35:22,890 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:35:22,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 08:35:22,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 08:35:22,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:35:22,905 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:35:22,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:35:22,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:35:22,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1442101837, now seen corresponding path program 1 times [2024-11-07 08:35:22,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:35:22,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120859750] [2024-11-07 08:35:22,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:35:22,918 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:35:22,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:35:22,924 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:35:22,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 08:35:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:23,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 08:35:23,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:35:24,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2024-11-07 08:35:24,009 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:35:24,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:35:24,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120859750] [2024-11-07 08:35:24,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [120859750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:35:24,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:35:24,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:35:24,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048749579] [2024-11-07 08:35:24,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:35:24,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:35:24,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:35:24,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:35:24,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:35:24,030 INFO L87 Difference]: Start difference. First operand has 62 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 08:35:24,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:35:24,047 INFO L93 Difference]: Finished difference Result 117 states and 199 transitions. [2024-11-07 08:35:24,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:35:24,049 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2024-11-07 08:35:24,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:35:24,053 INFO L225 Difference]: With dead ends: 117 [2024-11-07 08:35:24,054 INFO L226 Difference]: Without dead ends: 58 [2024-11-07 08:35:24,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:35:24,059 INFO L432 NwaCegarLoop]: 84 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, 84 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:35:24,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:35:24,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-07 08:35:24,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-07 08:35:24,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 08:35:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2024-11-07 08:35:24,096 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 143 [2024-11-07 08:35:24,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:35:24,097 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2024-11-07 08:35:24,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 08:35:24,097 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2024-11-07 08:35:24,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 08:35:24,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:35:24,100 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:35:24,130 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-07 08:35:24,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:35:24,301 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:35:24,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:35:24,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1696472987, now seen corresponding path program 1 times [2024-11-07 08:35:24,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:35:24,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950357146] [2024-11-07 08:35:24,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:35:24,303 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:35:24,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:35:24,305 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:35:24,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 08:35:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:25,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 08:35:25,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:35:27,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 33 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-11-07 08:35:27,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:35:30,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-07 08:35:30,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:35:30,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950357146] [2024-11-07 08:35:30,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1950357146] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:35:30,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 08:35:30,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-07 08:35:30,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514247202] [2024-11-07 08:35:30,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 08:35:30,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 08:35:30,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:35:30,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 08:35:30,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:35:30,964 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-07 08:35:39,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 08:35:43,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 08:35:47,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 08:35:47,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:35:47,268 INFO L93 Difference]: Finished difference Result 121 states and 172 transitions. [2024-11-07 08:35:47,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 08:35:47,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 143 [2024-11-07 08:35:47,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:35:47,432 INFO L225 Difference]: With dead ends: 121 [2024-11-07 08:35:47,432 INFO L226 Difference]: Without dead ends: 66 [2024-11-07 08:35:47,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 278 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 08:35:47,433 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 36 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2024-11-07 08:35:47,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 120 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 133 Invalid, 3 Unknown, 0 Unchecked, 15.7s Time] [2024-11-07 08:35:47,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-07 08:35:47,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2024-11-07 08:35:47,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 08:35:47,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2024-11-07 08:35:47,446 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 143 [2024-11-07 08:35:47,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:35:47,446 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2024-11-07 08:35:47,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-07 08:35:47,447 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2024-11-07 08:35:47,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 08:35:47,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:35:47,450 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:35:47,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 08:35:47,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:35:47,651 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:35:47,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:35:47,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1789147683, now seen corresponding path program 1 times [2024-11-07 08:35:47,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:35:47,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750626879] [2024-11-07 08:35:47,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:35:47,653 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:35:47,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:35:47,655 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:35:47,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 08:35:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:48,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 08:35:48,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:36:05,591 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 08:36:13,945 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 08:36:22,156 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 08:36:30,517 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 08:36:38,890 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 08:36:47,264 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)